Paper: A Computational Mechanism For Pronominal Reference

ACL ID P89-1032
Title A Computational Mechanism For Pronominal Reference
Venue Annual Meeting of the Association of Computational Linguistics
Session Main Conference
Year 1989
Authors

the syntactically impossible antecedents. This latter This paper describes an implemented mechanism for handling bound anaphora, disjoint reference, and pronominal reference. The algorithm maps over every node in a parse tree in a left-to-right, depth first manner. Forward and backwards coreference, and disjoint reference are assigned during this tree walk. A semantic interpretation procedure is used to deal with multiple antecedents.