DUC04

We discuss text summarization in terms of maximum coverage problem and its vari- ant. We explore some decoding algorithms including the ones never used in this sum- marization formulation, such …...

We treat the text summarization problem as maximizing a submodular function under a budget constraint. We show, both theoretically and empirically, a modified greedy algorithm can efficiently solve the budgeted …...

Multi-document Summarization (MDS) is of great value to many real world applications. Many scoring models are proposed to select appropriate sentences from documents to form the summary, in which the …...