Author Login Chief Editor Login Reviewer Login Editor Login Remote Office

›› 2004, Vol. 30 ›› Issue (01): 64-65.

• Papers • Previous Articles     Next Articles

Approximate Matching Based on Horspool Algorithm

QIAN Lijin,WU Zejun,DONG Hongbin   

  1. (State Key Laboratory of Software Engineering, School of Computer Science, Wuhan University, Wuhan 430072)
  • Published:2004-01-15

基于Horspool算法的模糊匹配

钱立进,吴泽俊,董红斌   

  1. 武汉大学软件工程国家重点实验室/计算机学院,武汉大学软件工程国家重点实验室/计算机学院,武汉大学软件工程国家重点实验室/计算机学院 武汉 430072

Abstract: 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.

摘要: 匹配模式中存在模糊信息的匹配形式称为模糊匹配,它是目前字符串匹配的重 要研究方向。Horspool算法是精确匹配的经典算法,但不能实现模糊匹配。该文将要求匹配 的模式转化为相应的二进制数序列,在Horspool算法基础上扩大其功能,使其能够实现模糊 匹配,且不影响其精确匹配的功能。

关键词: 模式匹配, 模糊匹配, BM算法, Horspool算法, 精确匹配

CLC Number: