Abstract: 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.

Key words: Approximate string match, Chinese string match, Multiple patterns match, Bit-parallel calculation, Filtering

摘要： 当前近似字符串匹配算法主要针对英文等中小字符集，该文针对汉字等大字符集的有效算法很少，尤其缺少适合汉字等大字符集的多模式近似匹配算法的情况，提出了一种适合汉字等大字符集的多模式近似匹配算法——MBPM-BM，通过实验证明了该算法的有效性。 近似字符串匹配；中文字符串匹配；多模式匹配；位并行运算；过滤

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