A Method for Improving String Pattern Matching Machines
- 1 January 1984
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. SE-10 (1) , 116-120
- https://doi.org/10.1109/tse.1984.5010205
Abstract
This correspondence describes an efficient string pattern matching machine to locate all occurrences of any of a finite number of keywords and phrases in an arbitrary text string. Some conditions are defined on the states of the machine in order to improve the speed and size of the machine by Aho and Corasick [1]. The pattern matching algorithm is partitioned into various cases by combining these conditions. Finally, the correspondence illustrates the proposed approach by applying it to the analysis of the machines for a simple search.Keywords
This publication has 4 references indexed in Scilit:
- A Method for Improving String Pattern Matching MachinesIEEE Transactions on Software Engineering, 1984
- The Construction of Stack-Controlling LR Parsers for Regular Right Part GrammarsACM Transactions on Programming Languages and Systems, 1981
- Fast Pattern Matching in StringsSIAM Journal on Computing, 1977
- Efficient string matchingCommunications of the ACM, 1975