Oriya Nominal Forms: A Finite State Processing

Sahoo, Kalyanamalini (2003) Oriya Nominal Forms: A Finite State Processing. In: Conference on Convergent Technologies for Asia-Pacific Region TENCON 2003, 15-17 October, Bangalore,India, Vol.2, 730 -734.

Preview

PDF oriya.pdf Download (323kB)

Abstract

This paper discuss the morphological processing of nouns in Oriya in a deterministic Finite State Automation (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.

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:	05 Jan 2006
Last Modified:	19 Sep 2010 04:22
URI:	http://eprints.iisc.ac.in/id/eprint/4856

Actions (login required)

View Item