On the Progression from Context-Free to Tree Adjoining Languages

Vijay-Shanker, K.; Weir, David J.; Joshi, Aravind K.

doi:10.1075/z.35.19vij

In:Mathematics of Language: Proceedings of a conference held at the University of Michigan, Ann Arbor, October 1984
Edited by Alexis Manaster-Ramer
[Not in series 35] 1987
► pp. 389–401

Get fulltext from our e-platform

Download Book PDF

On the Progression from Context-Free to Tree Adjoining Languages

K. Vijay-Shanker

David J. Weir

Aravind K. Joshi

Published online: 1 January 1987

https://doi.org/10.1075/z.35.19vij

Cited by (4)

Cited by four other publications

Order by:

Alonso, Miguel A., Eric de la Clergerie & Manuel Vilares

2001. A Formal Definition of Bottom-Up Embedded Push-Down Automata and Their Tabulation Technique. In Logical Aspects of Computational Linguistics [Lecture Notes in Computer Science, 2099], ► pp. 44 ff.

Kappes, Martin

2000. Combining Contextual Grammars and Tree Adjoining Grammars. Grammars 3:2-3 ► pp. 175 ff.

Voss, Clare & Bonnie J. Dorr

1995. Toward a lexicalized grammar for interlinguas. Machine Translation 10:1-2 ► pp. 143 ff.

Hoeksema, Jack

1991. Complex predicates and liberation in Dutch and English. Linguistics and Philosophy 14:6 ► pp. 661 ff.

This list is based on CrossRef data as of 25 november 2025. Please note that it may not be complete. Sources presented here have been supplied by the respective publishers. Any errors therein should be reported to them.