大字符集语言单模式匹配算法  

Large Character Set Language Single Pattern Matching

作　　者：刘功申[1] 王永成[1] 胡佩华[1] 

机构地区：[1]上海交通大学计算机科学与工程系,上海200030

出　　处：《上海交通大学学报》2003年第6期878-881,886,共5页Journal of Shanghai Jiaotong University

基　　金：国家自然科学基金资助项目 (60 0 82 0 0 3 )

摘　　要：分析了大字符集的特点和人类查找字符串的过程 ,提出了一个新的单模式匹配算法 .该算法利用字频和已成功匹配的前、后缀信息对模式串进行预处理 .在查找阶段 ,运用了连续跳跃的思想 .实验表明 。Based on the analysis of the features of large character set language and the string searching procedure of human, a new algorithm was proposed. The algorithm preprocesses the pattern by using word frequency and the already-matched pattern prefix and suffix information. In the searching phase, the algorithm makes use of the continuous-skip idea. The experiment shows that the algorithm is more efficient than other algorithms.

关 键 词：模式匹配 KMP算法 BM算法 QS算法 字频 

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