Abstract:
A method for predicting a misrecognition in a speech recognition system, is based on; the insight that variations in a speech input signal are different depending on the origin of the signal being a speech or a non-speech event. The method comprises steps for receiving a speech input signal, extracting at least one signal variation feature of the speech input signal, and applying a signal variation meter to the speech input signal for deriving a signal variation measure.

Description:
BACKGROUND OF THE INVENTION 
     In speech recognition systems articulated sounds or utterances, respectively, are converted in written language by interpreting a respective speech signal. Misinterpretations which are usually referred to as recognition errors frequently occur with state-of-the-art speech recognition systems when used in a noisy environment. Ambient noise superimposing an input speech signal either modifies the characteristic of the input signal or may mistakenly be interpreted as a phoneme by a speech recogniser. 
     In order to detect if misrecognitions occur, so called confidence measures are used. A confidence measure judges the reliability with which a word or sub-word corresponds to a particular part of a signal. The word or sub-word is then accepted or rejected by the recognition process on the base of the confidence measure calculated for it. 
     As many different expressions sound very similar, there are often several alternatives possible for interpreting a certain utterance. To decide for one in particular, a confidence measure is e.g. calculated as the likelihood with which a certain expression corresponds to a respective utterance. This is usually accomplished by some form of special statistical hypothesis testing. These processes are usually very complicated, particularly as a phoneme can undergo certain acoustic variations under the influence of neighbouring phonemes, an effect which is known as coarticulation. 
     But also non-speech events, like the above mentioned ambient noise superimposing a speech signal result in an acoustic variation of the speech signal. A correct identification of the word or sub-word being the speech signal&#39;s written equivalent is therefore an elaborate task which is yet not been brought to a satisfactory solution. 
     It is therefore an object of the present invention to propose a system for improving the detection of recognition errors in a speech recognition system. 
     SUMMARY OF THE INVENTION 
     The above object is achieved by the invention as defined in the independent claims. 
     The characteristic features of a speech signal are quite different to those of a non-speech signal like e.g. ambient noise or noise bursts. In contrast to a non-speech signal, the quasi-periodic behaviour of a speech signal results in comparatively small signal variation. A rapid change or considerable variation in normally steady parts of a speech input signal therefore most likely indicates the presence of a non-speech component. 
    
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
       Based on this insight, the above defined object is achieved by a method for predicting a misrecognition in a speech recognition system with steps for receiving a speech input signal, extracting at least one signal variation feature of the speech input signal, and applying a signal variation meter to the speech input signal for deriving a signal variation measure. 
     
    
    
     DETAILED DESCRIPTION OF THE INVENTION 
     The above object is further achieved by a Computer-software-product for defining a confidence measure for a recognition hypothesis concerning a speech input signal in a speech recognition system. The computer-software-product comprises hereto a series of state elements which are adapted to be processed by a data processing means such, that a method according the present invention may be executed thereon to form a confidence measure evaluation system. 
     Additional advantageous features of the present invention are claimed in the respective sub-claims. 
     The signal variation meter is advantageously applied to a sub-word of the speech input signal, particularly to a frame, a state or a phoneme as described below. According to an advantageous development, the signal variation measures derived for two or more sub-words of the speech input signal are combined to form a confidence measure. Hereby, the combination of the signal variation measures derived for two or more sub-words of a speech input signal may preferably be based on an arithmetic mean, geometric mean, maximum value, minimum value or on a dispersion measure, whereby the dispersion measure is formed by a range, standard deviation or relative dispersion. 
     The signal variation meter is effectively based on a Unique State Ratio, Same State Ratio, Unique State Entropy, Average Spectral Variation, Spectral Mismatch Distance or State Length One Ratio evaluation or a combination of two or more of these. 
     According to a further advantageous embodiment of the present invention, the extraction of the signal variation is based on a spectral feature derived from the speech input signal, whereby the extraction of the signal variation may suitably be based on a phoneme alignment of a Hidden Markov Model based speech recognition hypothesis. 
     In the following, the present invention will be explained in detail and by way of example only, with reference to the attached Figures, wherein 
       FIG. 1  shows a speech input signal with an indication of several subdivisions as for example used to derive a signal variation measure, and 
       FIG. 2  shows a system for determining a confidence measure with a signal variation metering according to the present invention. 
     The diagram  1  of  FIG. 1  shows part of a speech input signal  2  in an amplitude versus time representation. The speech input signal  2  is divided into several phonemes  3 ,  3 ′ and  3 ″ which are separated from each other by phoneme boundaries  4  and  4 ′. A phoneme is a sound characterised as the minimal word distinguishing signal like e.g. a b in contrast to a p. It may already represent a sub-word like for instance a syllable but usually it is a smaller word component. The term sub-word is used within this specification without any restriction and to indicate that only a part of a word in its acoustical or written representation is referred to. 
     For the speech recognition process, each phoneme is subdivided into so called states  5   1 ,  5   2 ,  5   3 , and  5 ′ 1 ,  5 ′ 2 ,  5 ′ 3  etc., and each state is further subdivided into the smallest analysing unit called frame  6  or  6 ′, respectively. The recognition process looks for matches of a recorded signal form to the input signal within a state  5   2 . Usually, there will be no exact match which means that the recorded signal form will deviate from the speech input signal  2  in one or more frames  6  of a respective state  5   2 . Different recorded signals forms are therefore compared to the input signal  2  within a state  5   2  of interest, and the matching is controlled on the basis of the frames  6  present in that state  5   2 . Different recorded signal forms are therefore likely to form the respective best match in different frames  6  of a state  5   2 . This is indicated in  FIG. 1  where each recorded signal form is referenced by an identification number  7 . While the recorded signal form number ‘ 17 ’ produces a good match in the first, fourth and last frame  6  of state  5   2 , the recorded signal form number ‘ 5 ’ fits best in the second, third and fifth frame. The third last frame is found to match with the recorded signal form number ‘ 20 ’, and the last but one frame with number ‘ 21 ’. 
     The described deviation of the speech input signal  2  from a recorded signal within the level of a state unit  5   2  is mostly caused by non-speech events like e.g. background noise insertions or changes in the mood of the person talking. A match will therefore seldom be perfect but rather tainted with a certain variation or uncertainty. Even for the best match there remains a certain probability for it being wrong. 
     To improve the accuracy of a confidence measure system the present invention introduces a characterisation of the reliability of each detected match. For the characterisation a hypothesis is derived for assessing the reliability of each match found. The hypothesis forms a statement about a certain match being probably right or wrong. It usually takes on the form of a numerical value for an easy further processing by a speech recognition system. The value of the hypothesis corresponds to a judgement which may be expressed in colloquial terms as e.g. very certain, certain, possibly certain, perhaps certain, more or less unlikely, completely unlikely or something like that. 
     According to the present invention a hypothesis is generated by utilising signal variation meters which consider the speech signal variations down to a frame  6  level. A signal variation meter as it is understood in the context of this specification uses the matching results for each frame  6  in a state  5   2  to extracts signal variation features from the speech input signal  2  so as to ascertain a value characterising the best match regarding the signal component originating from a speech event only. A respective signal variation meter is preferably used within a confidence measure evaluation unit of a speech recognition system. 
     The following signal variation meters, which are explained in detail below are proposed to generate a hypothesis according to the previously explained: Unique State Ratio (USR), Same State Ratio (SSR), Unique State Entropy (USE), Average Spectral Variation (ASV), Spectral Mismatch Distance (SMD), and State Length One Ratio (SLOR). 
     Unique State Ratio: For each frame  6  in a state  52 , the identity  7  of the recorded signal form which matches the speech input signal  2  therein best, i.e. the best frame match, is identified. Next, the number of different best frame matches for a state  52  is counted and divided by the number of frames  6  present within said state  52 . An example can be given with reference to  FIG. 1 . The state  520  of the first phoneme  3  is composed of eight frames  6 . The best frame matches differ from frame to frame with a total of four different identities, namely ‘ 17 ’, ‘ 5 ’, ‘ 20 ’, and ‘ 21 ’. As there are altogether eight frames  6  present in state  52 , its USR is computed to 0.5. 
     Same State Ratio: Like before, first the best frame matches are identified for each frame  6  within a state  5   2 . Next, the number of frames having the same best frame match are determined. The highest count is then divided by the number of frames  6  present in the respective state  5   2 . In the example illustrated in  FIG. 1 , the best frame matches ‘ 17 ’ and ‘ 5 ’ are each identified for three different frames respectively. The other two, ‘ 20 ’ and ‘ 21 ’ each only for one frame  6 . The highest count therefore amounts to three, resulting in an SSR=0.375. 
     The Unique State Entropy is defined as: 
                     USE   =       -       ∑   s   Ns     ⁢     (         c   ⁡     (   s   )       N     ·     log   ⁡     (       c   ⁡     (   s   )       N     )         )           log   ⁡     (   Ns   )           ,           (   1   )               
wherein N s  denotes the total number of different recorded signal forms in a state as e.g.  5   2 , N the number of frames  6 ,  6 ′ within the state (e.g.  5   2 ), c(s) the count of frames for a respective recorded signal form in the state (e.g.  5   2 ), and ‘s’ is the identification number of a recorded signal form. In the example of  FIG. 1 , four different recorded signal forms were used to match state  5   2 , namely the signal forms with the identification numbers  7  of ‘ 17 ’, ‘ 5 ’, ‘ 20 ’, and ‘ 21 ’. Hence N s =4, the total number of frames (N) constituting state  5   2  is 8, and c( 17 )=3, c( 5 )=3, c( 20 )=1, c( 21 )=1. If the calculation is performed on the basis of one recorded signal form only in one state, eg., i.e. N=1, a division-by-zero problem arises, which is handled by setting the value for USE to 0 for this case.
 
     The Average Spectral Variation between two adjacent frames  6  in a state  5   2  represents a sort of audio content analysis based on a spectral flux determination. It is defined by: 
                         ASV   =       ⁢       1       N   coef     ·     (       W   sw     -   1     )         ⁢       ∑     n   =     bf   sw         ef   sw       ⁢       ∑     k   =   1       N   coef       ⁢     [       log   ⁡     (              F   n     ⁡     (   k   )            +   1     )       -                                 ⁢     log   ⁡     (              F     n   -   1       ⁡     (   k   )            +   1     )       ]     2     ;                 (   2   )               
Herein n signifies the frame index in the state  5   2  unit sw; Its lower value is the begin frame bf sw  and its upper value is the end frame ef sw  of the respective state unit sw. W sw  denotes the number of frames within said state  5   2 , N coef  the total number of the spectral coefficients, and |F n (k)| the amplitude spectrum of the n th  frame corresponding to the k th  spectral coefficient.
 
     Instead of an amplitude spectrum like in the example given, other spectral vectors such as a Mel Frequency Cepstrum Coefficient (MFCC) may be used for the spectral representation. 
     Spectral Mismatch Distance: The amount of mismatch between a hypothesis for the best match formed by a recorded signal form and the speech input signal  2  in a respective state  5   2 , is preferably determined by a distance meter. By e.g. using the average Euclidean distance, the Spectral Mismatch Distance between the best Gaussian frame match μ(k) of the hypothesis and the spectral vectors in the state  5   2  unit sw is 
     
       
         
           
             
               
                 
                   SMD 
                   = 
                   
                     
                       1 
                       
                         W 
                         sw 
                       
                     
                     ⁢ 
                     
                       
                         ∑ 
                         
                           n 
                           = 
                           
                             bf 
                             sw 
                           
                         
                         
                           ef 
                           sw 
                         
                       
                       ⁢ 
                       
                         
                           
                             ( 
                             
                               
                                 ∑ 
                                 
                                   k 
                                   = 
                                   1 
                                 
                                 
                                   N 
                                   coef 
                                 
                               
                               ⁢ 
                               
                                 
                                   ( 
                                   
                                     
                                       
                                         F 
                                         n 
                                       
                                       ⁡ 
                                       
                                         ( 
                                         k 
                                         ) 
                                       
                                     
                                     - 
                                     
                                       μ 
                                       ⁡ 
                                       
                                         ( 
                                         k 
                                         ) 
                                       
                                     
                                   
                                   ) 
                                 
                                 2 
                               
                             
                             ) 
                           
                           
                             1 
                             / 
                             2 
                           
                         
                         . 
                       
                     
                   
                 
               
               
                 
                   ( 
                   3 
                   ) 
                 
               
             
           
         
       
     
     Using the average Mahalanobis Distance, the SMD between the best Gaussian frame match of the hypothesis and the spectral vectors in the state  5   2  unit sw will become: 
                     SMD   =       1     W   sw       ⁢       ∑     n   =     bf   sw         ef   sw       ⁢       (       ∑     k   =   1       N   coef       ⁢         (         F   n     ⁡     (   k   )       -     μ   ⁡     (   k   )         )     2       σ   ⁡     (   k   )           )       1   /   2             ,           (   4   )               
which corresponds to a weighted Euclidian distance variance.
 
     Like mentioned before with reference to the Average Spectral Variation meter, other spectral vectors such as an MFCC can be used for the spectral representation. 
     The State Length One Ratio is given by the number of best frame matches in a state  5   2  which last for only one frame  6  divided by the number of frames N within said state  5   2 . In the example of  FIG. 1  only the sixth (with an identification number  7  of ‘ 20 ’) and the seventh frame (with an identification number  7  of ‘ 21 ’) of state  5   2  occur just once. Therefore two frames fulfil the condition, and with the total number of frames N within state  5   2  being 8, the State Length One Ratio amounts to 0.25. 
     All signal variation meters described up to now may be combined to derive a confidence measure for the speech input signal  2  to be recognised. The confidence metering may either be based on a state  5   2 -level or on a higher level. Particularly, when an utterance consist of more than one state  5   2 , the confidence measures obtained for subsequent states  5   2  may be advantageously combined to form a higher level confidence measure. The higher level may be a phoneme, a series of phonemes, a word or a complete utterance. The combination may be based on an arithmetic or geometric mean of a series of confidence measures calculated on a state  5   2 -level, but also on a maximum or minimum determination or a dispersion measure as e.g. a range, standard deviation, relative dispersion or the like. The dispersion measures are used to extract the statistical distribution of a state  5   2  unit signal variation measure in a word and/or utterance hypothesis. 
     A confidence score may be derived directly from one of the above described signal variation meters or a combination thereof, or by combining one or more signal variation meters with a state-of-the art classifier like a multilayer perceptron. 
     The application of a signal variation meter according to the present invention is described with reference to  FIG. 2 . The flowchart  20  illustrates the individual steps of a speech recognition process yielding a confidence score or measure, respectively, according to the present invention. Beginning with step S 1 , a speech input signal  2  is received. Step S 2  retrieves the spectral features from the speech input signal  2 . This may be an amplitude spectrum or any other spectral vector such as for instance a Mel Frequency Cepstrum Coefficient. The spectral features derived in step S 2  form the base for producing a recogniser hypothesis in step S 3 . The speech recogniser evaluating the hypothesis is based on a Hidden markov Model (HMM) 21. A phoneme alignment applied in step S 4  provides the best match information based on an identification of at least framewise matching recorded signal forms for a state  5   2 . In step S 5 , the results from the spectral feature analysis of step S 2  to S 4 , the recogniser hypothesis of step S 3 , and the phone alignment of step S 4  are merged by one or more of the above described signal variation meters to perform a signal variation feature extraction. Using results obtained in step S 2  to S 4 , the confidence Meter CM transforms in step S 6  the result of step S 5  into a confidence measure delivered as a confidence score in step S 7 . Although the usage of the results from S 2 , S 3 , and S 4  in step S 6  is not mandatory, it is preferred, since it improves the speech recognition significantly.