斯·劳格劳. 基于不确定有限自动机的蒙古文校对算法[J]. 中文信息学报, 2009, 23(6): 110-116.
S·Loglo. A Proofreading Algorithm of Mongolian Text Based on Nondeterministic Finite Automata. , 2009, 23(6): 110-116.
基于不确定有限自动机的蒙古文校对算法
斯·劳格劳
内蒙古大学 蒙古学学院,内蒙 呼和浩特 010021
A Proofreading Algorithm of Mongolian Text Based on Nondeterministic Finite Automata
S·Loglo
College of Mongology, Inner Mongolia University, Hohhot, Neimeng 010021,China
Abstract：This paper first analyzes the error types existing in Mongolian text, the reasons for mistakes and the commonly used methods for spell-check and error-correcting in Mongolian text proofreading. Then according to the characteristics of Mongolian code and writing rules, an automatic proofreading algorithm based on Nondeterministic Finite Automata has been introduced. This algorithm has greatly improved the spell-check and error-correcting speed by using Nondeterministic Finite Automata in it's knowledge dictionary. Key wordsartificial intelligence; natural language processing; Mongolian; proofread; automata; morphological analysis
[1] 张仰森,俞士汶.文本自动校对技术研究综述[J].计算机应用研究,2006,6: 8-12. [2] 张仰森,丁冰青.中文文本自动校对技术现状及展望[J].中文信息学报,1998,12(3): 50-56. [3] 张仰森.中文校对系统中纠错知识库的构造及纠错建议的产生算法[J].中文信息学报,2001,15(5): 33-39. [4] 古丽拉·阿东别克,艾尔肯·伊米尔.维吾尔文校对中常见错误分析[J].计算机工程与应用,2005,27: 181-183. [5] Wuu Y. Mealy machines are a better model of lexical analyzers[J].Computer Languages,1996,22(1): 27-38. [6] 斯·劳格劳,敖其尔.基于Mealy机的蒙古文排序算法[J].内蒙古大学学报(自然科学版),2008,4: 301-304. [7] 蔡增玉,谷文祥.汉字双向有穷自动机的研究[J].中文信息学报,2005,19(3): 40-44. [8] Jian hua, Wang Xiaolong. Study on Automatic Spelling Check and Correction[J]. Journal of Chinese Language and Computing, 2003,1(1): 25-36. [9] Karen Kukich. Techniques for Automatically Correcting Words in Text [J]. ACM Computing Surveys, 1992, 24(4): 377-438.
2009, Vol. 23 
