Computing parallelism in discourse

Authors:
Claire Gardent;Michael Kohlhase
Affiliations:
Computational Linguistics, Universitat des Saarlandes, Saarbrücken, Germany;Computer Science, Universitat des Saarlandes, Saarbrücken, Germany
Venue:
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
Year:
1997

Citing 4
Cited 3

Interpreting cohesive forms in the context of discourse inference

Interpreting cohesive forms in the context of discourse inference
Corrections and Higher-Order Unification

Natural Language Processing and Speech Technology, Results of the 3rd KONVENS Conference
Priority union and generalization in discourse grammars

ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
Higher-Order Coloured Unification and natural language semantics

ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics

Managing Structural Information by Higher-Order Colored Unification

Journal of Automated Reasoning
Bidirectional contextual resolution

Computational Linguistics
On the semantics and pragmatics of dysfluency

AC'11 Proceedings of the 18th Amsterdam colloquim conference on Logic, Language and Meaning

Quantified Score

Hi-index	0.00

Visualization

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.