Artificial Intelligence
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
Anaphoric dependencies in ellipsis
Computational Linguistics
A discourse copying algorithm for ellipsis and anaphora resolution
EACL '93 Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics
A theory of parallelism and the case of VP ellipsis
ACL '98 Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics
The effect of establishing coherence in ellipsis and anaphora resolution
ACL '93 Proceedings of the 31st annual meeting on Association for Computational Linguistics
Anaphora and Discourse Structure
Computational Linguistics
| Hi-index | 0.00 |
A computational account of VP ellipsis is described, in which VP's are represented in the discourse model as contextually dependent semantic objects. It is argued that this approach can handle examples that are not allowed by alternative accounts. An implementation is defined in terms of extensions to the Incremental Interpretation System. The treatment of VP ellipsis is analogous to that of pronominal anaphora. It is suggested that the recency and salience constraints commonly thought to apply to pronominal anaphora might apply in a similar way to VP ellipsis.