An algorithm is proposed to determine antecedents for VP ellipsis. The algorithm eliminates impossible antecedents, and then imposes a preference ordering on possible antecedents....
An assumption shared by many theories of discourse is that discourse structure constrains anaphora resolution (cf. [Grosz and Sidner 1986] for definite NPs, [Lascarides and Asher ...
We provide a general account of parallelism in discourse, and apply it to the special case of resolving possible readings for instances of VP ellipsis. We show how several problem...