Computing Locally Coherent Discourses.

Althaus, Ernst; Karamanis, Nikiforos; Koller, Alexander

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Computing Locally Coherent Discourses.

MPS-Authors

/persons/resource/persons44003

Althaus, Ernst
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Althaus, E., Karamanis, N., & Koller, A. (2004). Computing Locally Coherent Discourses. In Proceedings of the conference and workshops, 42nd annual meeting of the Association for Computational Linguistics (pp. 399-406). East Stroudsburg, USA: ACL.

Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-2A5E-E

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.