网络信息审计系统中的多模式相似匹配算法.PDF

1000-9825/2004/15(07)1074 ©2004 Journal of Software 软 件 学 报 Vol.15, No.7 ∗ 网络信息审计系统中的多模式相似匹配算法 + 高 鹏 , 张德运, 孙钦东, 翟亚辉, 卢伍春 (西安交通大学 电子与信息工程学院,陕西 西安 710049) A Multiple Approximate String Matching Algorithm of Network Information Audit System + GAO Peng , ZHANG De-Yun, SUN Qin-Dong, ZHAI Ya-Hui, LU Wu-Chun (School of Electronics and Information Engineering, Xi’an Jiaotong University, Xi’an 710049, China) + Corresponding author: Phn: +86-29 E-mail: g622@, Received 2003-05-21; Accepted 2003-09-26 Gao P, Zhang DY, Sun QD, Zhai YH, Lu WC. A multiple approximate string matching algorithm of network information audit system. Journal of Software, 2004,15(7):1074~1080. /1000-9825/15/1074.htm Abstract: This paper shows a simple, efficient, and practical algorithm for locating all occurrences of a finite number of keywords in a char/Chinese character string allowing k chars inserting errors. The algorithm consists of constructing multiple finite state single-pattern matching machines from keywords and a state-driver applied to drive all finite state single-pattern matching machines, and then using the state-driver to process the text string in a single pass. Speed of the matching is independent of the amount of the inserting errors. Generally, the algorithms do not need to inspect every character of the string. They skip as many characters as possible by making full use of the information in matching failure and text window mechanism. This algorithm can be widely applied to network information auditing, database, information retrieval, and etc. Key words: information audit; matching allowing errors; multiple approximate string match; finite state machine 摘 要: 针