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 ROUGE-based oracle derived from human summaries. This brings us to a critical discussion of ROUGE and the future of extractive meeting summarization.

Export metadata

Additional Services

Search Google Scholar
Author:Dan Gillick, Korbinian Riedhammer, Benoit Favre, Dilek Hakkani-Tür
Parent Title (English):2009 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Taipei, Taiwan, April 2009.
Document Type:Conference Proceeding
Publication Year:2009
Tag:integer linear programming; meeting summarization; summarization evaluation
First Page:4769
Last Page:4772
faculties / departments:Fakultät für Informatik
Dewey Decimal Classification:0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 000 Informatik, Informationswissenschaft, allgemeine Werke