Packing the Meeting Summarization Knapsack
- Despite considerable work in automatic meeting summarization over the last few years, comparing results remains difficult due to varied task conditions and evaluations. To address this issue, we present a method for determining the best possible extractive summary given an evaluation metric like ROUGE. Our oracle system is based on a knapsack-packing framework, and though NP-Hard, can be solved nearly optimally by a genetic algorithm. To frame new research results in a meaningful context, we suggest presenting our oracle results alongside two simple baselines. We show oracle and baseline results for a variety of evaluation scenarios that have recently appeared in this field.
Author: | Korbinian Riedhammer, Dan Gillick, Benoit Favre, Dilek Hakkani-Tür |
---|---|
Parent Title (English): | INTERSPEECH 2008, 9th Annual Conference of the International Speech Communication Association (ISCA), Brisbane, Australia, September 2008. |
Document Type: | Conference Proceeding |
Language: | English |
Publication Year: | 2008 |
Tag: | evaluation; meetings; summarization |
First Page: | 2434 |
Last Page: | 2437 |
faculties / departments: | Fakultät für Informatik |
Dewey Decimal Classification: | 0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 000 Informatik, Informationswissenschaft, allgemeine Werke |