A Deterministic Finite State Automaton for the Oriya Negative Verbal Forms

Sahoo, Kalyanamalini (2002) A Deterministic Finite State Automaton for the Oriya Negative Verbal Forms. In: Language Engineering Conference, 2002. LEC 2002, 13-15 December, Hyderabad,India, pp. 110-120.

Preview

PDF deterministic.pdf Download (269kB)

Abstract

This paper discusses the processing of negative verbal forms in Oriya in a deterministic finite state automaton. A morphologically agglutinative language like Oriya has 'phrasal' or 'constituent' negation, where tense and aspect etc. impose restrictions on NEG marking. Negation can be marked by various NEG morphemes in various positions of the verbal form, but is marked only once. That is, the occurrence of a NEG morpheme restricts the occurrence of any other NEG marker in the verbal form. Such multiple positional slots for the NEG morpheme with respect to tense and aspect poses a constraint for processing of the string by FSA. The FSA, being a unidirectional machine, cannot backtrack and thus, cannot account for such mutual exclusiveness of the items if all the three NEG items are available in a single chart. So, to account for this problem, we propose different types of processing for the different positional slots of NEG morphemes.

Item Type:	Conference Paper
Publisher:	IEEE
Additional Information:	Copyright 1990 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Department/Centre:	Division of Interdisciplinary Sciences > Management Studies
Date Deposited:	24 Jan 2006
Last Modified:	19 Sep 2010 04:23
URI:	http://eprints.iisc.ac.in/id/eprint/5190

Actions (login required)

View Item