D-Tree Grammars
| dc.creator | Rambow, Owen | |
| dc.creator | Vijay-Shanker, K. | |
| dc.creator | Weir, David | |
| dc.date | 1995-05-12 | |
| dc.date.accessioned | 2026-07-07T09:09:51Z | |
| dc.date.available | 2026-07-07T09:09:51Z | |
| dc.description | 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 em wh-movement in English and Kashmiri, despite the fact that the em wh element in Kashmiri appears in sentence-second position, and not sentence-initial position as in English. | |
| dc.description | Latex source, needs aclap.sty, 8 pages, to appear in ACL-95 | |
| dc.identifier | https://arxiv.org/abs/cmp-lg/9505028 | |
| dc.identifier | http://arxiv.org/abs/cmp-lg/9505028 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/151187 | |
| dc.subject | Computation and Language | |
| dc.title | D-Tree Grammars | |
| dc.type | text |