Paper: Text Summarization Model Based on Maximum Coverage Problem and its Variant

ACL ID E09-1089
Title Text Summarization Model Based on Maximum Coverage Problem and its Variant
Venue Annual Meeting of The European Chapter of The Association of Computational Linguistics
Session Main Conference
Year 2009
Authors

We discuss text summarization in terms of maximum coverage problem and its vari- ant. Weexploresomedecodingalgorithms including the ones never used in this sum- marization formulation, such as a greedy algorithm with performance guarantee, a randomized algorithm, and a branch-and- bound method. On the basis of the results of comparative experiments, we also aug- ment the summarization model so that it takesintoaccounttherelevancetothedoc- ument cluster. Through experiments, we showed that the augmented model is su- perior to the best-performing method of DUC’04onROUGE-1withoutstopwords.