Sciweavers

Share
ACL
1989

A Computational Mechanism for Pronominal Reference

9 years 6 months ago
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.
Robert Ingria, David Stallard
Added 06 Nov 2010
Updated 06 Nov 2010
Type Conference
Year 1989
Where ACL
Authors Robert Ingria, David Stallard
Comments (0)
books