期刊文献+

一种用于关键词检索的快速字符串精确匹配算法 被引量:7

A Calculate Way of Rapid String Precision Used for Keyword Index Matches
在线阅读 下载PDF
导出
摘要 在对BF算法、KMP算法、BMH算法、SUNDAY算法和ZZL算法等几种常见算法分析的基础上,提出一种用于关键词检索的快速字符串精确匹配算法,并通过实验得出基本结论。最后指出模糊匹配和精确匹配的主要区别并对全文总结。 Based on the analysis of BF calculate way, KMP calculate way, BMH calculate way, SUNDAY calculate way and ZZL calculate way, this paper puts forward a rapid string precision calculate way used for a keyword index, and gets basic conclusion through an experiment. Finally it points out that the faintness matches the main differentiation that matches with precision and tally up to the full text.
作者 赵俊杰
出处 《计算机系统应用》 2010年第2期189-191,共3页 Computer Systems & Applications
基金 教育部社科研究基金青年项目(07JC870006) 安徽省哲学社会规划项目(AHSKF07-08D03) 安徽财经大学教研重点项目(ACJYZD200914)
关键词 精确匹配 关键词检索 VC算法 模糊匹配 precision matches keyword inspectional VC calculate way misty match
  • 相关文献

参考文献5

二级参考文献22

  • 1潘景昌,夏蔚然,宗文婷,吕润川.按音标查询的英汉电子词典的设计与实现[J].电子技术应用,2005,31(1):15-17. 被引量:1
  • 2[1]Sellers, P.. The theory and computation of evolutionary distance: pattern recognition. Journal of Algorithms[J], 1980,1:359-373.
  • 3[2]Baeza-Yates, R.A.,Gonnet, G.H.: A new approach to text searching, Communications of the ACM[J]. 35(10):74-82.
  • 4[3]Wu, S., Manber, U.. Fast text searching allowing errors, Communications of the ACM[J]. 35(10):83-91.
  • 5[4]Baeza-Yates, R.A., Navarro, G.. Faster approximate string matching. Algorithmica[J], 23(2):1999,127-158.
  • 6[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.
  • 7[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.
  • 8[7]Navarro, G., Baeza-Yates, R.A.. Very fast and simple approximate string matching. Information Processing Letters[J], 1999,72:65-70.
  • 9[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).
  • 10[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.

共引文献72

同被引文献69

引证文献7

二级引证文献19

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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