The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
On multiple context-free grammars
Open accessAbstract
Abstract Multiple context-free grammars (mcfg's) is a subclass of generalized context-free grammars introduced by Pollard (1984) in order to describe the syntax of natural languages. The class of languages generated by mcfg's (called multiple context-free languages or, shortly, mcfl's) properly includes the class of context-free languages and is properly included in the class of context-sensitive languages. First, the paper presents results on the generative capacity of mcfg's and also on the properties of mcfl's such as formal language-theoretic closure properties. Next, it is shown that the time complexity of the membership problem for multiple context-free languages is O(ne), where n is the length of an input string and e is a constant called the degree of a given mcfg. Head grammars (hg's) introduced by Pollard and tree adjoining grammars (tag's) introduced by Joshi et al. (1975) are also grammatical formalisms to describe the syntax of natural languages. The paper also presents the following results on the generative capacities of hg's, tag's and 2-mcfg's, which are a subclass of mcfg's: (1) The class HL of languages generated by hg's is the same as the one generated by tag's; (2) HL is the same as the one generated by left-wrapping hg's (or right-wrapping hg's) which is a proper subclass of hg's; (3) HL is properly included in the one generated by 2-mcfg's. As a corollary of (1), it is also shown that HL is a substitution-closed full AFL.
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
Introduction to automata theory, languages and computation
(1981) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(81)90068-9 · Cited by 10,699
Introduction to automata theory, languages, and computation
(1980) · Computer Languages · doi:10.1016/0096-0551(80)90011-9 · Cited by 6,824
Salomaa, A. K. (1973) · Cited by 1,510
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
Joshi, A. K. (1985) · Natural Language Parsing · doi:10.1017/cbo9780511597855.007 · Cited by 560
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
Characterizing structural descriptions produced by various grammatical formalisms
Vijay‐Shanker, K., Weir, D. J., & Joshi, A. K. (1987) · Annual Meeting of the Association for Computational Linguistics (ACL) · doi:10.3115/981175.981190 · Cited by 262
Natural Language Parsing: Psychological, Computational, and Theoretical Perspectives
Hoard, J. E., Dowty, D. R., Karttunen, L., & Zwicky, A. M. (1987) · Language · doi:10.2307/415400 · Cited by 252
Natural 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
Cited by
Uncertainty About the Rest of the Sentence
Hale, J. (2006) · Cognitive Science · doi:10.1207/s15516709cog0000_64 · Cited by 296
Grammar-Constrained Decoding for Structured NLP Tasks without Finetuning
Geng, S., Josifoski, M., Peyrard, M., & West, R. (2023) · Proceedings of the 2023 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/2023.emnlp-main.674 · Cited by 74
Metadata
- Authors
- Seki, H., Matsumura, T., Fujii, M., & Kasami, T.
- Venue
- Theoretical Computer Science
- Publisher
- Elsevier BV
- Published
- 1991-10
- Volume
- 88
- Issue
- 2
- Pages
- 191-229
- ISSN
- 0304-3975 (ISSN-L)
- OpenAlex
- W2089385274
- Cited by
- 392
- References
- 14
- FWCI
- 2.36
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: On multiple context-free grammars. https://app.cochat.ai/papers/10.1016/0304-3975(91)90374-b
- The paper
- Seki, H., Matsumura, T., Fujii, M., & Kasami, T. (1991). On multiple context-free grammars. Theoretical Computer Science. https://doi.org/10.1016/0304-3975(91)90374-b
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.