Sentence compression as tree transduction

MaRDI QIDQ3624196zbMATH OpenFDO

Authors T. A. Cohn, Mirella Lapata

Publication date 28 April 2009

Full work available at URL https://arxiv.org/abs/1401.5693

zbMATH Keywords

synchronous tree substitution grammar

Mathematics Subject Classification ID

Natural language processing (68T50)

Recommendations

• Global inference for sentence compression: an integer linear programming approach
• Summarization beyond sentence extraction: A probabilistic approach to sentence compression
• A difference-of-convex programming approach with parallel branch-and-bound for sentence compression via a hybrid extractive model
• Compositions of Tree-to-Tree Statistical Machine Translation Models
• Compositions of tree-to-tree statistical machine translation models

Cited in

(3)

• A difference-of-convex programming approach with parallel branch-and-bound for sentence compression via a hybrid extractive model
• Global inference for sentence compression: an integer linear programming approach
• AI 2005: Advances in Artificial Intelligence

This page was built for publication: Sentence compression as tree transduction

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