Paper: An Algorithm For VP Ellipsis

ACL ID P92-1002
Title An Algorithm For VP Ellipsis
Venue Annual Meeting of the Association of Computational Linguistics
Session Main Conference
Year 1992
  • Daniel Hardt (University of Pennsylvania, Philadelphia PA)

An algorithm is proposed to determine an- tecedents for VP ellipsis. The algorithm elim- inates impossible antecedents, and then im- poses a preference ordering on possible an- tecedents. The algorithm performs with 94% accuracy on a set of 304 examples of VP el- lipsis collected from the Brown Corpus. The problem of determining antecedents for VP el- lipsis has received little attention in the litera- ture, and it is shown that the current proposal is a significant improvement over alternative approaches.