✦ LIBER ✦

An efficient search space representation for large vocabulary continuous speech recognition

✍ Scribed by Kris Demuynck; Jacques Duchateau; Dirk Van Compernolle; Patrick Wambacq

Book ID: 108410746
Publisher: Elsevier Science
Year: 2000
Tongue: English
Weight: 626 KB
Volume: 30
Category: Article
ISSN: 0167-6393
DOI: 10.1016/s0167-6393(99)00030-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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

From within-word model search to across-

From within-word model search to across-word model search in large vocabulary continuous speech recognition

✍ Achim Sixtus; Hermann Ney 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 275 KB

In this paper we report on the application of across-word context dependent acoustic phoneme models in a single-pass large vocabulary continuous speech recognizer. Although across-word models are used by many groups today, only an outline of the recognizers is usually given in the publications. Imp

Large-vocabulary continuous speech recog

Large-vocabulary continuous speech recognition using linear lexicon search and 1-best approximation tree-structured lexicon search

✍ Norihide Kitaoka; Nobutoshi Takahashi; Seiichi Nakagawa 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 308 KB

A very large vocabulary continuous speec

A very large vocabulary continuous speech recognition algorithm for telephone directory assistance

✍ Yasuhiro Minami; Tomokazu Yamada; Kiyohiro Shikano; Tatsuo Matsuoka 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 857 KB

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