Efficient String Matching: An Aid to Bibliographic Search

Communications of the ACM

Volumn 18, Issue 6, 1975, Pages 333-340

  Aho, Alfred V ^a   Corasick, Margaret J ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b MITRE CORPORATION   (United States)

Author keywords

bibliographic search; computational complexity; finite state machines; information retrieval; keywords and phrases; string pattern matching; text editing

Indexed keywords

BIBLIOGRAPHIES; COMPUTATIONAL COMPLEXITY; FINITE AUTOMATA; INFORMATION RETRIEVAL; AUTOMATA THEORY - FINITE AUTOMATA;

BIBLIOGRAPHIC SEARCH; FINITE NUMBER; FINITE STATES MACHINE; FINITE-STATE; PATTERN-MATCHING; SIMPLE++; STRING MATCHING; STRING PATTERN MATCHING; TEXT EDITING; TEXT STRING;

PATTERN MATCHING; INFORMATION RETRIEVAL SYSTEMS;

STRING MATCHING;

EID: 0016518897     PISSN: 00010782     EISSN: 15577317     Source Type: Journal    
DOI: 10.1145/360825.360855     Document Type: Article

References (17)

1. Aho, A.V., Hopcroft, J.E., and Ullman, J.D. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass., 1974.
2. Booth, T.L. Sequential Machines and Automata Theory. Wiley, New York, 1967.
3. Brzozowski, J.A. Derivatives of regular expressions. J. ACM 11:4 (October 1964), 481-494.
4. Bullen, R.H., Jr., and Millen, J.K. Microtext - the design of a microprogrammed finite state search machine for full-text retrieval. Proc. Fall Joint Computer Conference, 1972, pp. 479-488.
5. Fischer, M.J., and Paterson, M.S. String matching and other products. Technical Report 41, Project MAC, M.I.T., 1974.
6. Gimpel, J.A. A theory of discrete patterns and their implementation in SNOBOL4. Comm. ACM 16:2 (February 1973), 91-100.
7. Harrison, M.C. Implementation of the substring test by hashing. Comm. ACM 14:12 (December 1971), 777-779.
8. Johnson, W.L., Porter, J.H., Ackley, S.I., and Ross, D.T. Automatic generation of efficient lexical processors using finite state techniques. Comm. ACM 11:12 (December 1968), 805-813.
9. Kernighan, B.W., and Cherry, L.L. A system for typesetting mathematics. Comm. ACM 18:3 (March 1975), 151-156.
10. Kleene, S.C. Representation of events in nerve nets. In Autornata Studies, C.E. Shannon and J. McCarthy (eds.), Princeton University Press, 1956, pp. 3-40.
11. Knuth, D.E. Fundamental Algorithms, second edition, The Art of Computer Programming 1, Addison-Wesley, Reading, Mass., 1973.
12. Knuth, D.E. Sorting and Searching, The Art of Computer Programing 3, Addison-Wesley, Reading, Mass., 1973.
13. Knuth, D.E., Morris, J.H., Jr., and Pratt, V.R. Fast pattern matching in strings. TR CS-74-440, Stanford University, Stanford, California, 1974.
14. Kohavi, Z. Switching and Finite Automata Theory. McGraw-Hill, New York, 1970.
15. McNaughton, R., and Yamada, H. Regular expressions and state graphs for automata. IRE Trans. Electronic Computers 9:1 (1960), 39-47.
16. Rabin, M.O., and Scott, D. Finite automata and their decision problems. IBM J. Research and Development 3, (1959), 114-125.
17. Thompson, K. Regular search expression algorithm. Comm. ACM 11:6 (June 1968), 419-422.