王雁飞, 张文俊, 田丰, 王海君. 一种改进的Sunday字符串匹配算法[J]. 微电子学与计算机, 2013, 30(4): 87-89.
引用本文: 王雁飞, 张文俊, 田丰, 王海君. 一种改进的Sunday字符串匹配算法[J]. 微电子学与计算机, 2013, 30(4): 87-89.
WANG Yan-fei, ZHANG Wen-jun, TIAN Feng, WANG Hai-jun. An Improved Method Based on Sunday String Matching Algorithm[J]. Microelectronics & Computer, 2013, 30(4): 87-89.
Citation: WANG Yan-fei, ZHANG Wen-jun, TIAN Feng, WANG Hai-jun. An Improved Method Based on Sunday String Matching Algorithm[J]. Microelectronics & Computer, 2013, 30(4): 87-89.

一种改进的Sunday字符串匹配算法

An Improved Method Based on Sunday String Matching Algorithm

  • 摘要: 在信息检索领域里,字符串匹配是一个被广泛而深入研究的问题.本文尝试分析几种字符串匹配算法的特点,并以此为基础,提出一种改进的Sunday算法.该算法使用先转移后匹配的策略,试图减少字符串匹配过程中无端的匹配.实验表明,本文改进的算法可以缩减匹配次数,从而使匹配效率得到进一步提高.

     

    Abstract: In the field of information retrieval,the problem of string matching is researched widely and deeply.This paper analyzes the characteristics of several string matching algorithms.An improved Sunday algorithm based on the common string matching algorithms is presented.It attempts to reduce the number of unnecessary matching,using the idea of transfer before comparison.Experiments show that the algorithm effectively reduces the number of matching and enhances the matching efficiency.

     

/

返回文章
返回