Text summarization model based on maximum coverage problem and its variant
Open Access
- 1 January 2009
- conference paper
- Published by Association for Computational Linguistics (ACL)
- p. 781-789
Abstract
We discuss text summarization in terms of maximum coverage problem and its variant. We explore some decoding algorithms including the ones never used in this summarization formulation, such as a greedy algorithm with performance guarantee, a randomized algorithm, and a branch-andbound method. On the basis of the results of comparative experiments, we also augment the summarization model so that it takes into account the relevance to the document cluster. Through experiments, we showed that the augmented model is superior to the best-performing method of DUC'04 on ROUGE-1 without stopwords.Keywords
This publication has 5 references indexed in Scilit:
- Document concept lattice for text understanding and summarizationInformation Processing & Management, 2007
- Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance GuaranteeJournal of Combinatorial Optimization, 2004
- The budgeted maximum coverage problemInformation Processing Letters, 1999
- An algorithm for suffix strippingProgram: electronic library and information systems, 1980
- Fast Sequential Decoding Algorithm Using a StackIBM Journal of Research and Development, 1969