Spellchecker for Malayalam using finite state transition models
暂无分享,去创建一个
Finite-state machine is used as a core technology in many fields of natural language processing. The applications include speech recognition and generation, spelling correction, fact extraction, information retrieval and approaches to translation. This paper describes the design of finite state machine in development of a Malayalam spellchecker. Conventional spell checkers has the disadvantage of large dictionary size which can be reduced using finite state models. Morphological factors like word categories and their inflections evolve automatically during training of these models if we train the model with an appropriate training set.
[1] V. K. Bhadran,et al. Issues in development of Malayalam Morphological Analyzer , 2012, 2012 Annual IEEE India Conference (INDICON).
[2] Christopher D. Manning,et al. Probabilistic Finite State Machines for Regression-based MT Evaluation , 2012, EMNLP.
[3] Dida Midekso,et al. Design And Implementation Of Morphology Based Spell Checker , 2014 .