Event

Extractive document summarization

Daniel Gillick

ICSI

Monday, March 10, 2008
12:30

What are the limits of extractive document summarization? We formulate the problem of maximum Rouge as a generalization of knapsack packing and use local search algorithms to show that extractive summarization can achieve Rouge scores nearly double those of current summarizers. Next, we suggest how to use this framework to build a summarizer, and the resulting system gives state-of-the-art Rouge results on the DUC 2007 evaluation set.