基于不确定有限自动机的蒙古文校对算法

A Proofreading Algorithm of Mongolian Text Based on Nondeterministic Finite Automata

该文首先分析了蒙古文电子文本中存在的错误类型、出错原因以及常用的查错纠错方法,然后根据蒙古文特有的书写习惯和编码特点提出一种基于不确定有限自动机的校对算法。该算法采用有限自动机的方法对校对算法所依据的知识词典进行描述,大大提高了文本查错和纠错速度。

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.