Affiliation:
1. Bell Labs, Murray Hill, NJ
Abstract
This paper describes a simple, efficient algorithm to locate all occurrences of any of a finite number of keywords in a string of text. The algorithm consists of constructing a finite state pattern matching machine from the keywords and then using the pattern matching machine to process the text string in a single pass. Construction of the pattern matching machine takes time proportional to the sum of the lengths of the keywords. The number of state transitions made by the pattern matching machine in processing the text string is independent of the number of keywords. The algorithm has been used to improve the speed of a library bibliographic search program by a factor of 5 to 10.
Publisher
Association for Computing Machinery (ACM)
Reference16 articles.
1. Booth T.U Sequential Machines and Automata Theory. Wiley New York 1967. Booth T.U Sequential Machines and Automata Theory. Wiley New York 1967.
2. Derivatives of Regular Expressions
3. A theory of discrete patterns and their implementation in SNOBOL4
Cited by
1592 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献