The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Efficient string matching: an aid to bibliographic search
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Design and Analysis of Computer Algorithms
Aho, A. V., & Hopcroft, J. E. (1974) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,403
Self-citationFinite Automata and Their Decision Problems
Rabin, M. O., & Scott, D. (1959) · IBM Journal of Research and Development · doi:10.1147/rd.32.0114 · Cited by 1,879
Switching and Finite Automata Theory
Kohavi, Z., & Jha, N. K. (2009) · Cambridge University Press eBooks · doi:10.1017/cbo9780511816239 · Cited by 1,766
Knuth, D. E. (1973) · Cumulative Index of Computer Aided Architectural Design · Cited by 1,719
Derivatives of Regular Expressions
Brzozowski, J. A. (1964) · Journal of the ACM · doi:10.1145/321239.321249 · Cited by 923
Programming Techniques: Regular expression search algorithm
Thompson, K. (1968) · Communications of the ACM · doi:10.1145/363347.363387 · Cited by 854
Regular Expressions and State Graphs for Automata
McNaughton, R., & Yamada, H. (1960) · IEEE Transactions on Electronic Computers · doi:10.1109/tec.1960.5221603 · Cited by 519
Vasconcelos, W. V. (1998) · Algorithms and Computation in Mathematics · doi:10.1007/978-3-642-58951-5_2 · Cited by 404
A system for typesetting mathematics
Kernighan, B. W., & Cherry, L. L. (1975) · Communications of the ACM · doi:10.1145/360680.360684 · Cited by 127
Implementation of the substring test by hashing
Harrison, M. C. (1971) · Communications of the ACM · doi:10.1145/362919.362934 · Cited by 99
Automatic generation of efficient lexical processors using finite state techniques
Johnson, W. L., Porter, J. H., Ackley, S. I., et al. (1968) · Communications of the ACM · doi:10.1145/364175.364185 · Cited by 69
Cited by
Fast Pattern Matching in Strings
Knuth, D. E., Morris, Jr., & Pratt, V. R. (1977) · SIAM Journal on Computing · doi:10.1137/0206024 · Cited by 2,936
Automated generation of heuristics for biological sequence comparison
Slater, G. S. C., & Birney, E. (2005) · BMC Bioinformatics · doi:10.1186/1471-2105-6-31 · Cited by 2,933
A guided tour to approximate string matching
Navarro, G. (2001) · ACM Computing Surveys · doi:10.1145/375360.375365 · Cited by 2,561
A fast string searching algorithm
Boyer, R. S., & Moore, J. S. (1977) · Communications of the ACM · doi:10.1145/359842.359859 · Cited by 2,290
Intrusion detection system: A comprehensive review
Liao, H.-J., Richard Lin, C.-H., Lin, Y.-C., & Tung, K.-Y. (2013) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2012.09.004 · Cited by 1,630
Metadata
- Authors
- Aho, A. V., & Corasick, M. J.
- Venue
- Communications of the ACM
- Published
- 1975-06
- Volume
- 18
- Issue
- 6
- Pages
- 333-340
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W2099964107
- Cited by
- 2,944
- References
- 11
- FWCI
- 6.32
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.