Bipartite Graph Factorization in Static Decoding Graphs with Long-Span Acoustic Context
Center for Language & Speech Processing(CLSP), JHU via YouTube
UC San Diego Product Management Certificate — AI-Powered PM Training
Learn AI, Data Science & Business — Earn Certificates That Get You Hired
Overview
AI, Data Science & Cloud Certificates from Google, IBM & Meta — 40% Off
One plan covers every Professional Certificate on Coursera. 40% off Coursera Plus Annual.
Unlock All Certificates
Learn advanced speech recognition techniques through this lecture that explores bipartite graph factorization methods applied to static decoding graphs incorporating long-span acoustic context, presented by Geoffrey Zweig from the Center for Language & Speech Processing at Johns Hopkins University, covering mathematical foundations of graph-based decoding approaches and their implementation in modern automatic speech recognition systems.
Syllabus
Geoffrey Zweig: Bipartite Graph Factorization in Static Decoding Graphs with Long-Span Acoustic C...
Taught by
Center for Language & Speech Processing(CLSP), JHU