Please use this identifier to cite or link to this item:
http://hdl.handle.net/123456789/132
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Melinamath, Bhuvaneshwari C. | - |
dc.contributor.author | Math, A.G. | - |
dc.contributor.author | Biradar, Sunanda D. | - |
dc.date.accessioned | 2021-07-22T09:51:31Z | - |
dc.date.available | 2021-07-22T09:51:31Z | - |
dc.date.issued | 2011-01 | - |
dc.identifier.uri | http://hdl.handle.net/123456789/132 | - |
dc.description.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. | en_US |
dc.language.iso | en_US | en_US |
dc.publisher | Springer | en_US |
dc.relation.ispartofseries | 139; | - |
dc.subject | FST, POS, NLP, DFA, NFA. | en_US |
dc.title | A Compiler for Morphological Analyzer Based on Finite-State Transducers | en_US |
dc.type | Article | en_US |
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.