Computing locally coherent discourses

  • Authors:
  • Ernst Althaus;Nikiforos Karamanis;Alexander Koller

  • Affiliations:
  • Université Henri Poincaré, France;University of Edinburgh, Edinburgh, UK;Saarland University, Saarbrücken, Germany

  • Venue:
  • ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.