DocumentCode
3349563
Title
Using a transcription graph for large vocabulary continuous speech recognition
Author
Li, Z. ; O´Shaughnessy, D.
Author_Institution
Quebec Univ., Verdun, Que., Canada
Volume
1
fYear
1996
fDate
7-10 May 1996
Firstpage
121
Abstract
A new algorithm is developed for constructing a transcription graph in large vocabulary continuous speech recognition. The transcription graph satisfies lexical constraints and encodes all high scoring phonetic transcriptions. By building a transcription graph in parallel with the word graph, we use high-level knowledge sources to constrain the paths of phonetic transcriptions such that they are created only if needed for building the word graph. This not only speeds up the search of the lexicon, but also limits the memory requirement in our system
Keywords
graph grammars; knowledge based systems; natural languages; speech processing; speech recognition; acoustic modelling; algorithm; high scoring phonetic transcriptions; high-level knowledge sources; large vocabulary continuous speech recognition; lexical constraints; phonetic transcriptions; system memory requirement; transcription graph; word graph; Buildings; Business; Costs; Dictionaries; Natural languages; Power generation economics; Speech recognition; Viterbi algorithm; Vocabulary;
fLanguage
English
Publisher
ieee
Conference_Titel
Acoustics, Speech, and Signal Processing, 1996. ICASSP-96. Conference Proceedings., 1996 IEEE International Conference on
Conference_Location
Atlanta, GA
ISSN
1520-6149
Print_ISBN
0-7803-3192-3
Type
conf
DOI
10.1109/ICASSP.1996.540305
Filename
540305
Link To Document