基于过滤的中文多模式近似字符串匹配算法  

Algorithm of Multiple Approximate String for Chinese Characters Based on Filtering

作　　者：范立新[1] 谢晓能[1] 吴飞[1] 

机构地区：[1]浙江大学计算机学院

出　　处：《计算机工程》2006年第20期48-50,58,共4页Computer Engineering

摘　　要：当前近似字符串匹配算法主要针对英文等中小字符集,该文针对汉字等大字符集的有效算法很少,尤其缺少适合汉字等大字符集的多模式近似匹配算法的情况,提出了一种适合汉字等大字符集的多模式近似匹配算法——MBPM-BM,通过实验证明了该算法的有效性。Most of the algorithms of approximate string match are designed for small or middle size of character set. Until now, people can＇t find any efficient algorithms for searching of multiple patterns of large size of character set. This paper presents an algorithm MBPM-BM, which can be used for searching of multiple patterns. Experimental results show that MBPM-BM works well in practice especially in chinese characters match.

关 键 词：近似字符串匹配 中文字符串匹配 多模式匹配 位并行运算 过滤 

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