一种中文字符串近似匹配查询技术研究  

Research on Chinese String Approximate Matching Inguire Technique

作　　者：刘兵[1] 臧天阳[1] 张晶[1] 

机构地区：[1]空军航空大学基础部实验中心,长春130022

出　　处：《电脑编程技巧与维护》2013年第14期6-6,9,共2页Computer Programming Skills & Maintenance

摘　　要：字符串匹配是计算机科学中最经典、研究最广泛的问题之一,并且已经被应用到了众多领域当中。近似字符串匹配问题的研究虽然经历了不短的时间历程,但是其中的研究对象绝大多数主要是针对DNA等小型字符集或针对英文等中等大小字符集,而对于汉字乃至亚洲语音等大型字符集的研究却仍然不多。因此,研究高效的近似字符串匹配算法具有重要的理论价值和实际意义。String matching is one of the most typical problems in computer science. Many researchers have focused on this problem for a long time and it has been applied in many fields. For the problem of approximate string matching, though a number of algorithms have been proposed, there are few studies which focus on large size of alphabet ~. Most of experts are interested in small or middle size of alphabet ∑. For large size of ∑, especially for Chinese characters and Asian phonetics, there are few effeient algorithms. Therefore, it has very important theoretical value and practical meaning to research high efficient approximate string matching algorithms.

关 键 词：中文字符串 近似匹配 过滤 q-gram技术 

分 类 号：TP391.1[自动化与计算机技术—计算机应用技术]