๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A fast HMM match algorithm for very large vocabulary speech recognition

โœ Scribed by Alexander Seward

Book ID
108266976
Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
510 KB
Volume
42
Category
Article
ISSN
0167-6393

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A word graph algorithm for large vocabul
A word graph algorithm for large vocabulary continuous speech recognition
โœ Stefan Ortmanns; Hermann Ney; Xavier Aubert ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 360 KB

This paper describes a method for the construction of a word graph (or lattice) for large vocabulary, continuous speech recognition. The advantage of a word graph is that a fairly good degree of decoupling between acoustic recognition at the 10-ms level and the final search at the word level using a