Abstract
This paper provides a unification-based implementation of Binding Theory (BT) for the English language in the framework of feature-based lexicalized tree-adjoining grammar (LTAG). The grammar presented here does not actually coindex any noun phrases, it merely outputs a set of constraints on co- and contraindexation that may later be processed by a separate anaphora resolution module. It improves on previous work by implementing the full BT rather than just Condition A. The main technical innovation consists in allowing lists to appear as values of semantic features.
| Original language | English (US) |
|---|---|
| Pages | 1-8 |
| Number of pages | 8 |
| State | Published - 2008 |
| Event | 9th International Workshop on Tree Adjoining Grammars and Related Formalisms, TAG 2008 - Tubingen, Germany Duration: Jun 6 2008 → Jun 8 2008 |
Conference
| Conference | 9th International Workshop on Tree Adjoining Grammars and Related Formalisms, TAG 2008 |
|---|---|
| Country/Territory | Germany |
| City | Tubingen |
| Period | 6/6/08 → 6/8/08 |
ASJC Scopus subject areas
- Computer Science Applications
- Information Systems
- Computational Theory and Mathematics