|Abstract||This paper provides a uniﬁcation-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.|
|Keywords||No keywords specified (fix it)|
|Categories||No categories specified (fix it)|
|Through your library||Only published papers are available at libraries|
Similar books and articles
Katherine Forbes, Eleni Miltsakaki, Rashmi Prasad, Anoop Sarkar, Aravind Joshi & Bonnie Webber (2003). D-LTAG System: Discourse Parsing with a Lexicalized Tree-Adjoining Grammar. Journal of Logic, Language and Information 12 (3):261-279.
Jörn Diedrichsen & Eliot Hazeltine (2001). Unifying by Binding: Will Binding Really Bind? Behavioral and Brain Sciences 24 (5):884-885.
James W. Garson (2001). (Dis)Solving the Binding Problem. Philosophical Psychology 14 (4):381 – 392.
Zvi Penner (1988). The Grammar of the Nominal Sentence: A Government-Binding Approach. Universitaet Bern, Institut für Sprachwissenschaft.
Lucas Champollion (2011). Lexicalized Non-Local MCTAG with Dominance Links is NP-Complete. Journal of Logic, Language and Information 20 (3):343-359.
Pierre Pica (1995). Condition C and Epistemic Contexts : A Case Study of Epithets and Anti-Logophoricity Pronouns in French. In Young-Sun Kim, Byung-Choon Lee, Kyoung-Jae Lee, Kyun-Kwon Yang & Jong-Kuri Yoon (eds.), A Festchrift for Dong-Whee Yang. Hankuk Publishing.
Sorry, there are not enough data points to plot this chart.
Added to index2010-12-22
Recent downloads (6 months)0
How can I increase my downloads?