A Computational Mechanism for Pronominal Reference

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.

• Type: Conference
• Year: 1989
• Where: ACL
• Authors: Robert Ingria, David Stallard
• Keywords: ACL 1989, ACL 2007, Disjoint Reference, Impossible Antecedents, Semantic Interpretation Procedure