Efficient string matching: an aid to bibliographic search
作者： Alfred V. Aho , Margaret J. Corasick
关键词:
摘要: 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 …
acm.org
sci-hub.se 参考文章(14)
M. S. Paterson, M. J. Fischer, STRING-MATCHING AND OTHER PRODUCTS Massachusetts Institute of Technology. ,(1974)
Zvi Kohavi, Niraj K. Jha, Switching and Finite Automata Theory ,(2010)
Donald Ervin Knuth, Sorting and Searching ,(1973)
Aho AV, JE Hopcroft, JD Ullman, The Design and Analysis of Computer Algorithms ,(1974)
R. H. Bullen, J. K. Millen, Microtext Proceedings of the December 5-7, 1972, fall joint computer conference, part I on - AFIPS '72 (Fall, part I). pp. 479- 488 ,(1972) , 10.1145/1479992.1480059
Walter L. Johnson, James H. Porter, Stephanie I. Ackley, Douglas T. Ross, Automatic generation of efficient lexical processors using finite state techniques Communications of the ACM. ,vol. 11, pp. 805- 813 ,(1968) , 10.1145/364175.364185
M. O. Rabin, D. Scott, Finite automata and their decision problems Ibm Journal of Research and Development. ,vol. 3, pp. 114- 125 ,(1959) , 10.1147/RD.32.0114
Malcolm C. Harrison, Implementation of the substring test by hashing Communications of The ACM. ,vol. 14, pp. 777- 779 ,(1971) , 10.1145/362919.362934
Brian W. Kernighan, Lorinda L. Cherry, A system for typesetting mathematics Communications of The ACM. ,vol. 18, pp. 151- 157 ,(1975) , 10.1145/360680.360684
Ken Thompson, None, Programming Techniques: Regular expression search algorithm Communications of The ACM. ,vol. 11, pp. 419- 422 ,(1968) , 10.1145/363347.363387