Feature-Based TAG in place of multi-component adjunction: Computational Implications
| dc.creator | Hockey, B. A. | |
| dc.creator | Srinivas, B. | |
| dc.date | 1994-10-26 | |
| dc.date.accessioned | 2026-07-07T09:09:36Z | |
| dc.date.available | 2026-07-07T09:09:36Z | |
| dc.description | Using feature-based Tree Adjoining Grammar (TAG), this paper presents linguistically motivated analyses of constructions claimed to require multi-component adjunction. These feature-based TAG analyses permit parsing of these constructions using an existing unification-based Earley-style TAG parser, thus obviating the need for a multi-component TAG parser without sacrificing linguistic coverage for English. | |
| dc.description | ps file. 9 pages | |
| dc.identifier | https://arxiv.org/abs/cmp-lg/9410030 | |
| dc.identifier | http://arxiv.org/abs/cmp-lg/9410030 | |
| dc.identifier | Natural Language Processing Pacific Rim Symposium (NLPRS 93) | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/151095 | |
| dc.subject | Computation and Language | |
| dc.title | Feature-Based TAG in place of multi-component adjunction: Computational Implications | |
| dc.type | text |