inria-00100116, version 1
Computing Locally Coherent Discourses
42nd Annual Meeting of the Association for Computational Linguistics - ACL 2004 (2004) 8 p
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.
- a – CNRS
- b – UNIVERSITY OF EDINBURGH
- c – SAARLAND UNIVERSITY
- 1:
- INRIA – CNRS : UMR7503 – Université Henri Poincaré - Nancy I – Université Nancy II – Institut National Polytechnique de Lorraine (INPL)
- 2:
- Saarland University
- Domain : Computer Science/Other
- Keywords : computational linguistics – integer programming || informatique linguistique – optimisation discrète
- Internal note : A04-R-401 || althaus04a
- Comment : Colloque avec actes et comité de lecture. internationale.
- inria-00100116, version 1
- http://hal.inria.fr/inria-00100116
- oai:hal.inria.fr:inria-00100116
- From:
- Submitted on: Tuesday, 26 September 2006 10:14:15
- Updated on: Thursday, 28 September 2006 15:22:47


Export