Parsing as deduction
Open accessThe DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Abstract
By exploring the relationship between parsing and deduction, a new and more general view of chart parsing is obtained, which encompasses parsing for grammar formalisms based on unification, and is the basis of the Earley Deduction proof procedure for definite clauses. The efficiency of this approach for an interesting class of grammars is discussed.
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
A Machine-Oriented Logic Based on the Resolution Principle
Robinson, J. A. (1965) · Journal of the ACM · doi:10.1145/321250.321253 · Cited by 3,909
An efficient context-free parsing algorithm
Earley, J. (1983) · Communications of the ACM · doi:10.1145/357980.358005 · Cited by 1,606
The Semantics of Predicate Logic as a Programming Language
Van Emden, M. H., & Kowalski, R. A. (1976) · Journal of the ACM · doi:10.1145/321978.321991 · Cited by 1,449
Kowalski, R., & Smoliar, S. (1982) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/1005937.1005947 · Cited by 1,182
Pereira, F. C. N., & Warren, D. H. D. (1980) · Artificial Intelligence · doi:10.1016/0004-3702(80)90003-x · Cited by 978
Self-citationLexical-Functional Grammar: A Formal System for Grammatical Representation
Kaplan, R. M., & Bresnan, J. (1995) · Cited by 725
An efficient easily adaptable system for interpreting natural language queries
Warren, D. H. D., & Pereira, F. C. N. (1982) · doi:10.5555/972942.972944 · Cited by 275
Self-citationA Machine-Oriented Logic Based on the Resolution Principle
Robinson, J. A. (1965) · Automation of Reasoning · doi:10.1007/978-3-642-81952-0_26 · Cited by 234
Colmerauer, A. (2005) · Lecture Notes in Computer Science · doi:10.1007/bfb0031371 · Cited by 231
An Improved Context-Free Recognizer
Graham, S. L., Harrison, M. A., & Ruzzo, W. L. (1980) · ACM Transactions on Programming Languages and Systems · doi:10.1145/357103.357112 · Cited by 206
Logic for natural language analysis
Pereira, F. C. N. (1982) · OpenGrey (Institut de l'Information Scientifique et Technique) · Cited by 74
Self-citation
Cited by
(2003) · Linguistics Encyclopedia · doi:10.4324/9780203432860-52 · Cited by 319
Grune, D., & Jacobs, C. J. H. (2008) · Monographs in Computer Science · doi:10.1007/978-0-387-68954-8 · Cited by 290
Measuring the Evolution of a Scientific Field through Citation Frames
Jurgens, D., Kumar, S., Hoover, R., McFarland, D., & Jurafsky, D. (2018) · Transactions of the Association for Computational Linguistics · doi:10.1162/tacl_a_00028 · Cited by 212
“For example, in 1991, authors compared with a diffuse group of parsing papers, e.g., (Shieber, 1988; Pereira and Warren, 1983; Haas, 1989), with such papers receiving at most three citations that year; whereas in 2000, most comparisons were to a core set of parsing papers, e.g., (Collins, 1999;…”
Result
Metadata
- Authors
- Pereira, F. C. N., & Warren, D. H. D.
- Venue
- Proceedings of the 21st annual meeting on Association for Computational Linguistics -
- Published
- 1983
- Pages
- 137
- OpenAlex
- W2161021345
- Cited by
- 290
- References
- 11
- FWCI
- 7.37
- Type
- conference paper
- 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.