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

Tone recognition of polysyllabic words in Mandarin speech

โœ Scribed by Lih-Cherng Liu; Wu-Ji Yang; Hsiao-Chuan Wang; Yueh-Chin Chang

Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
728 KB
Volume
3
Category
Article
ISSN
0885-2308

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

Evaluation of word confidence for speech
Evaluation of word confidence for speech recognition systems
โœ Manhung Siu; Herbert Gish ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 195 KB

Confidence measures enable us to assess the output of a speech recognition system. The confidence measure provides us with an estimate of the probability that a word in the recognizer output is either correct or incorrect. In this paper we discuss ways in which to quantify the performance of confide

Comparison of continuous speech recognit
Comparison of continuous speech recognition systems with unknown-word processing for speech disfluencies
โœ Atsuhiko Kai; Seiichi Nakagawa ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 594 KB

This paper describes speech recognition systems for dealing with spontaneous speech, in which an unknownword processing method based on subword sequence decoding is employed. We propose an efficient algorithm for unknown-word processing that employs an independent process of subword sequence decodin