Computing Parallelism in Discourse
<|reference_start|>Computing Parallelism in Discourse: Although much has been said about parallelism in discourse, a formal, computational theory of parallelism structure is still outstanding. In this paper, we present a theory which given two parallel utterances predicts which are the parallel elements. The theory consists of a sorted, higher-order abductive calculus and we show that it reconciles the insights of discourse theories of parallelism with those of Higher-Order Unification approaches to discourse semantics, thereby providing a natural framework in which to capture the effect of parallelism on discourse semantics.<|reference_end|>
@article{gardent1997computing,
    title={Computing Parallelism in Discourse},
    author={Claire Gardent and Michael Kohlhase (Universitaet des Saarlandes,
  Saarbruecken, Germany)},
    journal={Proceedings of IJCAI'97},
    year={1997},
    number={CLAUS Nr. 90},
    archivePrefix={arXiv},
    eprint={cmp-lg/9705004},
    primaryClass={cmp-lg cs.CL}
}