Paper: Multi-document Summarization via Budgeted Maximization of Submodular Functions

ACL ID N10-1134
Title Multi-document Summarization via Budgeted Maximization of Submodular Functions
Venue Human Language Technologies
Session Main Conference
Year 2010
Authors

We treat the text summarization problem as maximizing a submodular function under a budgetconstraint. Weshow, boththeoretically and empirically, a modified greedy algorithm can efficiently solve the budgeted submodu- lar maximization problem near-optimally, and we derive new approximation bounds in do- ing so. Experiments on DUC’04 task show that our approach is superior to the best- performing method from the DUC’04 evalu- ation on ROUGE-1 scores.