Bipartite Graph Factorization in Static Decoding Graphs with Long-Span Acoustic Context
Center for Language & Speech Processing(CLSP), JHU via YouTube
PowerBI Data Analyst - Create visualizations and dashboards from scratch
NY State-Licensed Certificates in Design, Coding & AI — Online
Overview
Google, IBM & Meta Certificates — All 10,000+ Courses at 40% Off
One annual plan covers every course and certificate on Coursera. 40% off for a limited time.
Get Full Access
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