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
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.