期刊文献+

一种改进的Wu-Manber多模式匹配算法及应用 被引量:10

An Improved Wu-Manber Multiple-pattern Matching Algorithm and Its Application
下载PDF
导出
摘要 本文针对Wu-Manber多模式匹配算法在处理后缀模式情况下的不足,给出了一种改进的后缀模式处理算法,减少了匹配过程中字符比较的次数,提高了算法的运行效率。本文在随机选择的TREC2000的52,067篇文档上进行了全文检索实验,对比了Wu-Manber算法、使用后缀模式的改进算法、不使用后缀模式的简单改进等三种算法的匹配过程中字符比较的次数。实验结果说明,本文的改进能够比较稳定的减少匹配过程中字符比较的次数,提高匹配的速度和效率。 The Wu-Manber multiple-pattern matching algorithm does not work well when some patterns are suffix of other patterns. To solve the problem, an improved algorithm is introduced which reduces the number of comparisons during pattern matching and leads to a faster matching algorithm. The text retrieval experiments use 52,067 passages which are randomly selected from TREC2000. Three algorithms including the Wu-Manber algorithm, the improved algorithm and the algorithm simply breaks halfway, are compared and the results show that the improved algorithm can steadily reduce the number of character comparisons and thus work more efficiently.
出处 《中文信息学报》 CSCD 北大核心 2006年第2期47-52,共6页 Journal of Chinese Information Processing
基金 国家自然科学基金重点基金资助(60435020) 哈尔滨工业大学校基金资助项目(HIT2002.71)
关键词 计算机应用 中文信息处理 多模式匹配 后缀模式 字符串匹配 全文检索 信息检索 computer application Chinese information processing multiple-pattern matching sutffix pattern string matching full text retrieval information retrieval
  • 相关文献

参考文献10

  • 1Knuth DE,Morris JH,Pratt VR.Fast pattern matching in sirings[J].SIAM J Comput,1977,6(2):323-350.
  • 2Boyer RS,Moore JS.A fast string searching algorithm[J].Communications of the ACM.1977,20(10):762-772.
  • 3Karp R.M.,Rabin M.O.,Efficient randomized pattern-matching algorithms[J].IBM Journal Res Dev.1987,31(2):249-260.
  • 4A.V.Aho,M.J.Corasick.Efficient String Matching:An Aid to Bibliographic Search[J].Communications of the ACM,1975,18(6):333-340.
  • 5BeateCommentz-Walter.A string matching algorithm fast on the average[A].In:Proceedingsofthe6thColloquium,on Automata,Languages and Programming[C].Springer-Verlag,London,UK.1979,118-132.
  • 6S.Wu,U.Manber.A Fast Algorithm For Multi-Pattern Searching[J].Technical Report TR-94-17,University of Arizona.1994,1-11.
  • 7王素琴,邹旭楷.一种优化的并行汉字/字符串匹配算法[J].中文信息学报,1995,9(1):49-53. 被引量:4
  • 8陈开渠,赵洁,彭志威.快速中文字符串模糊匹配算法[J].中文信息学报,2004,18(2):58-65. 被引量:23
  • 9ES de Moura.Fast and flexible word searching on compressed text[A].ACM Transactions on Information Systems,2000.
  • 10张鑫,谭建龙,程学旗.一种改进的Wu-Manber多关键词匹配算法[J].计算机应用,2003,23(7):29-31. 被引量:27

二级参考文献18

  • 1[1]Sellers, P.. The theory and computation of evolutionary distance: pattern recognition. Journal of Algorithms[J], 1980,1:359-373.
  • 2[2]Baeza-Yates, R.A.,Gonnet, G.H.: A new approach to text searching, Communications of the ACM[J]. 35(10):74-82.
  • 3[3]Wu, S., Manber, U.. Fast text searching allowing errors, Communications of the ACM[J]. 35(10):83-91.
  • 4[4]Baeza-Yates, R.A., Navarro, G.. Faster approximate string matching. Algorithmica[J], 23(2):1999,127-158.
  • 5[5]Myers, G.: A fast bit-vector algorithm for approximate string matching based on dynamic programming. Journal of the ACM[J], 46(3):1999,395-415.
  • 6[6]Chang, W., Marr, T.. Approximate string matching and local similarity[A]. In: Proc. 5th Combinational Pattern Matching (CPM94) [C], LNCS 807, pages 1994,259-271.
  • 7[7]Navarro, G., Baeza-Yates, R.A.. Very fast and simple approximate string matching. Information Processing Letters[J], 1999,72:65-70.
  • 8[8]Navarro, G., Raffinot, M.. Fast and flexible string matching by combining bit-parallelism and suffix automata. ACM Journal of Experimental Algorithmics (JEA) [J], 2000,5(4).
  • 9[9]Sutinen, E., Tarhio, J.. On using q-gram locations in approximate string matching[A]. In: Proc. European Symposium on Algorithms (ESA95) [C], LNCS 979, 1995,327-340.
  • 10[10]Tarhio, J., Ukkonen, E.. Approximate Boyer-Moore string matching. SIAM Journal on computing[J], 1993,22(2):243-260.

共引文献49

同被引文献47

引证文献10

二级引证文献29

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部