论文信息 - Computing Parallelism in Discourse

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, there by providing a natural framework in which to capture the effect of parallelism on discourse semantics.

Claire Gardent | Michael Kohlhase | Claire Gardent | M. Kohlhase

[1] Ewald Lang,et al. Semantik der koordinativen Verknüpfung , 1977 .

[2] Jerry R. Hobbs. Literature And Cognition , 1990 .

[3] Stuart M. Shieber,et al. Ellipsis and higher-order unification , 1991 .

[4] Nicholas Asher,et al. Reference to abstract objects in discourse , 1993, Studies in linguistics and philosophy.

[5] Chris Brew,et al. Priority Union and Generalization in Discourse Grammars , 1994, ACL.

[6] Ted Briscoe,et al. 32nd Annual Meeting of the Association for Computational Linguistics, 27-30 June 1994, New Mexico State University, Las Cruces, New Mexico, USA, Proceedings , 1994, ACL.

[7] Michael Kohlhase,et al. A mechanization of sorted higher-order logic based on the resolution principle , 1994 .

[8] Claire Gardent,et al. Higher-Order Coloured Unification and Natural Language Semantics , 1996, ACL.

[9] Stuart M. Shieber,et al. Interactions of scope and ellipsis , 1996 .

[10] A. Kehler. Interpreting cohesive forms in the context of discourse inference , 1996 .

[11] Claire Gardent,et al. Corrections and Higher-Order Unification , 1996, KONVENS.