This paper discusses the morphological processing of nouns in Oriya in a deterministic Finite State Automaton (FSA). It proposes a model for designing a morphological analyzer for Oriya nouns, which can provide lexical, morphological and syntactic information for each lexical unit in the analyzed nominal form. It draws out a finite-state machine that accepts valid sequences of morphemes in a nominal form and rejects invalid ones.
REF described a finite state morphological analyser for the nouns in Oriya.
Oriya nominal forms: a finite state processing
TENCON 2003. Conference on Convergent Technologies for Asia-Pacific Region
TENCON 2003. Conference on Convergent Technologies for Asia-Pacific Region
Computer Science