An Improved Method Based on Sunday String Matching Algorithm
Haijun Wang
Abstract
Haijun Wang
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.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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.
Key concepts: String searching algorithm, Commentz-Walter algorithm, Computer science, Approximate string matching, Matching (statistics), String metric, Algorithm, 3-dimensional matching