Global Inference for Sentence Compression: An Integer Linear Programming Approach

Sentence compression holds promise for many applications ranging from summarization to subtitle generation. Our work views sentence compression as an optimization problem and uses integer linear programming (ILP) to infer globally optimal compressions in the presence of linguistically motivated constraints. We show how previous formulations of sentence compression can be recast as ILPs and extend these models with novel global constraints. Experimental results on written and spoken texts demonstrate improvements over state-of-the-art models.

• Type: Journal
• Year: 2008
• Where: JAIR
• Authors: James Clarke, Mirella Lapata
• Keywords: JAIR 2008, Optimal Compressions, Optimization Problem, Sentence Compression