Attention, intentions, and the structure of discourse
Computational Linguistics
Interpreting anaphors in natural language texts
Interpreting anaphors in natural language texts
An algorithm for pronominal anaphora resolution
Computational Linguistics
ParseTalk about sentence- and text-level anaphora
EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
Anaphora resolution: a multi-strategy approach
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
A binding rule for Government-binding parsing
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
Design and enhanced evaluation of a robust anaphor resolution algorithm
Computational Linguistics - Special issue on computational anaphora resolution
Possessive pronominal anaphor resolution in Portuguese written texts
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 2
Resolving anaphoric references on deficient syntactic descriptions
ANARESOLUTION '97 Proceedings of a Workshop on Operational Factors in Practical, Robust Anaphora Resolution for Unrestricted Texts
| Hi-index | 0.00 |
An anaphor resolution algorithm is presented which relies on a combination of strategies for narrowing down and selecting from antecedent sets for reflexive pronouns, nonreflexive pronouns, and common nouns. The work focuses on syntactic restrictions which are derived from Chomsky's Binding Theory. It is discussed how these constraints can be incorporated adequately in an anaphor resolution algorithm. Moreover, by showing that pragmatic inferences may be necessary, the limits of syntactic restrictions are elucidated.