DocumentCode
353718
Title
Long range language models for free spelling recognition
Author
Thiele, Frank ; Rueber, Bernhard ; Klakow, Dietrich
Author_Institution
Philips Res. Lab., Aachen, Germany
Volume
3
fYear
2000
fDate
2000
Firstpage
1715
Abstract
Highly accurate spelling recognizers are essential in many commercially relevant applications. Examples are directory assistance, address taking in ordering services or help desks, and input of difficult or unknown words in dictation. Language models whose context length is flexibly configured by incorporating automatically determined letter groups code the structure of the recognition items in traditional bi- or trigrams. This gives a powerful method trading off computational demands versus recognition accuracy, comparing favorably with the standard word-list constraint. In addition, the automatic modeling of new words proves its benefits in applications with high out-of-vocabulary rates. For the task of spelling German last names over the telephone, letter error rates could be improved from 12.5% using a standard bigram to 3.6% with a trigram on a set of 2782 letter groups, giving the additional benefit of recognizing about 40% of the names not seen before in the language model training corpus
Keywords
speech recognition; German last name spelling; automatic new word modeling; bigrams; free spelling recognition; highly accurate spelling recognizers; letter error rates; long range language models; out-of-vocabulary rates; recognition accuracy; telephone; trigrams; word-list constraint; Context modeling; Error analysis; Hidden Markov models; Humans; Laboratories; Lattices; Natural languages; Speech recognition; Telephony; Vocabulary;
fLanguage
English
Publisher
ieee
Conference_Titel
Acoustics, Speech, and Signal Processing, 2000. ICASSP '00. Proceedings. 2000 IEEE International Conference on
Conference_Location
Istanbul
ISSN
1520-6149
Print_ISBN
0-7803-6293-4
Type
conf
DOI
10.1109/ICASSP.2000.862082
Filename
862082
Link To Document