期刊文献+

基于过滤的中文多模式近似字符串匹配算法 被引量:5

Algorithm of Multiple Approximate String for Chinese Characters Based on Filtering
下载PDF
导出
摘要 当前近似字符串匹配算法主要针对英文等中小字符集,该文针对汉字等大字符集的有效算法很少,尤其缺少适合汉字等大字符集的多模式近似匹配算法的情况,提出了一种适合汉字等大字符集的多模式近似匹配算法——MBPM-BM,通过实验证明了该算法的有效性。 Most of the algorithms of approximate string match are designed for small or middle size of character set. Until now, people can't find any efficient algorithms for searching of multiple patterns of large size of character set. This paper presents an algorithm MBPM-BM, which can be used for searching of multiple patterns. Experimental results show that MBPM-BM works well in practice especially in chinese characters match.
出处 《计算机工程》 EI CAS CSCD 北大核心 2006年第20期48-50,58,共4页 Computer Engineering
关键词 近似字符串匹配 中文字符串匹配 多模式匹配 位并行运算 过滤 Approximate string match Chinese string match Multiple patterns match Bit-parallel calculation Filtering
  • 相关文献

参考文献5

  • 1Navarro G.Multiple Approximate String Matching by Counting[C].Proc.of the WSP'97.Carleton University Press,1997:125-139. 被引量:1
  • 2陈开渠,赵洁,彭志威.快速中文字符串模糊匹配算法[J].中文信息学报,2004,18(2):58-65. 被引量:23
  • 3Hyyro H,Fredriksson K,Navarro G.Increased Bit-parallelism for Approximate String Matching[C].Proc.of WEA'04.Berlin:Springer Verlag,2004:285-298. 被引量:1
  • 4Myers G.A fast Bit-vector Algorithm for Approximate String Matching Based on Dynamic Programming[J].Journal of the ACM Archive,1999,46(3):395-415. 被引量:1
  • 5Hyyro H.Explaining and Extending the Bit-parallel Algorithm of Myers[R].University of Tampere,Finland,Technical Report:A-2001-10,2001. 被引量:1

二级参考文献13

  • 1[1]Sellers, P.. The theory and computation of evolutionary distance: pattern recognition. Journal of Algorithms[J], 1980,1:359-373. 被引量:1
  • 2[2]Baeza-Yates, R.A.,Gonnet, G.H.: A new approach to text searching, Communications of the ACM[J]. 35(10):74-82. 被引量:1
  • 3[3]Wu, S., Manber, U.. Fast text searching allowing errors, Communications of the ACM[J]. 35(10):83-91. 被引量:1
  • 4[4]Baeza-Yates, R.A., Navarro, G.. Faster approximate string matching. Algorithmica[J], 23(2):1999,127-158. 被引量:1
  • 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. 被引量:1
  • 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. 被引量:1
  • 7[7]Navarro, G., Baeza-Yates, R.A.. Very fast and simple approximate string matching. Information Processing Letters[J], 1999,72:65-70. 被引量:1
  • 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). 被引量:1
  • 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. 被引量:1
  • 10[10]Tarhio, J., Ukkonen, E.. Approximate Boyer-Moore string matching. SIAM Journal on computing[J], 1993,22(2):243-260. 被引量:1

共引文献22

同被引文献46

引证文献5

二级引证文献14

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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