NORMALIZATION OF SPEECH BY ADAPTIVE LABELLING

Abstract: In a speech processor system in which prototype vectors of speech are generated by an acoustic processor under reference noise and known ambient conditions and in which feature vectors of speech are generated during varying noise and other ambient and recording conditions, normalized vectors are generated to reflect the form the feature vectors would have if generated under the reference conditions. The normalized vectors are generated by: (a) applying an operator function A i to a set of feature vectors x occurring at or before time interval i to yield a normalized vector y i = A i (x); (b) determining a distance error vector E i by which the normalized vector is projectively moved toward the closest prototype vector to the normalized vector y i ; (c) up-dating the operator function for next time interval to correspond to the most recently determined distance error vector; and (d) incrementing i to the next time interval and repeating steps (a) through (d) wherein the feature vector corresponding to the incremented i value has the most recent up-dated operator function applied thereto. With successive time intervals, successive normalized vectors are generated based on a successively up-dated operator function. For each normalized vector, the closest prototype thereto is associated therewith. The string of normalized vectors or the string of associated prototypes (or respective label identifiers thereof) or both provide output from the acoustic processor.

Description: In general, the present invention relates to speech processing (such as speech recognition). In particular, the invention relates to apparatus and method for characterizing speech as a string of spectral vectors and/or labels representing predefined prototype vectors of speech. In speech processing, speech is generally represented by an n-dimensional space in which each dimension corresponds to some prescribed acoustic feature. For example, each component may represent an amplitude of energy in a respective frequency band. For a given time interval of speech, each component will have a respective amplitude. Taken together, the n amplitudes for the given time interval represent an n-component vector in the n-dimensional space. Based on a known sample text uttered during a training period, the n-dimensional space is divided into a fixed number of regions by some clustering algorithm. Each region represents sounds of a common prescribed type; sounds having component values which are within regional bounds. For each region, a prototype vector is defined to represent the region. The prototype vectors are defined and stored for later processing. When an unknown speech input is uttered, for each time interval, a value is measured or computed for each of the n components, where each component is referred to as a feature. The values of all of the features are consolidated to form an n-component feature vector for a time interval. In some instances, the feature vectors are used in subsequent processing. In other instances, each feature vector is associated with one of the predefined prototype vector and the associated prototype vectors are used in subsequent processing. In associating prototype vectors with feature vectors, the feature vector for each time interval is typically compared to each prototype vector. Based on a predefined closeness measure, the distance between the feature vector and each prototype vector is determined and the closest prototype vector is selected. A speech type of event, such as a word or a phoneme, is characterized by a sequence of feature vectors in the time period over which the speech event was produced. Some prior art accounts for temporal variations in the generation of feature vector sequences. These variations may result from differences in speech between speakers or for a single speaker speaking at different times. The temporal variations are addressed by a process referred to as time warping in which time periods are stretched or shrunk so that the time period of a feature vector sequence conforms to the time period of a reference prototype vector sequence, called a template. Oftentimes, the resultant feature vector sequence is styled as a "time normalized" feature vector sequence. Because feature vectors or prototype vectors (or representations thereof) associated with the feature vectors or both are used in subsequent speech processing, the proper characterization of the feature vectors and proper selection of the closest prototype vector for each feature vector is critical. The relationship between a feature vector and the prototype vectors has normally, in the past, been static; there has been a fixed set of prototype vectors and a feature vector based on the values of set features. However, due to ambient noise, signal drift, changes in the speech production of the talker, differences between talkers or a combination of these, signal traits may vary over time. That is, the acoustic traits of the training data from which the prototype vectors are derived may differ from the acoustic traits of the data from which the test or new feature vectors are derived. The fit of the prototype vectors to the new data traits is normally not as good as to the original training data. This affects the relationship between the prototype vectors and later-generated feature vectors, which results in a degradation of performance in the speech processor. Therefore, efforts have been made for speech normalization by adaptive vector mapping which are described in "Speaker Adaption Through Vector Quantization" , by K. Shikano et al.: ICASSP, Tokyo, April 1986, Vol. 4 of 4, pages 2643 - 2646. The basic idea in this paper is to find the correspondence between two vector quantized codebooks from different speakers. Once the correspondence between the codebooks is reasonably determined, the sophisticated normalization of spectra is possible. This correspondence is represented in the form of a substitution table or a mapped codebook. A substitution table is determined by finding a one-to-one correspondence between two codebooks. Once the substitution table is obtained, the used algorithm can be easily modified by inserting a substitution stage of vector numbers. A mapped codebook is obtained by a procedure that the maps vectors of input reference onto the vector space of a reference input speaker. The mapped codebook is represented as a linear combination of vectors of a reference input speaker. The used algorithm can also be easily applied by changing the distance matrix. The approach of the present invention is to provide apparatus and method for adapting feature vectors in order to account for noise and other ambient conditions as well as intra and inter speaker variations which cause the speech data traits from which feature vectors are derived to vary from the training data traits from which the prototypes are derived. In particular, each feature vector x i generated at a time interval i is transformed into a normalized vector y i according to the expression: y i = A i (x) where x is a set of one or more feature vectors at or before time interval i and where A i is an operator function which includes a number of parameters. According to the invention, the values of the parameters in the operator function are up-dated so that the vector y (at a time interval i) is more informative than the feature vector x (at a time interval i) with respect to the representation of the acoustic space characterized by an existing set of prototypes. That is, the transformed vectors y i more closely correlate to the training data upon which the prototype vectors are based than do the feature vectors x i . Generally, the invention includes transforming a feature vector x i to a normalized vector y i according to an operator function; determining the closest prototype vector for y i ; for altering the operator function in a manner which would move y i closer to the closest prototype thereto; and applying the altered operator function to the next feature vector in the transforming thereof to a normalized vector. Stated more specifically, the present invention provides that parameters of the operator function be first initialized. The operator function A₀ at the first time interval i=0 is defined with the initialized parameters and is applied to a first vector x ₀ to produce a transformed vector y ₀. For y ₀, the closest prototype vector is selected based on an objective closeness function D. The objective function D is in terms of the parameters used in the operator function. Optimizing the function D with respect to the various parameters (e.g., determining, with a "hill-climbing" approach, a value for each parameter at which the closeness function is maximum), up-dated values for the parameters are determined and incorporated into the operator function for the next time interval i=1. The adapted operator function A₁ is applied to the next feature vector x ₁ to produce a normalized vector y ₁. For the normalized vector y ₁, the closest prototype vector is selected. The objective function D is again optimized with respect to the various parameters to determine up-dated values for the parameters. The operator function A₂ is then defined in terms of the up-dated parameter values. With each successive feature vector, the operator function parameters are up-dated from the previous values thereof. In accordance with the invention, the following improved outputs are generated. One output corresponds to "normalized" vectors y i . Another output corresponds to respective prototype vectors (or label representations thereof) associated with the normalized vectors. When a speech processor receives continuously normalized vectors y i as input rather than the raw feature vectors x i , the degradation of performance is reduced. Similarly, for those speech processors which successive prototype vectors from a fixed set of prototype vectors and/or label representations as input, performance is improved when the input prototype vectors are selected based on the transformed vectors rather than raw feature vectors. The subject matter regarded as the invention is specified in the appended claims. The invention may best be understood by making reference to the following description and the accompanying figures. BRIEF DESCRIPTION OF THE DRAWINGS Fig. 1 is a general block diagram of a speech processing system. Fig. 2 is a general block diagram of a speech processing system with designated back ends. Fig. 3 is a drawing illustrating acoustic space partitioned into regions, where each region has a representative prototype included therein. Feature vectors are also shown, each being associated with a "closest" prototype vector. Fig. 4 is a drawing illustrating acoustic space partitioned into regions, where each region has a representative prototype included therein. Feature vectors are shown transformed according to the present invention into normalized vectors which are each associated with a "closest" prototype vector. Fig. 5 is a block diagram showing an acoustic processor which embodies the adaptive labeller of the present invention. Fig. 6 is a block diagram showing a specific embodiment of an adaptive labeller according to the present invention. Fig. 7 is a diagram of a distance calculator element of Fig. 6. Fig. 8 is a diagram of a minimum selector element of Fig. 6. Fig. 9 is a diagram of a derivative calculator element of Fig. 6. Fig. 10 is a flowchart generally illustrating the steps of adaptive labelling according to the present invention. Fig. 11 is a specific flowchart illustrating the steps of adaptive labelling according to the present invention. In Fig. 1, the general diagram for a speech processing system 100 is shown. An acoustic processor 102 receives as input an acoustic speech waveform and converts it into data which a back-end 104 processes for a prescribed purpose. Such purposes are suggested in Fig. 2. In Fig. 2, the acoustic processor 102 is shown generating output to three different elements. The first element is a speech coder 110. The speech coder 110 alters the form of the data exiting the acoustic processor 102 to provide a coded representation of speech data. The coded data can be transferred more rapidly and can be contained in less storage than the original uncoded data. The second element receiving input from the acoustic processor 102 is a speech synthesizer 112. In some environments, it is desired to enhance a spoken input by reducing noise which accompanies the speech signal. In such environments, a speech waveform is passed through an acoustic processor 102 and the data therefrom enters a speech synthesizer 112 which provides a speech output with less noise. The third element corresponds to a speech recognizer 114 which converts the output of the acoustic processor 102 into text format. That is, the output from the acoustic processor 102 is formed into a sequence of words which may be displayed on a screen, processed by a text editor, used in providing commands to machinery, stored for later use in a textual context, or used in some other text-related manner. Various examples of the three elements are found in the prior technology. In that the present invention is mainly involved with generating input to these various elements, further details are not provided. It is noted, however, that a preferred use of the invention is in conjunction with a "Speech Recognition System" invented by L. Bahl, S.V. DeGennaro, and R.L. Mercer for which a patent application was filed on March 27, 1986 (S.N. 06/845155). The earlier filed application is assigned to the IBM Corporation, the assignee of the present application, and is incorporated herein by reference to the extent necessary to provide background disclosure of a speech recognizer which may be employed with the present invention. At this point, it is noted that the present invention may be used with any speech processing element which receives as input either feature vectors or prototype vectors (or labels representative thereof) associated with feature vectors. By way of explanation, reference is made to Fig. 3. In Fig. 3, speech is represented by an acoustic space. The acoustic space has n dimensions and is partitioned into a plurality of regions (or clusters) by any of various known techniques referred to as "clustering". In the present embodiment, acoustic space is divided into 200 non-overlapping clusters which are preferably Voronoi regions. Fig. 3 is a two-dimensional representation of part of the acoustic space. For each region in the acoustic space, there is defined a respective, representative n-component prototype vector. In Fig. 3, four of the 200 prototype vectors P ₃, P ₁₁, P ₁₄, and P ₅₆ are illustrated. Each prototype represents a region which, in turn, may be viewed as a "sound type." Each region, it is noted, contains vector points for which the n components --when taken together-- are somewhat similar. In a first embodiment, the n components correspond to energy amplitudes in n distinct frequency hands. The points in a region represent sounds in which the n frequency band amplitudes are collectively within regional bounds. Alternatively, in an earlier filed European patent application 85 111 905.7 assigned to the IBM Corporation, the n components are based on a model of the human ear. That is, a neural firing rate in the ear is determined for each of n frequency bands; the n neural firing rates serving as the n components which define the acoustic space, the prototype vectors, and feature vectors used in speech recognition. The sound types in this case are defined based on the n neural firing rates, the points in a given region having somewhat similar neural firing rates in the n frequency bands. Referring still to Fig. 3, five feature vectors at respective successive time intervals i=1, i=2, i=3, i=4, and i=5 are shown as x ₁, x ₂, x ₃, x ₄, and x ₅, respectively. According to standard prior art methodology, each of the five identified feature vectors would be assigned to the Voronoi region corresponding to the prototype vector P ₁₁. The two selectable outputs for a prior art acoustic processor would be (1) the feature vectors x ₁, x ₂, x ₃, x ₄, and x ₅ themselves and (2) the prototypes associated therewith, namely P ₁₁, P ₁₁, P ₁₁, P ₁₁, P ₁₁, respectively. It is noted that each feature vector x ₁, x ₂, x ₃, x ₄, and x ₅ is displaced from the prototype vector by some considerable deviation distance; however the prior technology ignores the deviation distance. In Fig. 4, the effect underlying the present invention is illustrated. With each feature vector, at least part of the deviation distance is considered in generating more informative vector outputs for subsequent speech coding, speech synthesis, or speech recognition processing. Looking first at feature vector x ₁, a transformation is formed based on an operator function A₁ to produce a transformed normalized vector y ₁. The operator function is defined in terms of parameters which, at time interval i=1, are initialized so that y ₁ = x ₁ in the Fig. 4 embodiment; x ₁ and y ₁ are directed to the same point. It is observed that initialization may be set to occur at time interval i=0 or i=1 or at other time intervals depending on convention. In this regard, in Fig. 4 initialization occurs at time interval i=1; in other parts of the description herein initialization occurs at time interval i=0. Based on a predefined objective function, an error vector E ₁ is determined. In Fig. 4, E ₁ is the difference vector of projected movement of y ₁ in the direction of the closest prototype thereto. (The meaning of "closeness" is discussed hereinbelow.) E ₁ may be viewed as a determined error vector for the normalized vector y ₁ at time interval i=1. Turning next to feature vector x ₂, it is noted that y ₂ is determined by simply vectorally adding the E ₁ error vector to feature vector x ₂. A projected distance vector of movement of y ₂ toward the prototype associated therewith (in this case prototype P ₁₁) is then computed according to a predefined objective function. The result of adding (1) the computed projected distance vector from y ₂ onto (2) the error vector E ₁ (extending from the feature vector x ₂) is an error vector E ₂ for time interval i=2. The error vector E ₂ is shown in Fig. 4 by a dashed line arrow. Turning next to feature vector x ₃, the accumulated error vector E ₂ is shown being added to vector x ₃ in order to derive the normalized vector y ₃. Significantly, it is observed that y ₃ is in the region represented by the prototype P ₃. A projected move of y ₃ toward the prototype associated therewith is computed based on an objective function. The result of adding (1) the computed projected distance vector from y ₃ onto (2) the error vector E ₂ (extending from the feature vector x ₃) is a next error vector E ₃ for time interval i=3. The error vector E ₃ in effect builds from the projected errors of previous feature vectors. Referring still to Fig. 4, it is observed that error vector E ₃ is added to feature vector x ₄ to provide a transformed normalized vector y ₄, which is projected a distance toward the prototype associated therewith. y ₄ is in the region corresponding to prototype P ₃; the projected move is thus toward prototype vector P ₃ by a distance computed according to an objective function. Error vector E ₄ is generated and is applied to feature vector x ₅ to yield y ₅. y ₅ is in the region corresponding to prototype vector P ₅₆; the projected move of y ₅ is thus toward that prototype vector. In Fig. 4, each feature vector x i is transformed into a normalized vector y i . It is the normalized vectors which serve as one output of the acoustic processor 102, namely y ₁ y ₂ y ₃ y ₄ y ₅. Each normalized vector, in turn, has an associated prototype vector. A second output of the acoustic processor 102 is the associated prototype vector for each normalized vector. In the Fig. 4 example, this second type of output would include the prototype vector string P ₁₁ P ₁₁ P ₃ P ₃ P ₅₆. Alternatively, assigning each prototype a label (or "feneme") which identifies each prototype vector by a respective number, the second output may be represented by a string such as 11,11,3,3,56 rather than the vectors themselves. In Fig. 5, an acoustic processor 200 which embodies the present invention is illustrated. A speech input enters a microphone 202, such as a Crown PZM microphone. The output from the microphone 202 passes through a pre-amplifier 204, such as a Studio Consultants Inc. pre-amplifier, enroute to a filter 206 which operates in the 200 Hz to 8 KHz range. (Precision Filters markets a filter and amplifier which may be used for elements 206 and 208.) The filtered output is amplified in amplifier 208 before being digitized in an A/D convertor 210. The convertor 210 is a 12-bit, 100 kHz analog-to-digital convertor. The digitized output passes through a Fast Fourier Transform FFT/Filter Bank Stage 212 (which is preferably an IBM 3081 Processor). The FFT/Filter Bank Stage 212 separates the digitized output of the A/D convertor 210 according to frequency bands. That is, for a given time interval, a value is measured or computed for each frequency band based on a predefined characteristic (e.g., the neural firing rate mentioned hereinabove). The value for each of the frequency bands represents one component of a point in the acoustic space. For 20 frequency bands, the acoustic space has n=20 dimensions and each point has 20 components. During a training period in which known sounds are uttered, the characteristic(s) for each frequency band is measured or computed at successive time intervals. Based on the points generated during the training period, in response to known speech inputs, acoustic space is divided into regions. Each region is represented by a prototype vector. In the present discussion, a prototype vector is preferably defined as a fully specified probability distribution over the n-dimensional space of possible acoustic vectors. A clustering operator 214 (e.g., an IBM 3081 processor) determines how the regions are to be defined, based on the training data. The prototype vectors which represent the regions, or clusters, are stored in a memory 216. The memory 216 stores the components of each prototype vector and, preferably, stores a label (or feneme) which uniquely identifies the prototype vector. Preferably, the clustering operator 214 divides the acoustic space into 200 clusters, so that there are 200 prototype vectors which are defined based on the training data. Clustering and storing respective prototypes for the clusters are discussed in prior technology. During the training period, the FFT/Filter Bank Stage 212 provides data used in clustering and forming prototypes. After the training period, the FFT/Filter Bank Stage 212 provides its output to an adaptive labeller 218 (which preferably comprises an IBM 3081 processor). After the training period and the prototypes are defined and stored, unknown speech inputs (i.e., an unknown acoustic waveform) are uttered into the microphone 202 for processing. The FFT/Filter Bank Stage 212 produces an output for each successive time interval (i=1,2,3,...), the output having a value for each of the n=20 frequency bands. The 20 values, taken together, represent a feature vector. The feature vectors enter the adaptive labeller 218 as a string of input feature vectors. The other input to the adaptive labeller 218 is from the prototype memory 216. The adaptive labeller 218, in response to an input feature vector, provides as output: (1) a normalized output vector and (2) a label corresponding to the prototype vector associated with a normalized output vector. At each successive time interval, a respective normalized output vector and a corresponding label (or feneme) is output from the adaptive labeller 218. Fig. 6 is a diagram illustrating a specific embodiment of an adaptive labeller 300 (see labeller 218 of Fig. 5). The input feature vectors x i are shown entering a counter 302. The counter 302 increments with each time interval starting with i=0. At i=0, initial parameters are provided by memory 304 through switch 306 to a parameter storage memory 308. The input feature vector x ₀ enters an FIR filter 310 together with the stored parameter values. The FIR filter 310 applies the operator function A₀ to the input feature vector x ₀ as discussed hereinabove. (A preferred operator function is outlined in the description hereinbelow.) The normalized output vector y ₀ from the FIR filter 310 serves as an output of the adaptive labeller 300 and also as an input to distance calculator 312 of the labeller 300. The distance calculator 312 is also connected to the prototype memory (see Fig. 5). The distance calculator 312 computes the distance between each prototype vector and the normalized output vector y ₀. A minimum selector 314 associates the "closest" prototype vector with the normalized output vector y ₀. The closest prototype --as identified by a respective label-- is output from the minimum selector 314 as the other output of the labeller 300. The minimum selector 314 also supplies the output therefrom to a derivative calculator 316. The derivative calculator 316 determines the rate of change of the distance calculator equation with respect to parameters included in the operator function. By hill-climbing, the respective values for each parameter which tend to minimize the distance (and hence maximize the closeness of the normalized output vector y ₀ and the prototype associated therewith) are computed. The resultant values, which are referred to as up-dated parameter values, are generated by a first-order FIR filter 318, the output from which is directed to switch 306. At the next time interval, i > 0. The up-dated parameter values enter the memory 308. With the entry of the input feature vector x ₁, the up-dated parameter values from memory 308 are incorporated into the operator function implemented by the FIR filter 310 to generate a normalized output vector y ₁. y ₁ exits the labeller 300 as the output vector following y ₀ and also enters the distance calculator 312. An associated prototype is selected by the minimum selector 314; the label therefor is provided as the next prototype output from the labeller 300. The parameters are again up-dated by means of the derivative calculator 316 and the filter 318. Referring to Fig. 7, a specific embodiment of the distance calculator 312 is shown to include an adder 400 for subtracting the value of one frequency band of a given prototype vector from the normalized value of the same band of the output vector. In similar fashion, a difference value is determined for each band. Each resulting difference is supplied to a squarer element 402. The output of the squarer element 402 enters an accumulator 404. The accumulator 404 sums the difference values for all bands. The output from the accumulator 404 enters the minimum selector 314. Fig. 8 shows a specific minimum selector formed of a comparator 410 which compares the current minimum distance against the current computed distance for a prototype vector P k . If d j < d k , j=k; otherwise j retains its value. After all distance computations are processed by the comparator 410, the last value for j represents the (label) prototype output. Fig. 9 shows a specific embodiment for the derivative calculator which includes an adder 420 followed by a multiplier 422. The adder 420 subtracts the associated prototype from the normalized output vector; the difference is multiplied in the multiplier 422 by another value (described in further detail with regard to Fig.11). Fig. 10 is a general flow diagram of a process 500 performed by the adaptive labeller 300. Normalization parameters are initialized in step 502. Input speech is converted into input feature vectors in step 504. The input feature vectors x i are transformed in step 506 into normalized vectors y i which replace the input feature vectors in subsequent speech processing. The normalized vectors provide one output of the process 500. The closest prototype for each normalized vector is found in step 508 and the label therefor is provided as a second output of the process 500. In step 510, a calculation is made to determine the closest distance derivative with respect to each normalization parameter. In step 512, the normalization parameters are up-dated and incorporated into the operator function A i . Fig. 11 further specifies the steps of Fig. 10. For the first time interval i=0, parameters A(k,ℓ)) and B(ℓ) of function A i are given initial values in initialization step 602. The time interval is incremented in step 603 and values for parameters A(k,ℓ) and B(ℓ) are stored as a i (k,ℓ) and b(ℓ), respectively, in step 604. The input feature vector corresponding to the current time interval i enters normalization step 606. The normalization step 606, in the Fig. 11 embodiment, involves a linear operator A i function of the form Ax+B where A and B are parameter representations and x is a set of one or more recent input feature vectors occurring at or before time interval i. In Fig. 11, each component of the vector is affected by a set of A parameter values and one corresponding B value. In performing the transformation y i = A i (x) based on the A(k,ℓ) and B (ℓ) parameters, the index ℓ in Fig. 11 corresponds to a vector component. The index k identifies the kth recent vector x i-k . That is, if k=0, the current vector is identified; if k=1, the most recent previous vector is identified; and so on. The expression A(k,ℓ) thus corresponds to the ℓth component of the kth vector. The operator function is completely defined by the (K+1)(N+1) parameters --see steps 606 and 608-- of the form a(k,ℓ) and b(ℓ). The result of step 606 is a normalized output vector y i which is more informative than the input feature vector x i corresponding thereto. In step 607, prototype vectors P j are supplied from storage to provide input to a distance calculation step 608. In step 608, the difference between the ℓth component of the normalized vector and the ℓth component of the jth prototype vector is determined for each of the N components; the squares of the differences being added to provide a distance measure for the jth prototype vector. Step 608 is repeated for each prototype vector P j (j = 1, ..., m). In step 609, the prototype vector having the smallest computed distance is selected as the prototype associated with the normalized output vector. The prototype vector in the form of (a) its components or (b) a label (or feneme) identifying the prototype vector is provided as an output j i . In step 610, derivatives (or more precisely gradients) are calculated for the distance equation in step 608 with respect to each parameter a i (k,ℓ) and b i (ℓ) for the closest prototype. An up-dated value for each parameter is then computed as: for one parameter or for the other parameter. The ▿ operator corresponds to the derivative (i.e., gradient) function of step 610. The c₁ and c₂ values are constants which are preferably determined during the training period and are preferably fixed. Alternatively, however, the c values may be tailored to a particular speaker as desired. Moreover, if the well-known Hessian approach is used in the "hill-climbing" to provide a maximum closeness (or minimum distance value) with respect to each parameter, the c values are readily modified. A series of experiments were conducted using loud and soft voices as well as environments in which the microphone-speaker distance was varied to produce gain variations. Employing standard labelling in four such experiments resulted in decoding error rates of 9%, 25%, 20%, and 18%, respectively. By applying the adaptive labelling approach of the present invention under the same four experimental conditions, error rates of 4%, 1.5%, 7%, and 3% were achieved. An average improvement of 80% in error rate and a reduction in decoding time by an average of 30% resulted from use of the present invention. While the invention has been described with reference to a preferred embodiment thereof, it will be understood by those skilled in the art that various changes in form and details may be made without departing from the scope of the invention. For example, the described embodiment is deterministic in nature. That is, a point (or vector) is transformed to another point (or vector) through adaptive normalization. The invention, however, also contemplates a probabilistic embodiment in which each prototype --rather than identifying a vector-- corresponds to a probabilistic finite state machine PFSM (or Markov model). In the probabilistic embodiment, the closeness measure is based on the average likelihood over all states in the PFSM or, alternatively, is the likelihood of the final state probability. At time interval i=0, each PFSM is initialized. With each frame, the likelihoods at each state in each PFSM are up-dated. The sum of closeness measures for all PFSMs serves as the objective function. This sum is used in place of the distance measure employed in the deterministic embodiment. In addition, the components of the feature vectors (and prototype vectors) may alternatively correspond to well-known (1) Cepstral coefficients, (2) linear predictive coding coefficients, or (3) frequency band-related characteristics. Also, the present invention contemplates an operator function in which not only the parameters are up-dated but the form of the operator function is also adapted. By way of example, there may be a collection of operator expressions --one for each prototype. The effect of each operator expression may be weighted based on the distance computed for the prototype corresponding thereto. The composite of the combined weighted operator expressions then represents the operator function. It is further noted that "closeness" preferably refers to the prototype of the defined set which is most probable according to the conditional probability p(i|x) in a mixture model for the distribution f(x) of the feature vector Thus p(j|x) = p j f j /f(x) where P j is the marginal prototype of the jth prototype. The distributions (or prototypes) f j (x) are conditional probability densities for x given the label j. In the case of equally likely Gaussian densities with a common scale, the most probable prototype is simply the one with a mean vector µ j which is closest to x in the sense of Euclidean distance: However, other definitions of "closeness" (which may be found in the prior technology) may also be employed.

Claims: A speech processing method in which acoustic space is partitioned into clusters with each cluster having a representative prototype vector stored therefor and in which an interval of speech is represented by a feature vector X i in the space, where i corresponds to a respective interval of speech, comprising transforming X i into a vector Y i closer to the prototype vectors, characterised by (a) said transforming being defined by Y i = A i (x) where A i is an operator function specified in terms of a number of parameters wherein each parameter has a stored value subject to updating at successive time intervals and where x designates a number of feature vectors, at or before time interval i; and by (b) selecting the prototype vector closest to the transformed vector Y i : by means of a distance measure; (c) altering the operator function in a manner which reduces the distance between the transformed vector Y i and the closest prototype selected therefor ; and (d) applying the altered operator function at the next time interval in order to yield a transformed vector for said next feature record. The method of Claim 1 characterised by the further step of: (e) repeating steps (a) through (d) for successive time intervals. The method of Claim 2 characterised by the further steps of: (f) providing the transformed vectors at successive time intervals as an output string which is input to the back end of a speech processor. The method of Claim 2 characterised by the further steps of: (g) providing the selected prototype vectors at successive time intervals as an output string which is input to the back end of a speech processor. The method of Claim 2 characterised in that the step of transforming the feature vector includes the steps of: (h) applying a linear operator function to the feature vector. The method of Claim 5 characterised in that step (h) includes the step of: (j) computing each component of the transformed vector according to the expression: wherein the index l identifies the component of the transformed vector the value of which is being computed and the index k identifies the kth recent input feature vector. The method of Claim 6 characterised in that step (j) includes the steps of: (k) computing a distance measure of closeness between y i and each prototype vector P j as: (l) determining a respective rate of change relationship for the distance measure relative to each parameter; (m) for each respective rate of change relationship, computing the parameter value which yields the minimum distance; and (n) up-dating the operator function with the parameter value computed in step (m). A speech processing apparatus in which acoustic space is partitioned into clusters with each cluster having a representative prototype vector stored therefor and in which an interval of speech is represented by a feature vector X i in the space, where i corresponds to a respective interval of speech, comprising (a) First filter means (310) for transforming X i into a vector Y i closer to the prototype vectors, defined by Y i = A i (x) where A i is an operator function specified in terms of a number of parameters wherein each parameter has a stored value subject to updating at successive time intervals and where x designates a number of feature vectors, at or before time interval i; (b) calculator means (312, 314) for selecting the prototype vector closest to the transformed vector Y i by means of a distance measure; (c) second filter means (318) for altering the operator function in a manner which reduces the distance between the transformed vector Y i and the closest prototype selected therefor ; and (d) means (302, 306) for applying the altered operator function at the next time interval in order to yield a transformed vector for said next future record. Apparatus as in Claim 8 further characterised by: (e) means for outputting successive transformed vectors which are generated by said first filter means. Apparatus as in Claim 9 further characterised by: (f) means for outputting, for each successive transformed vector, the closest prototype thereto, in order to provide a string of prototypes as output. Apparatus as in Claim 8 further characterised by: (g) means for outputting, for each successive transformed vector, the closest prototype thereto, to provide a string of prototypes as output. Apparatus as in Claim 8 characterised in that said calculator means includes: (h) distance calculator means for determining the respective distance between a transformed vector and each prototype vector according to a distance measure relationship in terms of operator function parameters; (j) minimum selector means, which receives as input distance calculations from said distance calculator means, for selecting the prototype which is closest to a transformed vector; and (k) derivative calculator means for deriving the respective gradient of the distance measure relationship relative to each operator function parameter. A speech processing method in which speech is represented by a fixed set of prototypes stored in an acoustic processor, wherein each prototype corresponds to the set of n probability distributions of a Markov model defined during a training period, comprising (a) generating one feature element x i after another at successive time intervals i by an acoustic processor, wherein each feature element corresponds to a set of n probability distributions generated in response to an unknown speech input uttered ouside the training period, comprising transforming x i into a vector y i closer to the prototypes, (b) applying an operator function A i to the feature element x i to yield the transformed output y i , wherein the operator function is specified in terms of a number of parameters whose stored values are subject to updating at successive time intervals; (c) computing the closeness of the transformed output y i to each prototype P j based on a prescribed closeness relationship; (d) computing the rate of change of the closeness relationship relative to each of at least some operator function parameters; (e) up-dating the current value of each parameter in the operator function to a value which increases the closeness between the transformed output yi and the closest prototype thereto;and (f) applying the operator function with up-dated current values to a next feature vector where i is incremented by 1 in order to yield a transformed output therefor. The method of claim 13 characterized by the further step of: (g) repeating steps (b) through (f) for successive feature vectors at successive time intervals.

Inventors: NADAS, ARTHUR JOSEPH, NAHAMOO, DAVID
Applicants: INTERNATIONAL BUSINESS MACHINES CORPORATION
Application year: 1988
Main classification: G10L5
IPC codes: G10L15, G10L21, G10L19, G10L11