Name
Title | ||
|---|---|---|
Feature-Based TAG in place of multi-component adjunction: Computational Implications. |
Abstract | ||
|---|---|---|
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. |
Year | Venue | Keywords |
|---|---|---|
1994 | Natural Language Processing Pacific Rim Symposium | tree adjoining grammar |
Field | DocType | Volume |
Tree-adjoining grammar,Programming language,Computer science,Unification,Artificial intelligence,Natural language processing,Parsing,Feature based,Adjunction | Journal | abs/cmp-lg/9410030 |
ISSN | Citations | PageRank |
Natural Language Processing Pacific Rim Symposium (NLPRS 93) | 1 | 0.43 |
References | Authors | |
1 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| B. A. Hockey | 1 | 9 | 2.15 |
| B. Srinivas | 2 | 152 | 17.90 |