Computing Parallelism in Discourse
Abstract
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, there by providing a natural framework in which to capture the effect of parallelism on discourse semantics.
Cite
Text
Gardent and Kohlhase. "Computing Parallelism in Discourse." International Joint Conference on Artificial Intelligence, 1997.Markdown
[Gardent and Kohlhase. "Computing Parallelism in Discourse." International Joint Conference on Artificial Intelligence, 1997.](https://mlanthology.org/ijcai/1997/gardent1997ijcai-computing/)BibTeX
@inproceedings{gardent1997ijcai-computing,
title = {{Computing Parallelism in Discourse}},
author = {Gardent, Claire and Kohlhase, Michael},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {1997},
pages = {1016-1021},
url = {https://mlanthology.org/ijcai/1997/gardent1997ijcai-computing/}
}