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, ill-formed 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 AMI meeting corpus and show a significant improvement over TextRank and other baseline methods.
Bibliographic reference. Garg, Nikhil / Favre, Benoit / Reidhammer, Korbinian / Hakkani-Tür, Dilek (2009): "Clusterrank: a graph based method for meeting summarization", In INTERSPEECH-2009, 1499-1502.