Noah-A Bottom-Up Word Hypothesizer for Large-Vocabulary Speech Understanding Systems

Current high-accuracy speech understanding systems achieve their performance at the cost of highly constrained grammars over relatively small vocabularies. Less-constrained systems will need to compensate for their loss of top-down constraint by improving bottom-up performance. To do this, they will need to eliminate from consideration at each place in the utterance most words in their vocabularies solely on the basis of acoustic information and expected pronunciations of the words. Towards this goal, we present the design and performance of Noah, a bottom-up word hypothesizer which is capable of handling large vocabularies-more than 10 000 words. Noah takes (machine) segmented and labeled speech as input and produces word hypotheses. The primary concern of this work is the problem of word hypothesizing from large vocabularies. Particular attention has been paid to accuracy, knowledge representation, knowledge acquisition, and flexibility. In this paper we discuss the problem of word hypothesizing, describe how the design of Noah faces these problems, and present the performance of Noah as a function of the vocabulary size.

[1]  P. Denes,et al.  Spoken Digit Recognition Using Time‐Frequency Pattern Matching , 1960 .

[2]  G. A. Miller,et al.  Some perceptual consequences of linguistic rules , 1963 .

[3]  J. H. King,et al.  Some experiments in spoken word recognition , 1966 .

[4]  Pierre Jules Louis Edmond Vicens,et al.  Aspects of speech recognition by computer , 1969 .

[5]  Donald E. Knuth,et al.  The art of computer programming: sorting and searching (volume 3) , 1973 .

[6]  Lee D. Erman,et al.  A model and a system for machine recognition of speech , 1973 .

[7]  Lee D. Erman,et al.  The Hearsay-I Speech Understanding System: An Example of the Recognition Process , 1973, IEEE Transactions on Computers.

[8]  A. Smith,et al.  Word hypothesization in the hearsay II speech system , 1976, ICASSP.

[9]  N. R. Dixon,et al.  Preliminary results on the performance of a system for the automatic recognition of continuous speech , 1976, ICASSP.

[10]  John W. Klovstad Probabilistic lexical retrieval component with embedded phonological word boundary rules , 1976, ICASSP.

[11]  Bruce T. Lowerre,et al.  The HARPY speech recognition system , 1976 .

[12]  D. McKeown,et al.  Word verification in the Hearsay II speech understanding system , 1977 .

[13]  Edward A. Felgenbaum The art of artificial intelligence: themes and case studies of knowledge engineering , 1977, IJCAI 1977.

[14]  Edward A. Feigenbaum,et al.  The Art of Artificial Intelligence: Themes and Case Studies of Knowledge Engineering , 1977, IJCAI.

[15]  Raj Reddy,et al.  A recursive segmentation procedure for continuous speech , 1978 .

[16]  Jr. Allen Richard Smith,et al.  Word hypothesization for large-vocabulary speech understanding systems. , 1978 .