ClusterRank: A Graph Based Method for Meeting Summarization

This paper presents an unsupervised, graph based approach for extractive summarization of meetings. Graph based methods such as TextRank have been used for sentence extraction from news articles. These methods model text as a graph with sentences as nodes and edges based on word overlap. A sentence node is then ranked according to its similarity with other nodes. The spontaneous speech in meetings leads to incomplete, informed sentences with high redundancy and calls for additional measures to extract relevant sentences. We propose an extension of the TextRank algorithm that clusters the meeting utterances and uses these clusters to construct the graph. We evaluate this method on the AM I meeting corpus and show a significant improvement over TextRank and other baseline methods.


Published in:
Interspeech 2009: 10Th Annual Conference Of The International Speech Communication Association 2009, Vols 1-5, 1507-1510
Presented at:
10th INTERSPEECH 2009 Conference, Brighton, ENGLAND, Sep 06-10, 2009
Year:
2009
Publisher:
Isca-Inst Speech Communication Assoc, C/O Emmanuelle Foxonet, 4 Rue Des Fauvettes, Lieu Dit Lous Tourils, Baixas, F-66390, France
ISBN:
978-1-61567-692-7
Keywords:
Laboratories:




 Record created 2010-11-30, last modified 2018-03-17


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)