一种适于中文检索的单模式匹配算法  

A Single Pattern Matching Algorithm for Chinese Retrieval

作　　者：韩云苏 欧贤[2] 刘嘉勇[1] 

机构地区：[1]四川大学电子信息学院,四川成都610065 [2]西南交通大学希望学院,四川成都610400

出　　处：《信息安全与通信保密》2014年第11期88-91,共4页Information Security and Communications Privacy

摘　　要：文中主要对KMP算法、BM算法、Sunday算法进行了研究分析,根据中文汉字在计算机中的编码规则,提出了一种用于中文检索的CSPM算法。该算法充分利用已匹配信息,实现了待匹配文本串指针和模式串指针均不回溯,增大了跳跃距离,有效地提高了匹配速率。实验结果显示,CSPM算法较其他几种算法有更好的时间性能。This paper discusses and analyzes some single-pattern matching algorithms such as KMP,BM and Sunday algorithm,and proposes a CSPM algorithm suitable for Chinese retrieval based on the encoding rules of Chinese characters in computer. By taking full advantage of the matched information, this algorithm could achieve the goal of guaranteeing both the main string pointer and pattern string pointer against back-tracing,increase the leap distance and effectively improve the matching rate. Experiment result inideates that the CSPM algorithm enjoys better time performance compared with other algorithms.

关 键 词：编码规则 中文检索 CSPM算法 

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