Anaphora resolution in slot grammar
Computational Linguistics
A centering approach to pronouns
ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics
Providing a unified account of definite noun phrases in discourse
ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
Evaluating discourse processing algorithms
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
Empirical studies in discourse
Computational Linguistics
An empirical approach to VP ellipsis
Computational Linguistics
Functional centering: grounding referential coherence in information structure
Computational Linguistics
Ellipsis and quantification: a substitutional approach
EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
| Hi-index | 0.00 |
An algorithm is proposed to determine antecedents for VP ellipsis. The algorithm eliminates impossible antecedents, and then imposes a preference ordering on possible antecedents. The algorithm performs with 94% accuracy on a set of 304 examples of VP ellipsis collected from the Brown Corpus. The problem of determining antecedents for VP ellipsis has received little attention in the literature, and it is shown that the current proposal is a significant improvement over alternative approaches.