A computational mechanism for pronominal reference

  • Authors:
  • Robert J. P. Ingria;David Stallard

  • Affiliations:
  • BBN Systems and Technologies, Incorporated, Cambridge, MA;BBN Systems and Technologies, Incorporated, Cambridge, MA

  • Venue:
  • ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
  • Year:
  • 1989

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper describes an implemented mechanism for handling bound anaphora, disjoint reference, and pronominal reference. The algorith 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.