{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T20:11:33Z","timestamp":1774987893311,"version":"3.50.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[1994,11,1]],"date-time":"1994-11-01T00:00:00Z","timestamp":783648000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Systems Theory"],"published-print":{"date-parts":[[1994,11]]},"DOI":"10.1007\/bf01191624","type":"journal-article","created":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T14:18:36Z","timestamp":1108736316000},"page":"511-546","source":"Crossref","is-referenced-by-count":104,"title":["The equivalence of four extensions of context-free grammars"],"prefix":"10.1007","volume":"27","author":[{"given":"K.","family":"Vijay-Shanker","sequence":"first","affiliation":[]},{"given":"D. J.","family":"Weir","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1145\/321479.321488","volume":"15","author":"A. V. Aho","year":"1968","unstructured":"A. V. Aho. Indexed grammars?an extension to context free grammars.J. Assoc. Comput. Mach.,15:647?671, 1968.","journal-title":"J. Assoc. Comput. Mach."},{"key":"CR2","first-page":"1","volume":"1","author":"K. Ajdukiewicz","year":"1935","unstructured":"K. Ajdukiewicz. Die syntaktische Konnexit\u00e4t.Studia Philosophica,1:1?27, 1935. English translation in: S. McCall, editor,Polish Logic, 1920?1939, pp. 207?231. Oxford University Press, Oxford.","journal-title":"Studia Philosophica"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/BF00630918","volume":"8","author":"C. Culy","year":"1985","unstructured":"C. Culy. The complexity of the vocabulary of bambara.Ling. Philos.,8:345?351, 1985.","journal-title":"Ling. Philos."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0304-3975(84)90023-9","volume":"32","author":"J. Duske","year":"1984","unstructured":"J. Duske and R. Parchmann. Linear indexed languages.Theoret. Comput. Sci.,32:47?60, 1984.","journal-title":"Theoret. Comput. Sci."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/978-94-009-1337-0_3","volume-title":"Natural Language Parsing and Linguistic Theories","author":"G. Gazdar","year":"1988","unstructured":"G. Gazdar. Applicability of indexed grammars to natural languages. In: U. Reyle and C. Rohrer, editors,Natural Language Parsing and Linguistic Theories, pp. 69?94. Reidel, Dordrecht, 1988."},{"key":"CR6","volume-title":"Generalized Phrase Structure Grammars","author":"G. Gazdar","year":"1985","unstructured":"G. Gazdar, E. Klein, G. K. Pullum, and I. A. Sag.Generalized Phrase Structure Grammars. Blackwell, Oxford, 1985. Also published by Harvard University Press, Cambridge, MA."},{"key":"CR7","first-page":"206","volume-title":"Natural Language Processing?Theoretical, Computational and Psychological Perspective","author":"A. K. Joshi","year":"1985","unstructured":"A. K. Joshi. How much context-sensitivity is necessary for characterizing structural descriptions ?Tree Adjoining Grammars? In: D. Dowty, L. Karttunen, and A. Zwicky, editors,Natural Language Processing?Theoretical, Computational and Psychological Perspective, pp. 206?250. Cambridge University Press, New York, 1985. Originally presented in 1983."},{"issue":"1","key":"CR8","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1016\/S0022-0000(75)80019-5","volume":"19","author":"A. K. Joshi","year":"1975","unstructured":"A. K. Joshi, L. S. Levy, and M. Takahashi. Tree adjunct grammars.J. Comput. System Sci.,19(1):136?163, 1975.","journal-title":"J. Comput. System Sci."},{"key":"CR9","volume-title":"An efficient recognition and syntax algorithm for context-free languages","author":"T. Kasami","year":"1965","unstructured":"T. Kasami. An efficient recognition and syntax algorithm for context-free languages. Technical Report AF-CRL-65-758, Air Force Cambridge Research Laboratory, Bedford, MA, 1965."},{"key":"CR10","first-page":"66","volume-title":"New Conceptions of Phrase Structure","author":"A. S. Kroch","year":"1986","unstructured":"A. S. Kroch. Asymmetries in long distance extraction in a tag grammar. In: M. Baltin and A. S. Kroch, editors,New Conceptions of Phrase Structure, pp. 66?98. University of Chicago Press, Chicago, IL, 1986."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1075\/z.35.09kro","volume-title":"Mathematics of Language","author":"A. S. Kroch","year":"1987","unstructured":"A. S. Kroch. Subjacency in a tree adjoining grammar. In: A. Manaster-Ramer, editor,Mathematics of Language, pp. 143?172. Benjamins, Amsterdam, 1987."},{"key":"CR12","series-title":"Technical Report MS-CIS-85-18, Department of Computer and Information Science","volume-title":"Linguistic relevance of tree adjoining grammars","author":"A. S. Kroch","year":"1985","unstructured":"A. S. Kroch and A. K. Joshi. Linguistic relevance of tree adjoining grammars. Technical Report MS-CIS-85-18, Department of Computer and Information Science, University of Pennsylvania, Philadelphia, PA, 1985."},{"key":"CR13","first-page":"107","volume-title":"Syntax and Semantics: Discontinuous Constituents","author":"A. S. Kroch","year":"1986","unstructured":"A. S. Kroch and A. K. Joshi. Analyzing extraposition in a tree adjoining grammar. In: G. Huck and A. Ojeda, editors,Syntax and Semantics: Discontinuous Constituents, pp. 107?149. Academic Press, New York, 1986."},{"key":"CR14","unstructured":"A. S. Kroch and B. Santorini. The derived constituent structure of West Germanic verb-raising construction. In: R. Freiden, editor,Proceedings of the Princeton Workshop on Grammar, pp. 269?338, 1991."},{"key":"CR15","volume-title":"Ph.D. thesis","author":"C. Pollard","year":"1984","unstructured":"C. Pollard. Generalized Phrase Structure Grammars, Head Grammars, and Natural Language. Ph.D. thesis, Stanford University, CA, 1984."},{"key":"CR16","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1007\/BF00360802","volume":"4","author":"G. Pullum","year":"1982","unstructured":"G. Pullum and G. Gazdar. Natural languages and context-free languages.Ling. Philos.,4:471?504, 1982.","journal-title":"Ling. Philos."},{"key":"CR17","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1075\/z.35.15roa","volume-title":"Mathematics of Language","author":"K. Roach","year":"1987","unstructured":"K. Roach. Formal properties of head grammars. In: A. Manaster-Ramer, editor,Mathematics of Language, pp. 293?348. Benjamins, Amsterdam, 1987."},{"key":"CR18","volume-title":"Master's thesis","author":"B. Santorini","year":"1986","unstructured":"B. Santorini. The West Germanic verb-raising construction: a tree adjoing grammar analysis. Master's thesis, University of Pennsylvania, Philadelphia, PA, 1986."},{"key":"CR19","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/BF00630917","volume":"8","author":"S. M. Shieber","year":"1985","unstructured":"S. M. Shieber. Evidence against the context-freeness of natural language.Ling. Philos.,8:333?343, 1985.","journal-title":"Ling. Philos."},{"key":"CR20","doi-asserted-by":"crossref","first-page":"523","DOI":"10.2307\/414385","volume":"61","author":"M. J. Steedman","year":"1985","unstructured":"M. J. Steedman. Dependency and coordination in the grammar of Dutch and English.Language,61:523?568, 1985.","journal-title":"Language"},{"key":"CR21","first-page":"417","volume-title":"Categorial Grammars and Natural Language Structures","author":"M. J. Steedman","year":"1986","unstructured":"M. J. Steedman. Combinators and grammars. In: R. Oehrle, E. Bach, and D. Wheeler, editors,Categorial Grammars and Natural Language Structures, pp. 417?442. Foris, Dordrecht, 1986."},{"key":"CR22","volume-title":"Ph.D. thesis","author":"K. Vijay-Shanker","year":"1987","unstructured":"K. Vijay-Shanker. A study of tree adjoining grammars. Ph.D. thesis, University of Pennsylvania, Philadelphia, PA, 1987."},{"key":"CR23","unstructured":"K. Vijay-Shanker and D. J. Weir. Parsing constrained grammar formalisms.Comput. Linguistics, to appear."},{"key":"CR24","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/978-1-4615-3986-5_13","volume-title":"Current Issues in Parsing Technology","author":"K. Vijay-Shanker","year":"1991","unstructured":"K. Vijay-Shanker and D. J. Weir. Polynomial parsing of extensions of context-free grammars. In: M. Tomita, editor,Current Issues in Parsing Technology, pp. 191?206. Kluwer, Boston, 1991."},{"key":"CR25","doi-asserted-by":"crossref","unstructured":"K. Vijay-Shanker, D. J. Weir, and A. K. Joshi. Tree adjoining and head wrapping.Proceedings of the 11th International Conference on Computational Linguistics, pp. 202?207, 1986.","DOI":"10.3115\/991365.991425"},{"key":"CR26","volume-title":"Ph.D. thesis","author":"D. J. Weir","year":"1988","unstructured":"D. J. Weir. Characterizing mildly context-sensitive grammar formalisms. Ph.D. thesis, University of Pennsylvania, Philadelphia, PA, 1988."},{"key":"CR27","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0304-3975(92)90124-X","volume":"104","author":"D. J. Weir","year":"1992","unstructured":"D. J. Weir. A geometric hierarchy beyond context-free languages.Theoret. Comput. Sci.,104:235?261, 1992.","journal-title":"Theoret. Comput. Sci."},{"key":"CR28","doi-asserted-by":"crossref","unstructured":"D. J. Weir and A. K. Joshi. Combinatory categorial grammars: generative power and relationship to linear context-free rewriting systems.Proceedings of the 26th Meeting of the Association on Computational Linguistics, pp. 278?285, 1988.","DOI":"10.3115\/982023.982057"},{"issue":"2","key":"CR29","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/S0019-9958(67)80007-X","volume":"10","author":"D. H. Younger","year":"1967","unstructured":"D. H. Younger. Recognition and parsing of context-free languages in timen 3.Inform. and Control,10(2):189?208, 1967.","journal-title":"Inform. and Control"}],"container-title":["Mathematical Systems Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01191624.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01191624\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01191624","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T13:08:38Z","timestamp":1556629718000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01191624"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,11]]},"references-count":29,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1994,11]]}},"alternative-id":["BF01191624"],"URL":"https:\/\/doi.org\/10.1007\/bf01191624","relation":{},"ISSN":["0025-5661","1433-0490"],"issn-type":[{"value":"0025-5661","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,11]]}}}