Korbinian Riedhammer

Prof. Dr. Korbinian Riedhammer

orcid

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
8 February 2010 in IEEE Transactions on Audio, Speech, and Language Processing
Verified
Journal Article
Closed access
GTGokhan Tur
Gokhan Tur
ASAndreas Stolcke
Andreas Stolcke
LVLynn Voss
Lynn Voss
SPStanley Peters
Stanley Peters
DHDilek Hakkani-Tur
Dilek Hakkani-Tur
FYFan Yang
Fan Yang
The CALO Meeting Assistant (MA) provides for distributed meeting capture, annotation, automatic transcription and semantic analysis of multiparty meetings, and is part of the larger CALO personal assistant system. This paper presents the CALO-MA architecture and its speech recognition and understanding components, which include real-time and offline speech transcription, dialog act segmentation and tagging, topic identification and segmentation, question-answer pair identification, action item recognition, decision extraction, and summarization.

1 March 2012
Verified
Conference Paper
Closed access
DPDaniel Povey
Daniel Povey
MHMirko Hannemann
Mirko Hannemann
GBGilles Boulianne
Gilles Boulianne
LBLukas Burget
Lukas Burget
AGArnab Ghoshal
Arnab Ghoshal
NVNgoc Thang Vu
Ngoc Thang Vu
We describe a lattice generation method that is exact, i.e. it satisfies all the natural properties we would want from a lattice of alternative transcriptions of an utterance. This method does not introduce substantial overhead above one-best decoding. Our method is most directly applicable when using WFST decoders where the WFST is “fully expanded”, i.e. where the arcs correspond to HMM transitions. It outputs lattices that include HMM-state-level alignments as well as word labels. The general idea is to create a state-level lattice during decoding, and to do a special form of determinization that retains only the best-scoring path for each word sequence. This special determinization algorithm is a solution to the following problem: Given a WFST A, compute a WFST B that, for each input-symbol-sequence of A, contains just the lowest-cost path through A.

18 September 2022
Verified
Conference Paper
Open access
SBSebastian Peter Bayerl
Sebastian Peter Bayerl
DWDominik Wagner
Dominik Wagner
ENElmar Noeth
Elmar Noeth
Korbinian RiedhammerKorbinian Riedhammer
Korbinian Riedhammer

1 October 2010 in Speech Communication
Verified
Journal Article
Open access
Korbinian RiedhammerKorbinian Riedhammer
Korbinian Riedhammer
BFBenoit Favre
Benoit Favre
DHDilek Hakkani-Tür
Dilek Hakkani-Tür

2 September 2018
Verified
Conference Paper
Closed access
FBFerdinand Brasser
Ferdinand Brasser
TFTommaso Frassetto
Tommaso Frassetto
Korbinian RiedhammerKorbinian Riedhammer
Korbinian Riedhammer
ASAhmad-Reza Sadeghi
Ahmad-Reza Sadeghi
TSThomas Schneider
Thomas Schneider
CWChristian Weinert
Christian Weinert

1 April 2009
Verified
Conference Paper
Closed access
DGDan Gillick
Dan Gillick
Korbinian RiedhammerKorbinian Riedhammer
Korbinian Riedhammer
BFBenoit Favre
Benoit Favre
DHDilek Hakkani-Tur
Dilek Hakkani-Tur
We introduce a model for extractive meeting summarization based on the hypothesis that utterances convey bits of information, or concepts. Using keyphrases as concepts weighted by frequency, and an integer linear program to determine the best set of utterances, that is, covering as many concepts as possible while satisfying a length constraint, we achieve ROUGE scores at least as good as a ROUGE-based oracle derived from human summaries. This brings us to a critical discussion of ROUGE and the future of extractive meeting summarization.