Efficient text searching
Handbook of algorithms and data structures: in Pascal and C (2nd ed.)
Handbook of algorithms and data structures: in Pascal and C (2nd ed.)
Algorithms for finding patterns in strings
Handbook of theoretical computer science (vol. A)
Software—Practice & Experience
Text algorithms
A taxonomy of sublinear multiple keyword pattern matching algorithms
Science of Computer Programming
A fast string searching algorithm
Communications of the ACM
Efficient string matching: an aid to bibliographic search
Communications of the ACM
Communications of the ACM
A String Matching Algorithm Fast on the Average
Proceedings of the 6th Colloquium, on Automata, Languages and Programming
A New Regular Grammar Pattern Matching Algorithm
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
| Hi-index | 5.23 |
This paper presents a Boyer-Moore type algorithm for regular grammar pattern matching, answering a variant of an open problem posed by Aho (Pattern Matching in Strings, Academic Press, New York, 1980, p. 342). The new algorithm handles patterns specified by regular (left linear) grammars--a generalization of the Boyer-Moore (single keyword) and Commentz-Walter (multiple keyword) algorithms.Like the Boyer-Moore and Commentz-Walter algorithms, the new algorithm makes use of shift functions which can be precomputed and tabulated. The precomputation functions are derived, and it is shown that they can be obtained from Commentz-Walter's d1 and d2 shift functions.In most cases, the Boyer-Moore (respectively, Commentz-Walter) algorithm has greatly outperformed the Knuth-Morris-Pratt (respectively, Aho-Corasick) algorithm. In practice, an earlier version of the algorithm presented in this paper also frequently outperforms the regular grammar generalization of the Aho-Corasick algorithm.