𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A recognition time reduction algorithm for large-vocabulary speech recognition

✍ Scribed by J.M. Koo; C.K. Un

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
405 KB
Volume
11
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

An overview of decoding techniques for l
An overview of decoding techniques for large vocabulary continuous speech recognition
✍ Xavier L. Aubert πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 351 KB

A number of decoding strategies for large vocabulary continuous speech recognition (LVCSR) are examined from the viewpoint of their search space representation. Different design solutions are compared with respect to the integration of linguistic and acoustic constraints, as implied by m-gram langua

The use of tree-trellis search for large
The use of tree-trellis search for large-vocabulary Mandarin polysyllabic word speech recognition
✍ Eng-Fong Huang; Frank K. Soong; Hsiao-Chuan Wang πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 483 KB

In this paper, we propose the use of a tree-trellis search scheme for the task of large vocabulary Mandarin polysyllabic word recognition. Usually, the task of large vocabulary word recognition is computationally intractable by whole-word based approach. We convert this task into a tree network sear