Noise immunity learning for word-spotting speech recognition
β Scribed by Yoichi Takebayashi; Hiroshi Kanazawa
- Publisher
- John Wiley and Sons
- Year
- 1992
- Tongue
- English
- Weight
- 848 KB
- Volume
- 23
- Category
- Article
- ISSN
- 0882-1666
No coin nor oath required. For personal study only.
β¦ Synopsis
Abstract
This paper discusses noise immunity learning in speech recognition by wordβspotting. In the proposed method, the learning speech data with superposed noise is constructed by adding the noise data to the clean speech data collected beforehand. Then the recognition dictionary for wordβspotting is trained to improve noise immunity. In the learning, the recognition by wordβspotting is attempted for the artificially synthesized learning data while gradually increasing the ratio of the contained noise. The recognition is executed using the learning word feature vector automatically extracted based on the similarity.
The noise immunity is realized by the simulation in the noisy environment and the automatic learning. The recognition and learning use the word as the unit and the multiple similarity method, which can cope with a wide range of pattern deformation. An evaluation experiment is executed using 13βword speech data (plus noise in a railway station). For the case of 96βdimensional word feature vector (eight dimensions for frequency and 12 dimensions for time), and S/N ratio of 10 dB, the recognition rate is improved from 85.5 percent in the wordβspotting method without learning to 94.1 percent with learning. This indicates the usefulness of the proposed method.
π SIMILAR VOLUMES
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
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