Long story short – Global unsupervised models for keyphrase based meeting summarization

We analyze and compare two different methods for unsupervised extractive spontaneous speech summarization in the meeting domain. Based on utterance comparison, we introduce an optimal formulation for the widely used greedy maximum marginal relevance (MMR) algorithm. Following the idea that informati...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Speech communication 2010-10, Vol.52 (10), p.801-815
Hauptverfasser:	Riedhammer, Korbinian, Favre, Benoit, Hakkani-Tür, Dilek
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Applied sciences Computation and Language Computer programs Computer Science Exact sciences and technology Global optimization Information, signal and communications theory Keyphrases Mathematical models Meetings Multi-party meetings speech Optimization Signal and communications theory Signal processing Signal representation. Spectral analysis Signal, noise Software Speech Speech processing Spreads Summarization Telecommunications and information theory
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!