ISCA Archive Interspeech 2008
ISCA Archive Interspeech 2008

Packing the meeting summarization knapsack

Korbinian Riedhammer, Dan Gillick, Benoit Favre, Dilek Hakkani-Tür

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.


doi: 10.21437/Interspeech.2008-604

Cite as: Riedhammer, K., Gillick, D., Favre, B., Hakkani-Tür, D. (2008) Packing the meeting summarization knapsack. Proc. Interspeech 2008, 2434-2437, doi: 10.21437/Interspeech.2008-604

@inproceedings{riedhammer08_interspeech,
  author={Korbinian Riedhammer and Dan Gillick and Benoit Favre and Dilek Hakkani-Tür},
  title={{Packing the meeting summarization knapsack}},
  year=2008,
  booktitle={Proc. Interspeech 2008},
  pages={2434--2437},
  doi={10.21437/Interspeech.2008-604}
}