Computing Locally Coherent Discourses - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2004

Computing Locally Coherent Discourses


We present the first algorithm that computes optimal orderings of sentences into a locally coherent discourse. The algorithm runs very efficiently on a variety of coherence measures from the literature. We also show that the discourse ordering problem is NP-complete and cannot be approximated.
No file

Dates and versions

inria-00100116 , version 1 (26-09-2006)


  • HAL Id : inria-00100116 , version 1


Ernst Althaus, Nikiforos Karamanis, Alexander Koller. Computing Locally Coherent Discourses. 42nd Annual Meeting of the Association for Computational Linguistics - ACL 2004, 2004, Barcelona, Spain, 8 p. ⟨inria-00100116⟩
61 View
0 Download


Gmail Facebook Twitter LinkedIn More