A discourse copying algorithm for ellipsis and anaphora resolution

Abstract

We give an analysis of ellipsis resolution in terms of a straightforwaxd discourse copying algorithm that correctly predicts a wide range of phenomena. The treatment does not suffer from problems inherent in identity-of-relations analyses. Furthermore, in contrast to the approach of Dalrymple et al. [1991], the treatment directly encodes the intuitive distinction between full NPs and the referential elements that corefer with them through what we term role linking. The correct predictions for several problematic examples of ellipsis naturally result. Finally, the iinalysis extends directly to other discourse copying phenomena.