Please use this identifier to cite or link to this item: http://hdl.handle.net/123456789/132
Full metadata record
DC FieldValueLanguage
dc.contributor.authorMelinamath, Bhuvaneshwari C.-
dc.contributor.authorMath, A.G.-
dc.contributor.authorBiradar, Sunanda D.-
dc.date.accessioned2021-07-22T09:51:31Z-
dc.date.available2021-07-22T09:51:31Z-
dc.date.issued2011-01-
dc.identifier.urihttp://hdl.handle.net/123456789/132-
dc.description.abstractMorphological analyzers are an essential parts of many natural language processing (NLP) systems such as machine translation systems. They may be efficiently implemented as finite state transducers. This paper describes a morphological system that can be used as stemmer, lemmatizer, spell checker, POS tagger, and as E-learning tool for Kannada learning people giving detailed explanation of various morphophonemics changes that occur in saMdhi. The language specific components, the lexicon and the rules, can be combined with a runtime engine applicable to all languages. Building Morphological analyzer/ generator for morphologically complex and agglutinative language like Kannada is highly challenging. The major types of morphological process like inflection, derivation, and compounding are handled in this system.en_US
dc.language.isoen_USen_US
dc.publisherSpringeren_US
dc.relation.ispartofseries139;-
dc.subjectFST, POS, NLP, DFA, NFA.en_US
dc.titleA Compiler for Morphological Analyzer Based on Finite-State Transducersen_US
dc.typeArticleen_US
Appears in Collections:F P

Files in This Item:
File Description SizeFormat 
42 A compiler for morphological analyzer based on finite-state transducers.pdf197.05 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.