The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
An efficient context-free parsing algorithm
Open accessAbstract
A parsing algorithm which seems to be the most efficient general context-free algorithm known is described. It is similar to both Knuth's LR( k ) algorithm and the familiar top-down algorithm. It has a time bound proportional to n 3 (where n is the length of the string being parsed) in general; it has an n 2 bound for unambiguous grammars; and it runs in linear time on a large class of grammars, which seems to include most practical context-free programming language grammars. In an empirical comparison it appears to be superior to the top-down and bottom-up algorithms studied by Griffiths and Petrick.
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
Recognition and parsing of context-free languages in time n3
Younger, D. H. (1967) · Information and Control · doi:10.1016/s0019-9958(67)80007-x · Cited by 935
On the translation of languages from left to right
Knuth, D. E. (1965) · Information and Control · doi:10.1016/s0019-9958(65)90426-2 · Cited by 780
Feldman, J., & Gries, D. (1968) · Communications of the ACM · doi:10.1145/362896.362902 · Cited by 194
A Syntax-Analysis Procedure for Unambiguous Context-Free Grammars
Kasami, T., & Torii, K. (1969) · Journal of the ACM · doi:10.1145/321526.321531 · Cited by 67
Cited by
Machine Recognition of Human Activities: A Survey
Turaga, P., Chellappa, R., Subrahmanian, V. S., & Udrea, O. (2008) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2008.2005594 · Cited by 1,333
Transition network grammars for natural language analysis
Woods, W. A. (1970) · Communications of the ACM · doi:10.1145/355598.362773 · Cited by 1,323
A probabilistic earley parser as a psycholinguistic model
Hale, J. (2001) · Second meeting of the North American Chapter of the Association for Computational Linguistics on Language technologies 2001 - NAACL '01 · doi:10.3115/1073336.1073357 · Cited by 1,150
Pereira, F. C. N., & Warren, D. H. D. (1980) · Artificial Intelligence · doi:10.1016/0004-3702(80)90003-x · Cited by 978
YAGO: A Large Ontology from Wikipedia and WordNet
Suchanek, F. M., Kasneci, G., & Weikum, G. (2008) · Journal of Web Semantics · doi:10.1016/j.websem.2008.06.001 · Cited by 904
A probabilistic model of lexical and syntactic access and disambiguation
Jurafsky, D. (1996) · Cognitive Science · doi:10.1016/s0364-0213(99)80005-6 · Cited by 714
Recognition of visual activities and interactions by stochastic parsing
Ivanov, Y. A., & Bobick, A. F. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.868686 · Cited by 659
Intrusion detection via static analysis
Wagner, D., & Dean, R. (2002) · Proceedings 2001 IEEE Symposium on Security and Privacy. S&P 2001 · doi:10.1109/secpri.2001.924296 · Cited by 647
Kowalski, R. (1979) · Communications of the ACM · doi:10.1145/359131.359136 · Cited by 600
Hall, P. A. V., & Dowling, G. R. (1980) · ACM Computing Surveys · doi:10.1145/356827.356830 · Cited by 586
Unbounded Dependencies and Coordinate Structure
Gazdar, G. (1981) · Studies in Linguistics and Philosophy · doi:10.1007/978-94-009-3401-6_8 · Cited by 527
Agreement Processes in Sentence Comprehension
Pearlmutter, N. J., Garnsey, S. M., & Bock, K. (1999) · Journal of Memory and Language · doi:10.1006/jmla.1999.2653 · Cited by 403
Prolog and Natural Language Analysis
Harrison, S. P., Pereira, F. C. N., & Shieber, S. M. (1988) · Language · doi:10.2307/414538 · Cited by 364
Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
Cook, S. A. (1971) · Journal of the ACM · doi:10.1145/321623.321625 · Cited by 360
An Efficient Probabilistic Context-Free Parsing Algorithm that Computes Prefix Probabilities
Stolcke, A. (1994) · arXiv (Cornell University) · doi:10.48550/arxiv.cmp-lg/9411029 · Cited by 336
Probabilistic Top-Down Parsing and Language Modeling
Roark, B. (2001) · Computational Linguistics · doi:10.1162/089120101750300526 · Cited by 329
Van Dyke, J. (2003) · Journal of Memory and Language · doi:10.1016/s0749-596x(03)00081-0 · Cited by 319
Syntax augmented machine translation via chart parsing
Zollmann, A., & Venugopal, A. (2006) · Proceedings of the Workshop on Statistical Machine Translation - StatMT '06 · doi:10.3115/1654650.1654671 · Cited by 305
Pereira, F. C. N., & Warren, D. H. D. (1983) · Proceedings of the 21st annual meeting on Association for Computational Linguistics - · doi:10.3115/981311.981338 · Cited by 290
Gazdar, G. (1982) · The Nature of Syntactic Representation · doi:10.1007/978-94-009-7707-5_5 · Cited by 262
(1982) · OLAC - Open Language Archives Community · Cited by 140
Constrained Language Models Yield Few-Shot Semantic Parsers
Shin, R., Lin, C., Thomson, S., Chen, C., Roy, S., Platanios, E. A., Pauls, A., Klein, D., Eisner, J., & Van Durme, B. (2021) · Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/2021.emnlp-main.608 · Cited by 139
3D AffordanceNet: A Benchmark for Visual Object Affordance Understanding
Deng, S., Xu, X., Wu, C., Chen, K., & Jia, K. (2021) · 2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr46437.2021.00182 · Cited by 124
Fifty Years of Prolog and Beyond
KÖRNER, P., LEUSCHEL, M., BARBOSA, J., COSTA, V. S., DAHL, V., HERMENEGILDO, M. V., MORALES, J. F., WIELEMAKER, J., DIAZ, D., ABREU, S., et al. (2022) · Theory and Practice of Logic Programming · doi:10.1017/s1471068422000102 · Cited by 40
Learning Program Behavioral Models from Synthesized Input–Output Pairs
Mammadov, T., Klakow, D., Koller, A., & Zeller, A. (2026) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/3748720 · Cited by 5
Morbig: A Static parser for POSIX shell
Régis-Gianas, Y., Jeannerod, N., & Treinen, R. (2020) · Journal of Computer Languages · doi:10.1016/j.cola.2020.100944 · Cited by 3
Metadata
- Authors
- Earley, J.
- Venue
- Communications of the ACM
- Published
- 1983-01
- Volume
- 26
- Issue
- 1
- Pages
- 57-61
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W2122472280
- Cited by
- 1,606
- References
- 4
- FWCI
- 21.04
- Type
- journal article
- Language
- en
- Open access
- bronze
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.