Please use this identifier to cite or link to this item:
http://hdl.handle.net/123456789/132
Title: | A Compiler for Morphological Analyzer Based on Finite-State Transducers |
Authors: | Melinamath, Bhuvaneshwari C. Math, A.G. Biradar, Sunanda D. |
Keywords: | FST, POS, NLP, DFA, NFA. |
Issue Date: | Jan-2011 |
Publisher: | Springer |
Series/Report no.: | 139; |
Abstract: | Morphological 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. |
URI: | http://hdl.handle.net/123456789/132 |
Appears in Collections: | F P |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
42 A compiler for morphological analyzer based on finite-state transducers.pdf | 197.05 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.