Accession Number : ADA310308

Title :   Efficient Algorithms for Speech Recognition.

Descriptive Note : Doctoral thesis,

Corporate Author : CARNEGIE-MELLON UNIV PITTSBURGH PA DEPT OF COMPUTER SCIENCE

Personal Author(s) : Ravishankar, Mosur K.

PDF Url : ADA310308

Report Date : 15 MAY 1996

Pagination or Media Count : 146

Abstract : Advances in speech technology and computing power have created a surge of interest in the practical application of speech recognition. However, the most accurate speech recognition systems in the research world are still far too slow and expensive to be used in practical, large vocabulary continuous speech applications. Their main goal has been recognition accuracy, with emphasis on acoustic and language modelling. But practical speech recognition also requires the computation to be carried out in real time within the limited resources CPU power and memory size of commonly available computers. There has been relatively little work in this direction while preserving the accuracy of research systems. In this thesis, we focus on efficient and accurate speech recognition. It is easy to improve recognition speed and reduce memory requirements by trading away accuracy, for example by greater pruning, and using simpler acoustic and language models. It is much harder to improve both the recognition speed and reduce main memory size while preserving the accuracy. This thesis presents several techniques for improving the overall performance of the CMU Sphinx-II system. Sphinx-II employs semi-continuous hidden Markov models for acoustics and trigram language models, and is one of the premier research systems of its kind. The techniques in this thesis are validated on several widely used benchmark test sets using two vocabulary sizes of about 20K and 58K words. The main contributions of this thesis are an 8-fold speedup and 4-fold memory size reduction over the baseline Sphinx-II system. The improvement in speed is obtained from the following techniques: lexical tree search, phonetic fast match heuristic, and global best path search of the word lattice.

Descriptors :   *ALGORITHMS, *SPEECH RECOGNITION, VELOCITY, REQUIREMENTS, GLOBAL, SIZES(DIMENSIONS), MODELS, REAL TIME, COMPUTERS, PATHS, ACCURACY, EFFICIENCY, THESES, MEMORY DEVICES, TREES, SEARCHING, STANDARDS, LANGUAGE, HEURISTIC METHODS, RESOURCES, ACOUSTICS, SPEECH, VOCABULARY, LEXICOGRAPHY, TEST SETS.

Subject Categories : Voice Communications

Distribution Statement : APPROVED FOR PUBLIC RELEASE