The equivalence of four extensions of context-free grammars
- Cite this article as:
- Vijay-Shanker, K. & Weir, D.J. Math. Systems Theory (1994) 27: 511. doi:10.1007/BF01191624
- 200 Downloads
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.