Anaphora resolution in slot grammar
Computational Linguistics
ProFIT: prolog with features, inheritance and templates
EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
Well-nested parallelism constraints for ellipsis resolution
EACL '03 Proceedings of the tenth conference on European chapter of the Association for Computational Linguistics - Volume 1
The automatic generation of formal annotations in a multimedia indexing and searching environment
HLTKM '01 Proceedings of the workshop on Human Language Technology and Knowledge Management - Volume 2001
| Hi-index | 0.00 |
We present an algorithm which assigns interpretations to several major types of ollipsis structures through a generalized procedure of syntactic reconstruction. Ellipsis structures are taken to be sequences of lexically realized arguments and/or adjuncts of an empty verbal head. Reconstruction is characterized as the specification of a (partial) correspondence relation between the unrealized head verb of an elided clause and its argument and adjuncts on one hand, and the head of a non-elided antecedent sentence and its arguments and adjuncts on the other. The algorithm generates appropriate interpretations for cases of VP ellipsis, pseudo-gapping, bare ellipsis (stripping), and gapping. It provides a uniform computational approach to a wide range of ellipsis phenomena, and it has significant advantages over several other approaches to ellipsis which have recently been suggested in the computational and linguistic literature.