The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
The equivalence of four extensions of context-free grammars
Open accessAbstract
There is currently considerable interest among computational linguists in grammatical formalisms with highly restricted generative power. This paper concerns the relationship between the class of string languages generated by several such formalisms, namely, combinatory categorial grammars, head grammars, linear indexed grammars, and tree adjoining grammars. Each of these formalisms is known to generate a larger class of languages than context-free grammars. The four formalisms under consideration were developed independently and appear superficially to be quite different from one another. The result presented in this paper is that all four of the formalisms under consideration generate exactly the same class of string languages.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Generalized Phrase Structure Grammar.
Soames, S., Gazdar, G., Klein, E., Pullum, G., & Sag, I. (1989) · The Philosophical Review · doi:10.2307/2185122 · Cited by 1,829
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
Joshi, A. K., Levy, L. S., & Takahashi, M. (1975) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(75)80019-5 · Cited by 770
Evidence against the context-freeness of natural language
Shieber, S. M. (1985) · Linguistics and Philosophy · doi:10.1007/bf00630917 · Cited by 655
Dependency and Coordination in the Grammar of Dutch and English
Steedman, M. (1985) · Language · doi:10.2307/414385 · Cited by 358
Categorial Grammars and Natural Language Structures
(1988) · Studies in Linguistics and Philosophy · doi:10.1007/978-94-015-6878-4 · Cited by 320
Characterizing mildly context-sensitive grammar formalisms
Weir, D. J., & Joshi, A. K. (1988) · Scholarly Commons (University of Pennsylvania) · Cited by 281
Self-citationNatural Languages and Context-Free Languages
Pullum, G. K., & Gazdar, G. (1987) · Studies in Linguistics and Philosophy · doi:10.1007/978-94-009-3401-6_7 · Cited by 209
Natural languages and context-free languages
Pullum, G. K., & Gazdar, G. (1982) · Linguistics and Philosophy · doi:10.1007/bf00360802 · Cited by 195
A study of tree adjoining grammars
Vijayashanker, K., & Joshi, A. K. (1987) · Cited by 186
Cited by
Steedman, M. (2000) · The MIT Press eBooks · doi:10.7551/mitpress/6591.001.0001 · Cited by 1,585
Combinatory Categorial Grammar
Steedman, M., & Baldridge, J. (2011) · Non‐Transformational Syntax · doi:10.1002/9781444395037.ch5 · Cited by 259
One model for the learning of language
Yang, Y., & Piantadosi, S. T. (2022) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2021865119 · Cited by 50
Metadata
- Authors
- Vijay-Shanker, K., & Weir, D. J.
- Venue
- Mathematical Systems Theory
- Published
- 1994-11
- Volume
- 27
- Issue
- 6
- Pages
- 511-546
- ISSN
- 0025-5661 (ISSN-L)
- 1433-0490
- OpenAlex
- W2038141781
- Cited by
- 260
- References
- 16
- FWCI
- 7.76
- Type
- journal article
- Language
- en
- Open access
- green
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: The equivalence of four extensions of context-free grammars. https://app.cochat.ai/papers/10.1007/bf01191624
- The paper
- Vijay-Shanker, K., & Weir, D. J. (1994). The equivalence of four extensions of context-free grammars. Mathematical Systems Theory. https://doi.org/10.1007/bf01191624
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.
