Sciweavers

ACL
2004

Computing Locally Coherent Discourses

13 years 5 months ago
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.
Ernst Althaus, Nikiforos Karamanis, Alexander Koll
Added 30 Oct 2010
Updated 30 Oct 2010
Type Conference
Year 2004
Where ACL
Authors Ernst Althaus, Nikiforos Karamanis, Alexander Koller
Comments (0)