期刊文献+

基于Horspool算法的模糊匹配 被引量:2

Approximate Matching Based on Horspool Algorithm
下载PDF
导出
摘要 匹配模式中存在模糊信息的匹配形式称为模糊匹配,它是目前字符串匹配的重 要研究方向。Horspool算法是精确匹配的经典算法,但不能实现模糊匹配。该文将要求匹配 的模式转化为相应的二进制数序列,在Horspool算法基础上扩大其功能,使其能够实现模糊 匹配,且不影响其精确匹配的功能。 Approximate matching is a type of matching whose pattern includes ap proximate informations and it is one of the main search areas currently related to string matching. Horspool algorithm is one of the most classic algorithms rel ated to accurate matching while it can not fulfill approximate matching.This pap er transforms pattern into binary lists and improves Horspool algorithm in order to fulfill both accurate matching and approximate matching.
出处 《计算机工程》 CAS CSCD 北大核心 2004年第1期60-61,共2页 Computer Engineering
基金 国家自然科学基金重大研究计划资助项目(90204011) 软件工程国家重点实验室 第4批开放基金资助项目
关键词 模式匹配 模糊匹配 BM算法 HORSPOOL算法 精确匹配 Pattern matching Approximate matching Boyer-moore algorithm Hors pool algorithm Accurate matching
  • 引文网络
  • 相关文献

参考文献6

  • 1[1]Ricardo A, Yates B, Gonnet G H. A New Approach to Text Searching. Communications of the ACM, 1992,35(10):74-82
  • 2[2]Hyyro H, Navarro G. Faster Bit-parallel Approximate String Matching. In Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching (CPM 2002), LNCS 2373, 2002:203-224
  • 3[3]Czumaj A, Crochemore M, Gasieniec L, et al. Speeding up Two String -matching Algorithms. Algorithmica, 1994,12:247-267
  • 4[4]Boyer R, Moore S. A Fast String Searching Algorithm. Communi- cations of the ACM,1977, 20:762-772
  • 5[5]Horspool N. Practical Fast Searching in Strings. Software--Practice and Experience,1980, 10
  • 6[6]Yates R B, Navarro G. A Hybrid Indexing Method for Approximate String Matching. Journal of Discrete Algorithms (JDA), 2001

同被引文献26

引证文献2

二级引证文献1

;
使用帮助 返回顶部