Computing Parallelism in Discourse
| dc.creator | Gardent, Claire | |
| dc.creator | Kohlhase, Michael | |
| dc.date | 1997-05-01 | |
| dc.date.accessioned | 2026-07-07T09:10:47Z | |
| dc.date.available | 2026-07-07T09:10:47Z | |
| dc.description | 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. | |
| dc.description | 6 pages | |
| dc.identifier | https://arxiv.org/abs/cmp-lg/9705004 | |
| dc.identifier | http://arxiv.org/abs/cmp-lg/9705004 | |
| dc.identifier | Proceedings of IJCAI'97 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/151455 | |
| dc.subject | Computation and Language | |
| dc.title | Computing Parallelism in Discourse | |
| dc.type | text |