Paper: Anaphor Resolution And The Scope Of Syntactic Constraints

ACL ID C96-2158
Title Anaphor Resolution And The Scope Of Syntactic Constraints
Venue International Conference on Computational Linguistics
Session Main Conference
Year 1996
Authors
  • Roland Stuckardt (German National Research Center for Information Technology, Darmstadt Germany)

An anal)hor resolution algorithm is pre- sented which relies on a combination of strategies for narrowing down and select- ing ti'om antecedent sets fl)r reflexive pro- nouns, nonreflexive pronom~s, and com- mon 11011118. ~lqle work focuses on syn- tactic restrictions which are derived froin Chomsky's Binding Theory. It is dis- cussed how these constraints can be in- corporated adequately in an anaphor res- olution algorithm. Moreover, by showing that t)ragmatic inferences may t)e neces- sary, the limits of syntactic restrictions are ehleidated.