Data compression for speech recognition

Abstract: A data compression system greatly compresses the stored data used by a speech recognition system employing hidden Markov models (HMM). The speech recognition system vector quantizes the acoustic space spoken by humans by dividing it into a predetermined number of acoustic features that are stored as codewords in a vector quantization (output probability) table or codebook. For each spoken word, the speech recognition system calculates an output probability value for each codeword, the output probability value representing an estimated probability that the word will be spoken using the acoustic feature associated with the codeword. The probability values are stored in an output probability table indexed by each codeword and by each word in a vocabulary. The output probability table is arranged to allow compression of the probability of values associated with each codeword based on other probability values associated with the same codeword, thereby compressing the stored output probability. By compressing the probability values associated with each codeword separate from the probability values associated with other codewords, the speech recognition system can recognize spoken words without having to decompress the entire output probability table. In a preferred embodiment, additional compression is achieved by quantizing the probability values into 16 buckets with an equal number of probability values in each bucket. By quantizing the probability values into buckets, additional redundancy is added to the output probability table, which allows the output probability table to be additionally compressed.

Description: Technical Field The invention relates to speech recognition using hidden Markov models, and more particularly, to a data compression system for compressing the hidden Markov models. Background of the Invention Under present technology, human input into computers usually involves typing in instructions or data with a keyboard or pointing to meaningful areas of the computer display unit with a pointing device such as a mouse. However, most people are much more comfortable communicating using speech. Speech communications are particularly important in places where the written language is very difficult to input into a computer. such as Chinese or Kanji. Consequently, the development of a speech recognizer for a computer would greatly expand the useability and the usefulness of computers. Many computer speech recognizers have been developed with varying success. Difficulties in recognizing speech arise from acoustic differences occurring each time a word is spoken. These acoustic differences can be caused by differences in each speaker's accent. speaking speed, loudness and vocal quality. Even a single word spoken by a single speaker varies acoustically due to changes in the speaker, such as health or stress levels, or changes in the speaker's environment, such as background noise and room acoustics. One prior art speech recognition system that has achieved some success is the hidden Markov model (HMM) system. In general, HMM systems are based on modeling each speech signal by some well-defined statistical algorithms that can automatically extract knowledge from speech data. The data needed for the HMM statistical models are obtained by numerous training words being spoken together with a typed indication of the words being spoken. Like all statistical methods, the accuracy of the HMM speech recognition systems improves greatly as the number of spoken training words increases. Given the large number of acoustic variables, the number of spoken training words needed to model accurately the spoken words can be quite large. Consequently. the memory needed to store the models necessary to recognize a large vocabulary of words is extensive, e.g., approximately 28 megabytes. In general, HMM speech recognition systems model each word according to output and transitional probability distributions. The output probability distribution refers to the probabilities of the word having each acoustic feature in a set of predefined acoustic features. The transitional probability distribution for the word refers to the probabilities of a predefined portion, known as a state or frame. of the word being followed by either a new state or a repetition of the current state. For example, the word "dog" has a relatively high output probability of including a hard "d" sound. A transitional probability distribution refers to the probability of the "o" sound being repeated in the next frame and the probability of the "g" occurring in the next state. It should be recognized that a word typically includes 40-50 states, much more than the three phones of the "dog" example, but the transitional and output probability distribution concepts are the same. Prior art HMM speech recognition systems typically employ vector quantization to divide the acoustic space or frequency range spoken by humans into a predetermined number of acoustic feature models that are given labels called "codewords." The output probabilities for each word are represented by probability values for each codeword. Typically, approximately 200 codewords are chosen to allow accurate modeling of the spoken words with minimum distortion caused by an acoustic feature falling between two adjacent acoustic feature models. Because the range of codewords is chosen to represent all of the possible acoustic features of speech, it is highly unlikely that a single word will have a non-zero probability for every codeword. In fact, most words have a non-zero probability value for a minority of the codewords. As a result, the models for most words are stored with a substantial number of repeated zero probability values. These repeated zero probability values take up much storage space with very little relevant information content. It is an object of the invention to provide a method and a system for improved speech recognition that allow more words to be modeled and recognized than is possible with prior art speech recognition systems. This object is solved by the method as claimed in independent claim 1 and by the system as claimed in independent claim 7. Preferred embodiments of the invention are subject matters of dependent claims. The speech recognition system vector quantizes the acoustic space spoken by humans by dividing it into a predetermined number of acoustic features that are stored as codewords in a vector quantization (VQ) table or codebook. For each spoken word, the speech recognition system calculates an output probability value for each codeword, the output probability value representing an estimated probability that the word will be spoken using the acoustic feature associated with the codeword. The probability values are stored in an output probability table indexed by codeword and by each word in a vocabulary. The output probability table is arranged to allow compression of the probability of values associated with each codeword based on other probability values associated with the same codeword, thereby compressing the stored output probability. By compressing the probability values associated with each codeword separate from the probability values associated with other codewords, the speech recognition system can recognize spoken words without having to decompress the entire output probability table. In a preferred embodiment, additional compression is achieved by quantizing the probability values into 16 buckets with an equal number of probability values in each bucket. By quantizing the probability values into buckets, additional redundancy is added to the output probability table, which allows the output probability table to be additionally compressed. Brief Description of the Drawings Figure 1 is a block diagram of a speech recognition system including a data compression system according to a preferred embodiment of the invention. Figure 2 is a flow diagram of a training method used in connection with the speech recognition system shown in Figure 1. Figure 3 is a storage diagram of a compression system used with the speech recognition system shown in Figure 1. Figure 4 is a flow diagram of a compression method for a speech recognition system according to the present invention. Figure 5 is a storage diagram of an alternate compression system used with the speech recognition system shown in Figure 1. Figure 6 is a flow diagram of a recognition method used with the speech recognition system shown in Figure 1. Figure 7 is a diagram showing an example of a word being recognized according to the speech recognition system shown in Figure 1. Detailed Description of the Invention According to a preferred embodiment of the present invention, a data compression system greatly compresses the stored data used by a speech recognition system employing hidden Markov models (HMM). The speech recognition system vector quantizes the acoustic space spoken by humans by dividing it into a predetermined number of acoustic features that are stored as codewords in a vector quantization (VQ) table or codebook. For each spoken word, the speech recognition system calculates an output probability value for each codeword, the output probability value representing an estimated probability that the word will be spoken using the acoustic feature associated with the codeword. The probability values are stored in an output probability table indexed by codeword and by each word in a vocabulary. The output probability table is arranged to allow compression of the probability of values associated with each codeword based on other probability values associated with the same codeword, thereby compressing the stored output probability. By compressing the probability values associated with each codeword separate from the probability values associated with other codewords, the speech recognition system can recognize spoken words without having to decompress the entire output probability table. In a preferred embodiment, additional compression is achieved by quantizing the probability values into 16 buckets with an equal number of probability values in each bucket. By quantizing the probability values into buckets, additional redundancy is added to the output probability table, which allows the output probability table to be additionally compressed. Shown in Figure 1 is a speech recognition system 10 that models incoming speech data based on hidden Markov models. A word spoken into a microphone 12 is amplified by an amplifier 14 and passed to an analog/digital (A/D) converter 16. The A/D converter 16 transforms the analog speech signal into a sequence of digital samples, which is supplied to a feature filter 18. The feature filter 18 is a conventional array processor that performs spectral analysis to compute a magnitude value for each frequency of a frequency spectrum. Known methods of spectral analysis include fast Fourier transforms, linear predictive coding, and other acoustic parameterizations such as cepstral coefficients. Preferably the spectral analysis is performed every 10 milliseconds such that each spoken word is made up of many 10 millisecond frames. Each frame is transmitted to a data processor 20 which can be any conventional computer such as a desktop personal computer. The data processor 20 includes a codeword designator 22 that receives each input frame and compares the input frame to numerous acoustic feature models represented by codewords in a vector quantization (VQ) table 24. In a preferred embodiment, there are 200 codewords in the VQ table 24 that are chosen to adequately cover the entire human speaking range. The codeword that most closely matches the acoustic features of the input frame becomes associated with that input frame. As such, the codeword designator 22 outputs a string of codewords for each spoken word with an interval of 10 milliseconds between consecutive codewords. The codeword string is transmitted via a switch 26 to either a trainer 28 or a recognizer 30. The trainer 28 calculates a hidden Markov model for each word and the recognizer 30 uses the hidden Markov models to recognize subsequent occurrences of the same word. The trainer 28 stores the hidden Markov models in memory, the hidden Markov models including a transition probabilities table 32 storing frame transition information and an output probability table 34 storing feature output probabilities for each word. A compressor 36 compresses the probability values in the output probabilities table as described in more detail below. Upon recognizing a spoken word, the recognizer passes the recognized word to an output 38 that displays the recognized word to a user. Shown in Figure 2 is a preferred embodiment of a training method 40 employed by the trainer 28 to create one or more hidden Markov models for each word in a vocabulary. The trainer can be easily programmed to create more than one model for each word to accommodate different pronunciations for each word. For example, separate sets of models can represent words spoken with Australian, Southern United States, and Mid-Western United States accents, respectively. In step 42, the trainer 28 receives a string of codewords for a spoken word from the codeword designator 22 via the switch 26. Based on the codeword string, the trainer 28 computes transition probabilities for the transitions between the frames or states of the codeword string (step 44) and stores the transition probabilities in the transition probability table 32 in step 46. In step 48, the trainer 26 computes an output probability value for each codeword in the codeword string and stores the probability values for each codeword produced for the spoken word in the output probability table 34 in step 50. The computations of the transition and output probabilities are well known in the speech recognition art and generally in the statistics art. Obviously, the probability computations become more meaningful as the number of times that the word is trained increases. In order to understand the importance of the output probability table 34, a discussion of the prior art methods of storing output probabilities may be helpful. Prior art HMM speech recognition systems store each hidden Markov model (including the output probability values) for a word separately from all other hidden Markov models, including other hidden Markov models of the same word, if any. For example, assuming that there are 200 codewords in the VQ table, a prior art hidden Markov model for a word "a" may include probability values 20, 28, 35, 0. 0, 0. 0, 57, 54, ..., 0 (percent values) for codewords 1-9, ... 200. The output probabilities can be compressed by replacing identical repeated probability values for successive codewords by a compression code representing the replaced probability values. A major problem with such a compression scheme is that the compressed probability values of every modeled word must be decompressed before any recognition takes place. Shown in Figure 3 is the output probability table with exemplary probability values before and after being compressed according to the present invention. Each column of the uncompressed table corresponds to a hidden Markov model for a vocabulary of words A-Z, while the rows correspond to the codeword identifiers 1-200. As discussed above, each word can have more than one hidden Markov model. For example. separate models may be desired for words commonly spoken differently by different speakers, such as the word "either." By grouping the probability values for all of the models in a single table, the probability values for each codeword identifier can be grouped together and compressed as a group. Shown in Figure 4 is a compression method 52 for compressing the probability values for each codeword in the uncompressed output probability table 34A to produce the compressed output probability table shown in Figure 3. The compression method is a run-length encoding of each codeword, although numerous other compression methods could also be used. In step 54, the compression method sets a variable X equal to a first probability value for the codeword. In step 56, the compression method sets a count value equal to one. In step 58, a variable Y is set equal to a next probability value for the codeword and in step 60, the compression method determines whether X equals Y. In the example for the codeword "1", the first probability value (X) is 20 and the second probability value (Y) is 21, so no match is found in step 60. In step 62, the count value is compared to a threshold value T to determine whether a string of matching values is of a length that is sufficient to justify compressing the string. In a preferred embodiment, the threshold value T equals two. but others may wish to set a higher threshold value such that only longer strings of matching probability values are compressed. Given that a match has yet to be found, the first probability value X (20) is stored in step 64 without being compressed. In step 66, the compression method determines whether there are more probability values for the codeword being compressed. Because there are more values for the codeword 1 in the present example, in step 68 the compression method sets the X variable equal to Y. Steps 58 through 68 are then repeated for the next two probability values, resulting in the probability values 21 and 20 being stored without being compressed. After the "C" probability value has been analyzed for the codeword 1, the X value is set equal to the zero of the D column in step 68, and the Y value is set equal to the zero of the E column in step 58. The compression method determines in step 60 that X = Y, so in step 70, the count value is incremented to 2, indicating a run of two matching values. Steps 66, 68, 58, 60 and 70 are repeated for the next probability value (a zero of the F column) resulting in a run of three matching values. Assuming that the probability value following the F column is not a zero, step 60 determines that another match is not found. The compression method determines in step 62 that the count value exceeds the threshold value, so in step 72, the compression method stores a compression code indicating their repeated probability value X (0) and the count value (3). In step 74, the compression method resets the count value to 1 to search for the next run of probability values. When step 66 determines that no more probability values exist for the current codeword, the compression moves on to the next codeword in step 76. Steps 54 through 76 are repeated for each codeword until the entire output probability table 34A has been compressed into the compressed output probability table 34B shown in Figure 3. Shown in Figure 5 is an alternate output probability table for the same probability data shown in Figure 3. In the alternate embodiment, the probability values are quantized into a predetermined number of buckets, the predetermined number being less than the range of probability values computed. Any number of buckets can be chosen, with 16 being preferable, as each of the numbers 0 through 15 can be expressed using four bits. Alternatively, one can use fewer buckets for greater compression and more buckets for greater accuracy. The range of each bucket is chosen so that an equal number of probability values is represented by each bucket. For example, if there are numerous small probability values, it may take three buckets to represent probability values from 0 to 5 and one bucket to represent probability values from 75 to 100. Preferably, the range of each bucket is dynamically adjusted based on the distribution of the probability values to ensure that an equal number of probability values is represented by each bucket. In the embodiment shown in Figure 5. the probability values are assumed to be equally distributed from 0 to 100 such that each bucket represents an equally sized range of probability values. As can be seen. the quantization of the probability values into buckets produces more identical values than are found in the unquantized output probability table. As a result. when the output probability table is compressed using the compression methods shown in Figure 4, a compressed probability table is produced that is much more compressed than the compressed unquantized probability table shown in Figure 3. After a sufficient number of words has been trained and the output probability table has been compressed. the speech recognition system 10 is ready to recognize a new spoken word. As discussed above, the word is spoken into the microphone 12 and converted into a string of codewords by the amplifier 16. A/D converter 18 and codeword designator 22. The user sets the switch 26 to transmit the codeword string to the recognizer 30 rather than the trainer 28. Alternatively, the codeword string can be sent to the trainer 28 in addition to the recognizer 30 so that the trainer can adapt the hidden Markov models while the word is recognized by the recognizer. Shown in Figure 6 is a method 78 performed by the recognizer 30 (Figure 1) to recognize a spoken word by determining the hidden Markov model with the highest probability of matching the spoken word. In step 80. the recognizer sets a wordscore (W(n)) equal to zero for each hidden Markov model (n). Each wordscore represents the total probability value for each Hidden Markov model that has a greater than zero probability of being the spoken input word. In step 82, the recognizer 30 receives an input codeword corresponding to the first frame of the spoken input word. In step 84, the recognizer decodes the output probability values (O(n)) in the compressed output probability table 34D for the codeword. In step 86, the recognizer computes a transition score (T(n)) for each hidden Markov model. In step 88, for each word model, the recognizer multiplies the transition score by the output probability value for the codeword and adds the result to the previously calculated wordscore, resulting in a new wordscore. In step 90, the recognizer determines whether the end of the input word has been reached. If not, then the steps 82 through 90 are repeated for each frame of the input word. When the end of the word has been reached, the recognizer causes the output 38 in step 92 to display the word with the best wordscore, i.e., the word whose word model is computed to have the highest probability of corresponding to the spoken input word. Optionally, the recognizer can be programmed to output a list of possible matching words whose word models resulted in high wordscores. Shown in Figure 7 is an example of the recognition method 78 performed on a spoken input word that has been converted in the string of codewords 12, 8, 10, 4 by the codeword designator 22 (Figure 1). The recognizer 30 receives the first codeword (12) in step 82 and decompresses the probability values associated with that codeword for each hidden Markov model to obtain 0, 0, 0, 0, 0, 0, ... 5 in step 84. In steps 86, 88, the recognizer computes a transition value T n1 (for simplicity, the subscript for each model is not shown in Figure 7) and a wordscore for each model. It should be recognized that because the compression method identifies repeated probability values, the wordscore value need only be computed once for each run of identical probability values. After decompressing the probability values for each codeword and computing the wordscores for each model the recognizer outputs the word whose model achieved the highest wordscore. It will be appreciated that because each of the models shown have a zero output probability for at least one codeword of the input word, none of the models is a good match. Ordinarily, at least one of the models will have a positive output probability for all of the codewords of the input word. The method described above for computing a wordscore for each hidden Markov model is a modified version of a well-known algorithm known as the Forward-Backward algorithm described in detail in U.S. Patent No. 4,829,577 and Huang et al., Hidden Markov Models for Speech Recognition, Edinburgh University Press, 1990. The conventional algorithm is modified to the extent that only the probability values for each codeword found for the input spoken word are decompressed and used to compute the codeword. Other well-known recognition algorithms can also be used with the modification just described, such as the Viterbi algorithm described in the Huang et al. book. As discussed above, the invention provides a method and system for highly compressing the hidden Markov models used in a speech recognition system. By compressing the output probability values associated with each codeword separate from the output probability values associated with other codewords, the speech recognition system can recognize spoken words without having to decompress the entire output probability table. Further, by quantizing the probability values into a predetermined number of buckets, the output probability values are additionally compressed. Such compression allows the hidden Markov models to be stored in much less space, such as the 25 megabyte to 2 megabyte compression ratio found by the inventors. Such reduced memory requirements allow the speech recognition system as a whole to use less memory space and allows more words to be modeled and recognized than is possible with prior art speech recognition systems. From the foregoing it will be appreciated that. although specific embodiments of the invention have been described herein for purposes of illustration, the invention may be adapted in various ways. Accordingly, the invention is not limited except as by the appended claims.

Claims: A data compression method for a computerized speech recognizer (10) having a plurality of hidden Markov models (A,..., Z; n), comprising the steps of: storing (50) an output probability table (34) having a predetermined number of codewords, each codeword representing an acoustic feature; associating each codeword with a probability value for each hidden Markov model (A,..., Z: n); and characterized by compressing (52) at least some of the probability values associated with each codeword based on other probability values associated with the same codeword, thereby compressing the stored table (34), such that the compressed probability values associated with a selected codeword can be decompressed independently of probability values associated with a different, non-selected codeword. The data compression method as claimed in claim 1, wherein the compressing step (52) is characterized by: counting (54, 56, 58, 60, 70, 66, 68) the number of probability values in a run of consecutive identical probability values associated with a codeword; and encoding (72, 76) the run of consecutive identical probability values with a code that includes an identification (X) of the identical probability value and the number (Count) of consecutive probability values in the run. The data compression method as claimed in claim 1 or 2, further comprising the step of: quantizing the probability values into buckets before compressing (52) the probability values associated with each codeword, each bucket representing a range of probability values. The data compression method as claimed in claim 3, wherein the quantizing step is characterized by quantizing the probability values into 16 buckets. The data compression method as claimed in claim 3 or 4, further characterized by dynamically adjusting the ranges of the buckets according to the number of probability values coming within each range. The data compression method as claimed in one of claims 1 to 5, further comprising the step of recognizing (78) an input frame produced by the speech recognizer (10) based on a sound spoken by a user, the input frame identifying a codeword produced from the spoken sound, wherein the recognizing step (78) is characterized by: decompressing (84) only those probability values associated with codewords of the output probability table that are identical to the codeword of the input frame; and identifying (92) the phonetic models having the highest probability values associated with the codeword of the input frame. A data compression system for a computerized speech recognizer (10) having a plurality of hidden Markov models (A,..., Z: n), comprising: a stored output probability table (34) having a predetermined number of codewords, each codeword representing an acoustic feature, and each codeword being associated with a probability value for each hidden Markov model (A,..., Z: n); and characterized by a data processor (20) adapted to compress (52) at least some of the probability values associated with each codeword based on the other probability values associated with the same codeword, thereby compressing the stored table (34), such that the compressed probability values associated with a selected codeword can be decompressed independently of probability values associated with a different, non-selected codeword. The data compression system as claimed in claim 7, wherein the data processor (20) is characterized by means for compressing (52) the probability values using run-length encoding in which a run of consecutive identical probability values is stored as a code that includes an identification (X) of the identical probability value and the number (Count) of consecutive probability values in the run. The data compression system as claimed in claim 7 or 8, further comprising: means for quantizing the probability values into buckets before compressing (52) the probability values associated with each codeword, each bucket representing a range of probability values. The data compression system as claimed in claim 9, wherein the quantizing means is characterized by means for quantizing the probability values into 16 buckets. The data compression system as claimed in claim 9 or 10, further characterized by means for dynamically adjusting the ranges of the buckets according to the number of probability values coming within each range. The data compression system as claimed in one of claims 7 to 11, further comprising means for recognizing (78) an input frame produced by the speech recognizer (10) based on a sound spoken by a user, the input frame identifying a codeword produced from the spoken sound, wherein the recognizing means is characterized by: means for decompressing (84) only those probability values associated with codewords of the output probability table that are identical to the codeword of the input frame; and means for identifying (92) the phonetic models having the highest probability values associated with the codeword of the input frame.

Inventors: HUANG XUEDONG, ZHANG SHENZHI, HUANG, XUEDONG, ZHANG, SHENZHI
Applicants: MICROSOFT CORP, MICROSOFT CORPORATION
Application year: 1994
Main classification: G10L5
IPC codes: G10L19, G10L15, H03M7, G10L11