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.

• Type: Conference
• Year: 2004
• Where: ACL
• Authors: Ernst Althaus, Nikiforos Karamanis, Alexander Koller
• Keywords: ACL 2004, ACL 2007, Algorithm, Coherent Discourse, Discourse Ordering Problem