D-tree grammars
Authors:
Open Access
- 1 January 1995
- conference paper
- Published by Association for Computational Linguistics (ACL)
- p. 151-158
Abstract
DTG are designed to share some of the advantages of TAG while overcoming some of its limitations. DTG involve two composition operations called subsertion and sister-adjunction. The most distinctive feature of DTG is that, unlike TAG, there is complete uniformity in the way that the two DTG operations relate lexical items: subsertion always corresponds to complementation and sister-adjunction to modification. Furthermore, DTG, unlike TAG, can provide a uniform analysis for element in Kashmiri appears in sentence-second position, and not sentence-initial position as in English.Keywords
This publication has 5 references indexed in Scilit:
- Codeswitching and the syntactic status of adnominal adjectivesLingua, 1995
- Compilation of HPSG to TAG1995
- Multiset-valued linear index grammars1994
- Evidence against the context-freeness of natural languageLinguistics and Philosophy, 1985
- Tree adjunct grammarsJournal of Computer and System Sciences, 1975