Constraint-Based Sentence Compression: An Integer Programming Approach

James Clarke, Mirella Lapata

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract / Description of output

The ability to compress sentences while preserving their grammaticality and most of their meaning has recently received much attention. Our work views sentence compression as an optimisation problem. We develop an integer programming formulation and infer globally optimal compressions in the face of linguistically motivated constraints. We show that such a formulation allows for relatively simple and knowledge-lean compression models that do not require parallel corpora or large-scale resources. The proposed approach yields results comparable and in some cases superior to state-of-the-art.
Original languageEnglish
Title of host publicationACL 2006, 21st International Conference on Computational Linguistics and 44th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference, Sydney, Australia, 17-21 July 2006
Pages144-151
Number of pages8
Publication statusPublished - 2006

Fingerprint

Dive into the research topics of 'Constraint-Based Sentence Compression: An Integer Programming Approach'. Together they form a unique fingerprint.

Cite this