Global inference for sentence compression: an integer linear programming approach

MaRDI QIDQ3624120zbMATH OpenFDO

Authors

Publication date 28 April 2009

zbMATH Keywords

globally optimal compressionsInteger Linear Programming

Mathematics Subject Classification ID

Knowledge representation (68T30) Linear programming (90C05)

Recommendations

• A difference-of-convex programming approach with parallel branch-and-bound for sentence compression via a hybrid extractive model
• Sentence compression as tree transduction
• Summarization beyond sentence extraction: A probabilistic approach to sentence compression
• USING ALIGNMENT FOR MULTILINGUAL TEXT COMPRESSION
• A tutorial on dual decomposition and Lagrangian relaxation for inference in natural language processing

Cited in

(4)

• A difference-of-convex programming approach with parallel branch-and-bound for sentence compression via a hybrid extractive model
• Sentence compression as tree transduction
• Two-phase Multi-document Event Summarization on Core Event Graphs
• Relational linear programming

This page was built for publication: Global inference for sentence compression: an integer linear programming approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3624120)