A global optimization framework for meeting summarization

We introduce a model for extractive meeting summarization based on the hypothesis that utterances convey bits of information, or concepts. Using keyphrases as concepts weighted by frequency, and an integer linear program to determine the best set of utterances, that is, covering as many concepts as possible while satisfying a length constraint, we achieve ROUGE scores at least as good as a ROUGEbased oracle derived from human summaries. This brings us to a critical discussion of ROUGE and the future of extractive meeting summarization.

• Type: Conference
• Year: 2009
• Where: ICASSP
• Authors: Daniel Gillick, Korbinian Riedhammer, Benoît Favre, Dilek Z. Hakkani-Tür
• Keywords: Convey Bits, Extractive Meeting Summarization, ICASSP 2009, Integer Linear Program, Signal Processing