Patent Publication Number: US-8112274-B2

Title: Method of determining model-specific factors for pattern recognition, in particular for speech patterns

Description:
CROSS REFERENCE TO RELATED APPLICATIONS 
     This is a continuation of application Ser. No. 09/367,214, filed Aug. 10, 1999 now U.S. Pat. No. 6,456,969. 
    
    
     BACKGROUND OF THE INVENTION 
     The invention relates to a method for recognizing a pattern that comprises a set of physical stimuli, said method comprising the steps of:
         providing a set of training observations and through applying a plurality of association models ascertaining various measuring values p j (k|x), j=1 . . . M, that each pertain to assigning a particular training observation to one or more associated pattern classes;   setting up a log/linear association distribution by combining all association models of the plurality according to respective weight factors, and joining thereto a normalization quantity to produce a compound association distribution.       

     The invention has been conceived for speech recognition, but is likewise applicable to other recognition processes, such as for speech understanding, speech translation, as well as for recognizing handwriting, faces, scene recognition, and other environments. The association models may be probability models that give probability distributions for assigning patterns to classes. Other models can be based on fuzzy logic, or similarity measures, such as distances measured between target and class. Known technology has used different such models in a combined recognition attack, but the influences lent to the various cooperating models were determined in a haphazard manner. This meant that only few and/or only elementary models were feasible. 
     The present inventor has recognized that the unification of Maximum-Entropy and Discriminative Training principles would in case of combination of more than one model in principle be able to attain superior results as compared with earlier heuristic methods. Also, a straightforward data processing procedure should provide a cheap and fast road to those results. 
     In consequence, amongst other things, it is an object of the invention to evaluate a log-linear combination of various ‘sub’models p j (k|X) whilst executing parameter evaluation through discriminative training. Now, according to one of its aspects, the invention attains the object by recognizing a pattern that comprises a set of physical stimuli, said method comprising the steps of:
         providing a set of training observations and through applying a plurality of association models ascertaining various measuring values p j (k|x), j=1 . . . M, that each pertain to assigning a particular training observation to one or more associated pattern classes;   setting up a log/linear association distribution by combining all association models of the plurality according to respective weight factors, and joining thereto a normalization quantity to produce a compound association distribution;   optimizing said weight factors for thereby minimizing a detected error rate of the actual assigning to said compound distribution;   recognizing target observations representing a target pattern with the help of said compound distribution. Inter alia, such procedure allows to combine any number of models into a single maximum-entropy distribution. Furthermore, it allows an optimized interaction of models that may vary widely in character and representation.       

     The invention also relates to a method for modelling an association distribution according to the invention. This provides an excellent tool for subsequent users of the compound distribution for recognizing appropriate patterns. 
     The invention also relates to a method for recognizing patterns using a compound distribution produced by the invention. This method has users benefitting to a great deal by applying the tool realized by the invention. 
     The invention relates to a system that is arranged for practising a method according to the invention. Further aspects are recited in dependent Claims. 
    
    
     
       BRIEF DESCRIPTION OF THE DRAWING 
       These and other aspects and advantages of the invention will be discussed more in detail with reference to the detailed disclosure of preferred embodiments hereinafter, and in particular with reference to the appended Figures that show: 
         FIG. 1 , an overall flow chart of the method; and 
         FIG. 2 , a comprehensive system for practising the invention. 
     
    
    
     DETAILED DISCLOSURE OF PREFERRED EMBODIMENTS 
     The invention being based on a balanced application of mathematics on the handling and accommodating of physical quantities that may be of very diverse character, much of the disclosure is based on advanced mathematics. However, both the starting point and the eventual outcome have permanently physical aspects and relevance. The speech recognition may be used to control various types of machinery. Scene analysis may guide unmanned vehicles. Picture recognition may be used for gate control. Various other applications are evident per se. The expressions hereinafter are numbered in sequence, and will be referred to in the text by these numbers. 
     The invention determines model-specific factors in order to combine and optimize several different models into a single pattern recognition process, notably for speech recognition. 
     The statistical speech recognition method utilizes Bayes&#39; decision theory in order to form an identification mechanism with a minimum error rate. In conformity with this theory, the decision rule is such, that an observation x must be assigned to the class k (xεk for brevity), when for a given a posteriori or “real” probability distribution π(k|x) it holds that: 
     
       
         
           
             
               
                 
                   
                     
                       ∀ 
                       
                         k 
                         ′ 
                       
                     
                     = 
                     1 
                   
                   , 
                   … 
                   ⁢ 
                   
                       
                   
                   , 
                   
                     K 
                     ; 
                     
                       
                         
                           k 
                           ′ 
                         
                         ≠ 
                         
                           k 
                           : 
                           
                             
                               log 
                               ⁢ 
                               
                                   
                               
                               ⁢ 
                               
                                 
                                   π 
                                   ( 
                                   
                                     
                                       k 
                                       ⁢ 
                                       
                                          
                                         x 
                                       
                                     
                                     ) 
                                   
                                 
                                 
                                   π 
                                   ( 
                                   
                                     
                                       
                                         k 
                                         ′ 
                                       
                                       ⁢ 
                                       
                                          
                                         x 
                                       
                                     
                                     ) 
                                   
                                 
                               
                             
                             ≥ 
                             0 
                           
                         
                       
                       = 
                       
                         &gt; 
                         
                           x 
                           ⁢ 
                           
                               
                           
                           ⁢ 
                           ɛ 
                           ⁢ 
                           
                               
                           
                           ⁢ 
                           k 
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   1 
                   ) 
                 
               
             
           
         
       
     
     In literature, the term log(π(k|x)/π(k′|x)) is called the discriminant function. Hereinafter, this term will be noted g(x,k,k′) will be used for brevity. When the decision rule (1) is used for recognizing complete sentences, observed expressions x 1   T =(x 1 , . . . x T ), that have a temporal length T, will be classified as spoken word sequences w 1   S =(w 1 , . . . w S ) of length S. The a posteriori distribution π(w 1   S |x 1   T ) is however unknown since it describes the complicated natural speech communication process of humans. Consequently, it must be approximated by a distribution p(w 1   S |x 1   T ). Thus far, the acoustic-phonetic and grammatical modelling of speech in the form of parametric probability distributions have attained the best results. The form of the distribution p(w 1   S |x 1   T ) is then predetermined; the unknown parameters of the distribution are estimated on the basis of training data. The distribution p(w 1   S |x 1   T ) so acquired is subsequently inserted into Bayes&#39; decision rule. The expression x 1   T  is then assigned to the word sequence w 1   S  for which: 
                   ∀       w   1     ,     s   ′         ≠       w   1   s     :       log   ⁢           ⁢               ⁢       p   (       w   1   s     ⁢          x   1   T           )         p   (         w   1     ,     s   ′         ⁢          x   1   T         )           &gt;   0                 (   2   )               
Conversion of the discriminant function
 
                                     =     log   ⁢           ⁢       p   (         w   1   s     ⁢          x   1   T         )         p   (         w   1     ,     s   ′         ⁢          x   1   T         )                       g   ⁡     (       s   1   T     ,     w   1   s     ,     w   1     ,     s   ′           )                                           =     log   ⁢           ⁢         p   ⁡     (     w   1   s     )       ⁢   p   (         x   1   T     ⁢          w   1   s         )           p   ⁡     (     w   1     ,     s   ′         )       ⁢   p   (     x   1   T     ⁢          (     w   1     ,     s   ′         )               ,                 (   3   )               
allows to separate the grammatical model p(w 1   S ) from the acoustic-phonetic model p(x 1   T |w 1   S ) in a natural way. The grammatical model p(w 1   S ) then describes the probability of occurrence of the word sequence w 1   S  per se, and the acoustic-phonetic model p(x 1   T |w 1   S ) evaluates the probability of occurrence of the acoustic signal x 1   T  during the uttering of the word sequence w 1   S . Both models can then be estimated separately, so that an optimum use can be made of the relatively limited amount of training data. The decision rule (3) could be less than optimum due to a deviation of the distribution p from the unknown distribution π, even though the estimation of the distribution p was optimum. This fact motivates the use of so-called discriminative methods. Discriminative methods optimize the distribution p directly in respect of the error rate of the decision rule as measured empirically on training data. The simplest example of such discriminative optimization is the use of the so-called language model factor λ. The equation (3) is then modified as follows:
 
                     g   ⁡     (       x   1   T     ,     w   1   s     ,     w   1     ,     s   ′           )       =     log   ⁢           ⁢           p   ⁡     (     w   1   s     )       λ     ⁢     p   (         x   1   T     ⁢          w   1   s         )               p   ⁡     (     w   1     ,     s   ′         )       λ     ⁢           ⁢     p   (         x   1   T     ⁢          w   1     ,     s   ′             )                     (   4   )               
Experiments show that the error rate incurred by the decision rule (4) decreases when choosing λ&gt;1. The reason for this deviation from theory, wherein x=1, lies in the incomplete or incorrect modelling of the probability of the compound event (w 1   s , x 1   T ). The latter is inevitable, since the knowledge of the process generating the event (w 1 ,x 1   T ) is incomplete.
 
     Many acoustic-phonetic and grammatical language models have been analyzed thus far. The object of these analyses was to find the “best” model for the relevant recognition task out of the set of known or given models. All models determined in this manner are however imperfect representations of the real probability distribution, so that when these models are used for pattern recognition, such as speech recognition, incorrect recognitions occur as incorrect assignment to classes. 
     It is an object of the invention to provide a modelling, notably for speech, which approximates the real probability distribution more closely and which nevertheless can be carried out while applying only little processing effort, and in particular to allow easy integration of a higher number of known or given models into a single classifier mechanism. 
     SUMMARY OF THE INVENTION 
     The novel aspect of the approach is that it does not attempt to integrate known speech properties into a single acoustic-phonetic distribution model and into a single grammatical distribution model which would involve complex and difficult training. The various acoustic-phonetic and grammatical properties are now modeled separately and trained in the form of various distributions p j (w 1   S |x 1   T ), j=1 . . . M, followed by integration into a compound distribution 
                                     =       C   ⁡     (   Λ   )       ⁢       ·   ∏       j   =   1     M     ⁢           ⁢       p   j     (       (         w   1   s     ⁢          x   1   T         )     )       λ   j                         p     (   Λ   )     π     =       (       w   1   s     ⁢          x   1   T           )                                         =     exp   ⁢     {       log   ⁢           ⁢     C   ⁡     (   Λ   )         +       ∑     j   =   1     M     ⁢           ⁢       λ   j     ⁢   log   ⁢           ⁢       p   j     (         w   1   s     ⁢          x   1   T         )     }                             (   5   )               
The effect of the model p j  on the distribution p π   {Λ}  is determined by the associated coefficient λ j .
 
     The factor C( ^ ) ensures that the normalization condition for probabilities is satisfied. The free coefficients  ^ =(λ 1 , . . . λ M ) tr  are adjusted so that the error rate of the resultant discriminant function 
                     g   ⁡     (       x   1   T     ,     w   1   s     ,     w   1     ,     s   ′           )       =     log   ⁢           ⁢           ∏   M       j   =   1       ⁢       p   j     (       (         w   1   s     ⁢          x   1   T         )     )       λ   j                 ∏   M       j   =   1       ⁢       p   j     (       (         w   1     ,     s   ′         ⁢          x   1   T         )     )       λ   j                       (   6   )               
is as low as possible. There are various possibilities for implementing of this basic idea, several of which will be described in detail hereinafter.
 
     First of all, various terms used herein will be defined. Each word sequence w 1   S  forms a class k; the sequence length S may vary from one class to another. A speech utterance x 1   T  is considered as an observation x; its length T may then differ from one observation to another. 
     Training data is denoted by the references (x n , k), with n=1, . . . , N; k=0, . . . , K. Herein N is the number of acoustic training observations x n , and k n  is the correct class associated with the observation x n . Further, k≠k n  are the various incorrect rival classes that compete with respect to k n . 
     The classification of the observation x into the class k in conformity with Bayes&#39; decision rule (1) will be considered. The observation x is an acoustic realization of the class k. In the case of speech recognition, each class k symbolizes a sequence of words. However, the method can be applied more generally. 
     Because the class k n  produced by the training observation x n  is known, an ideal empirical distribution {circumflex over (π)}(k|x) can be constructed on the basis of the training data (x n , k); n=1 . . . N; k=0 . . . K. This distribution should be such that the decision rule derived therefrom has a minimum error rate when applied to the training data. In the case of classification of complete word sequences k, a classification error through selecting an erroneous word sequence k≠k n , may lead to several word errors. The number of word errors between the incorrect class k and the correct class k n  is called the Levenshtein distance E(k, k n ). The decision rule formed from E(k, k n ) has a minimum word error rate when a monotony property is satisfied. 
     The ideal empirical distribution {circumflex over (π)} is a function of the empirical error value E(k, k n ) which is given only for the training data, but is not defined with respect to unknown test data, because the correct class assignment is not given in that case. Therefore, on the basis of this distribution there is sought a distribution 
                     p   π     ⁢     {   Λ   }     ⁢     (         k   ⁢        x       )     =       exp   ⁢     {       ∑     j   =   1     M     ⁢           ⁢       λ   j     ⁢           ⁢   log   ⁢           ⁢       p   j     (       k   ⁢        x       )     }                 ∑       k   ′     =   1     K     ⁢           ⁢     exp   ⁢     {       ∑     j   =   1     M     ⁢           ⁢       λ   j     ⁢           ⁢   log   ⁢           ⁢       p   j     (         k   ′     ⁢        x       )     }                             (   7   )               
which is defined over arbitrary, independent test data and has an as low as possible empirical error rate on the training data. If the M predetermined distribution models p 1 (k|x), . . . , p M (k|x), are defined on arbitrary test data, the foregoing also holds for the distribution p π   {Λ} (k|x). When the freely selectable coefficients  ^ =(λ1, . . . λ M ) tr  (8) are determined in such a manner that p π   {Λ} (k|x) on the training data has a minimum error rate, and if the training data is representative, π {Λ} (k|x) should yield an optimum decision rule also on independent test data.
 
     The GPD method as well as the least mean square method optimize a criterion which approximates the mean error rate of the classifier. In comparison with the GPD method, the least mean square method offers the advantage that it yields a closed solution for the optimum coefficient  ^ . 
     The least mean square method will first be considered. Because the discriminant function (1) determines the quality of the classifier, the coefficients  ^  should minimize the root mean square deviation 
                 1       (     K   -   1     )     ⁢   N       ⁢       ∑     n   =   1     N     ⁢           ⁢       ∑     k   ≠     k   n         ⁢       (       log   ⁢           ⁢         p   ⩓     ⁢     (       k   ⁢          x   n         )             p   ⩓     ⁢     (       k   ⁢          x   n         )             -     E   ⁢     (       k   n     ,   k     )         )     2           =       1       (     K   -   1     )     ⁢   N       ⁢       ∑     n   =   1     N     ⁢           ⁢       ∑     k   ≠     k   n         ⁢       (         ∑   j     ⁢       λ   j     ⁢           ⁢   log   ⁢           ⁢         p   j     (       k   ⁢          x   n         )           p   j     (         k   n     ⁢          x   n         )             -     E   ⁢     (       k   n     ,   k     )         )     2                 
of the discriminant functions of the distributions p π   {Λ} (k|x) from the empirical error rate E(k, k n ). The summing over r then includes all rival classes in the criterion. Minimizing D ( ^ ) leads to a closed solution for the optimum coefficient vector Λ=Q −1 P (9), further detailed by
 
               Q     i   ,   j       =       1       (     K   -   1     )     ⁢           ⁢   N       ⁢       ∑     n   =   1     N     ⁢           ⁢       ∑     k   ≠     k   n         ⁢       {     log   ⁢           ⁢         p   i     (         k   n     ⁢          x   n         )           p   i     (       k   ⁢          x   n         )           }     ⁢     {     log   ⁢           ⁢         p   j     (         k   n     ⁢          x   n         )           p   j     (       k   ⁢          x   n         )           }                       and               P   i     =       1       (     K   -   1     )     ⁢   N       ⁢       ∑     n   =   1     N     ⁢           ⁢       ∑     k   ≠     k   n         ⁢           ⁢       E   ⁡     (       k   n     ,   k     )       ⁢     {     log   ⁢           ⁢         p   i     (         k   n     ⁢          x   n         )           p   i     (       k   ⁢          x   n         )           }                   
Herein, Q is the autocorrelation matrix of the discriminant functions of the predetermined distribution models. The vector P expresses the relationship between the discriminant functions of the predetermined models and the discriminant function of the distribution {circumflex over (π)}.
 
     The word error rate E(k, k n ) of the hypotheses k is thus linearly taken up in the coefficients λ 1 , . . . , λ M  Conversely, the discrimination capacity of the distribution model p i  is linearly included in the coefficients λ 1 , . . . , λ M  for determining the coefficients directly via the discriminant function log 
     
       
         
           
             log 
             ⁢ 
             
                 
             
             ⁢ 
             
               
                 
                   
                     p 
                     i 
                   
                   ( 
                   
                     
                       k 
                       ⁢ 
                       
                          
                         
                           x 
                           n 
                         
                       
                     
                     ) 
                   
                 
                 
                   
                     p 
                     i 
                   
                   ( 
                   
                     
                       
                         k 
                         n 
                       
                       ⁢ 
                       
                          
                         
                           x 
                           n 
                         
                       
                     
                     ) 
                   
                 
               
               . 
             
           
         
       
     
     Alternatively, these coefficients can be determined by using the GPD method. With this method, the smoothed empirical error rate E( ^ ): 
                     E   ⁡     (   Λ   )       =       1   N     ⁢       ∑     n   =   1     N     ⁢           ⁢     l   ⁡     (       x   n     ,     k   n     ,   Λ     )                   (   10   )                 l   ⁡     (       x   n     ,     k   n0     ,   Λ     )       =       (     1   +       A   ⁡     (       1   K     ⁢       ∑     r   =   1     K     ⁢           ⁢     exp   ⁢     {       -   η     ⁢           ⁢   log   ⁢           ⁢         p     {   Λ   }     π     (       k   n     ⁢          x   n     )             p     {   Λ   }     π     (     k   ⁢          x   n     )             }           )         -     B   η           )       -   1               (   11   )               
can be directly minimized for the training data. The left hand expression is then a smoothed measure for the error classification risk of the observation x n . The values A&gt;0, B&gt;0, η&gt;0 determine the type of smoothing of the error classification risk and should be suitably predetermined. When E(λ) is minimized in respect of the coefficient λ of the log linear combination, the following iteration equation with the step width M is obtained for the coefficients λ j , wherein j=1, . . . , M.
 
     λ j   (0) =1 (11), and furthermore according to 
                   y   nk     ⁡     (   ⩓   )       =       (         p   ⩓     (     k   ⁢          x   n     )             p   ⩓     (       k   n     ⁢          x   n     )           )       E   ⁡     (       k   n     ,   k     )           ,   and                   1       (     K   -   1     )     ⁢   N       ⁢       ∑     n   =   1     N     ⁢           ⁢       ∑     k   ≠     k   n         ⁢       (       log   ⁢           ⁢         p   ⩓     (     k   ⁢          x   n     )             p   ⩓     (       k   n     ⁢          x   n     )             -     E   ⁡     (       k   n     ,   k     )         )     2           =       1       (     K   -   1     )     ⁢   N       ⁢       ∑     n   =   1     N     ⁢           ⁢       ∑     k   ≠     k   n         ⁢       (         ∑   j     ⁢       λ   j     ⁢   log   ⁢           ⁢               ⁢       p   j     ⁢     (     k   ⁢          x   n     )                 p   j     (       k   n     ⁢          x   n     )               -     E   ⁢           ⁢     (       k   n     ,   k     )         )     2                             Λ     (   I   )       =       (       λ   1     (   I   )       ,   …   ⁢           ,     λ   M     (   I   )         )     tr       ;     j   =   1       ,   …   ⁢           ,   M         
It is to be noted that the coefficient vector  ^  is included in the criterion E( ^ ) by way of the discriminant function
 
                   log   ⁢           ⁢         p     {   Λ   }     π     (       k   n     ⁢          x   n     )             p     {   Λ   }     π     (     k   ⁢          x   n     )                   (   12   )               
If E( ^ ) decreases, the discriminant function (12) should increase on average because of (9) and (10). This results in a further improved decision rule, see (1).
 
     In the above, the aim has been to integrate all available knowledge sources into a single pattern recognition system. Two principles are united. The first is the maximum-entropy principle. This works by introducing as few assumptions as possible, so that uncertainty is maximized. Thus, exponential distributions must be used. In this manner the structure of the sources combination is defined. The second principle is discriminative training, to determine the weighting factors assigned to the various knowledge sources, and the associated models. Through optimizing the parameters, the errors are minimized. For speech, models may be semantic, syntactic, acoustic, and others. 
     The approach is the log-linear combining of various submodels and the estimating of parameters through discriminative training. In this manner, the adding of a submodel may improve the recognition score. If not, the model in question may be discarded. A submodel can however never decrease the recognition accuracy. In this manner, all available submodels may be combined to yield optimum results. Another application of the invention is to adapt an existing model combination to a new recognition environment. 
     The theoretical approach of the procedure includes various aspects:
         parabolic smoothing of the empirical error rate   simplifying the theory of “minimum error rate training”   providing a closed form solution that needs no iteration sequence.       

     The invention furthermore provides extra facilities:
         estimating an optimum language model factor   applying a log-linear Hidden Markov Model   closed form equations for optimum model combination   closed form equations for discriminative training of class-specific probability distributions.       

     Now for the classification task specified in (1), the true or posterior distribution π(k|x) is unknown but approximated by a model distribution (p(k|x). The two distribution differ, because of incorrect modelling assumptions and because of insufficient data. An example is the language model factor λ used in. 
     
       
         
           
             
               log 
               ⁢ 
               
                   
               
               ⁢ 
               
                 
                   π 
                   ⁢ 
                   
                       
                   
                   ⁢ 
                   
                     ( 
                     
                       x 
                       ⁢ 
                       
                         
                            
                           k 
                           ) 
                         
                         · 
                         
                           π 
                           ⁡ 
                           
                             ( 
                             k 
                             ) 
                           
                         
                       
                     
                   
                 
                 
                   π 
                   ⁢ 
                   
                       
                   
                   ⁢ 
                   
                     ( 
                     
                       x 
                       ⁢ 
                       
                         
                            
                           
                             k 
                             ′ 
                           
                           ) 
                         
                         · 
                         
                           π 
                           ⁡ 
                           
                             ( 
                             
                               k 
                               ′ 
                             
                             ) 
                           
                         
                       
                     
                   
                 
               
             
             → 
             
               log 
               ⁢ 
               
                   
               
               ⁢ 
               
                 
                   p 
                   ( 
                   
                     x 
                     ⁢ 
                     
                       
                          
                         k 
                         ) 
                       
                       · 
                       
                         
                           p 
                           ⁡ 
                           
                             ( 
                             k 
                             ) 
                           
                         
                         λ 
                       
                     
                   
                 
                 
                   p 
                   ⁢ 
                   
                       
                   
                   ⁢ 
                   
                     ( 
                     
                       x 
                       ⁢ 
                       
                         
                            
                           
                             k 
                             ′ 
                           
                           ) 
                         
                         · 
                         
                           
                             p 
                             ⁡ 
                             
                               ( 
                               
                                 k 
                                 ′ 
                               
                               ) 
                             
                           
                           λ 
                         
                       
                     
                   
                 
               
             
           
         
       
     
     The formal definition combines various submodels p j (k|x), j=1 . . . M into a log-linear posterior distribution p {^} (k|x)=exp{. . } as given in (5). Next to the log-linear combination of the various submodes, the term log C( ^ ) allows normalization to attain a formal probability distribution. The resulting discriminant function is 
                     log   ⁢           ⁢         p     {   Λ   }       (     k   ⁢        x   )             p     {   Λ   }       (       k   ′     ⁢        x   )             =       ∑   j     ⁢       λ   j     ⁢           ⁢   log   ⁢           ⁢         p   j     (     k   ⁢        x   )             p   j     (       k   ′     ⁢        x   )                       (   13   )               
The error rate is minimized and  ^  optimized. Optimizing on the sentence level is as follows:
         Class k: word sequence   Observation x: spoken utterance (e.g. sentence)   N training samples x n , giving the correct sentence   For each sample x,
           k n : correct class as spoken   k≠k n : rival classes, which may be all possible sentences, or for example, a reasonable subset thereof.   
           Similarity of classes: E(k n , k)   E: suitable function of Levenshthein-Distance, or a similarly suitable measure that is monotonous.   Number of words in wordsequence k n : L n .       

     Now, equation 
                 1       ∑     n   =   1     N     ⁢           ⁢     L   n         ⁢       ∑     n   =   1     N     ⁢           ⁢     E   ⁡     (       arg   ⁢           ⁢       max   k     ⁢           ⁢     (     log   ⁢           ⁢         p   ⩓     (     k   ⁢          x   n     )             p   ⩓     (       k   n     ⁢          x   n     )             )         ,     k   n       )           =       1       ∑     n   =   1     N     ⁢           ⁢     L   n         ⁢       ∑     n   =   1     N     ⁢       ∑     k   ≠     k   n         ⁢       E   ⁡     (       k   n     ,   k     )       ·     δ   ⁡     (     k   ,     arg   ⁢           ⁢       max     k   ′       ⁢     (     log   ⁢           ⁢         p   ⩓     (       k   ′     ⁢          x   n     )             p   ⩓     (       k   n     ⁢          x   n     )             )           )                     
gives an objective function, the empirical error rate. Herein, the left hand side of the equation introduces the most probable class that bases on the number of erroneous deviations between classes k and k n .
 
     The parameters  ^  may be estimated by:
         a minimum error rate training through Generalized Probabilistic Descent, which yields an iterative solution.   a modification thereof combines with parabolic smoothing, which yields a closed form solution.   a third method bases on least squares, which again yields a closed form solution.       

     For the GPD method, the smoothed empirical error rate minimizing is based on. 
               L   ⁡     (   ⩓   )       =       1   N     ⁢       ∑     n   =   1     N     ⁢           ⁢     l   ⁡     (       x   n     ,   ⩓     )                 
The smoothed misclassification risk is given by,
 
               l   ⁡     (       x   n     ,   ⩓     )       =     1     1   +         AR   n     ⁡     (   ⩓   )         -   B                 
and the average rivalry by.
 
     
       
         
           
             
               
                 R 
                 n 
               
               ⁡ 
               
                 ( 
                 ⩓ 
                 ) 
               
             
             = 
             
               
                 ( 
                 
                   
                     1 
                     
                       K 
                       - 
                       1 
                     
                   
                   ⁢ 
                   
                     
                       ∑ 
                       
                         k 
                         ≠ 
                         
                           k 
                           n 
                         
                       
                     
                     ⁢ 
                     
                       
                         ( 
                         
                           ⅇ 
                           
                             
                               E 
                               ⁡ 
                               
                                 ( 
                                 
                                   
                                     k 
                                     n 
                                   
                                   , 
                                   k 
                                 
                                 ) 
                               
                             
                             · 
                             
                               
                                 ∑ 
                                 
                                   j 
                                   = 
                                   1 
                                 
                                 M 
                               
                               ⁢ 
                               
                                   
                               
                               ⁢ 
                               
                                 
                                   λ 
                                   j 
                                 
                                 ⁢ 
                                 log 
                                 ⁢ 
                                 
                                     
                                 
                                 ⁢ 
                                 
                                   
                                     
                                       p 
                                       j 
                                     
                                     ( 
                                     
                                       k 
                                       ⁢ 
                                       
                                          
                                         
                                           x 
                                           n 
                                         
                                         ) 
                                       
                                     
                                   
                                   
                                     
                                       p 
                                       j 
                                     
                                     ( 
                                     
                                       
                                         k 
                                         n 
                                       
                                       ⁢ 
                                       
                                          
                                         
                                           x 
                                           n 
                                         
                                         ) 
                                       
                                     
                                   
                                 
                               
                             
                           
                         
                         ) 
                       
                       η 
                     
                   
                 
                 ) 
               
               
                 1 
                 η 
               
             
           
         
       
     
     The smooth empirical error ate is minimized through. 
               L   ⁡     (   ⩓   )       =       1   N     ⁢       ∑     n   =   1     N     ⁢           ⁢     l   ⁡     (       x   n     ,   ⩓     )                 
Herein, l is a loss function that for straightforward calculations must be differentiatable. Rivalry is given by,
 
                 y   nk     ⁢     (   ⩓   )       =       (         p   ⩓     (       k   ⁢          x   n         )           p   ⩓     (         k   n     ⁢          x   n         )         )       E   ⁢     (       k   n     ,   k     )               
wherein E indicates the number of errors. Average rivalry is given through the summing in.
 
                 R   n     ⁢     (   ⩓   )       =       (       1     K   -   1       ⁢       ∑     k   ≠     k   n         ⁢       [       y   nk     ⁢     (   ⩓   )       ]     η         )       1   η             
A smoothed misclassification risk is used by
 
               l   ⁢     (       x   n     ,   ⩓     )       =     1     1   +         AR   n     ⁡     (   ⩓   )         -   B                 
that behaves like a sigmoid function. For R n =−∞, 1 becomes zero, for R n =+∞, the limiting value is l=1. Herein A, B are scaling constants greater than zero. Differentiating to  ^  yields,
 
                     λ   j     (     I   +   1     )       =       ⁢       λ   j     (   I   )       -     ɛ   ⁢       ∑     n   =   1     N     ⁢           ⁢       l   ⁡     (       x   n     ,     ⩓     (   I   )         )       ⁢     (     1   -     l   ⁡     (       x   n     ,     ⩓     (   I   )         )         )     ×                           ⁢         ∑     k   ≠     k   n         ⁢           ⁢     E   ⁢           ⁢     (       k   n     ,   k     )     ⁢           ⁢         log   ⁡     (         p   j     (       k   ⁢          x   n         )           p   j     (         k   n     ⁢          x   n         )         )       ⁡     [       y   nk     ⁡     (     ⩓     (   I   )       )       ]       η             ∑     k   ≠     k   n         ⁢       [       y   nk     ⁡     (     ⩓     (   I   )       )       ]     η                     
wherein the vector  ^   (I)  is given by
 
 ^   (I) =(λ 1   (I) , . . . , λ M   (I) ) tr 
 
and the eventual outcome by
 
     
       
         
           
             
               
                 y 
                 nk 
               
               ⁢ 
               
                 ( 
                 ⩓ 
                 ) 
               
             
             = 
             
               
                 ( 
                 
                   
                     
                       p 
                       ⩓ 
                     
                     ( 
                     
                       
                         k 
                         ⁢ 
                         
                            
                           
                             x 
                             n 
                           
                         
                       
                       ) 
                     
                   
                   
                     
                       p 
                       ⩓ 
                     
                     ( 
                     
                       
                         
                           k 
                           n 
                         
                         ⁢ 
                         
                            
                           
                             x 
                             n 
                           
                         
                       
                       ) 
                     
                   
                 
                 ) 
               
               
                 E 
                 ⁢ 
                 
                   ( 
                   
                     
                       k 
                       n 
                     
                     , 
                     k 
                   
                   ) 
                 
               
             
           
         
       
     
     The invention also provides a closed form solution for finding the discriminative model combination DMC. The solution is to minimize the distance between on the one hand the discriminant function and on the other hand the ideal discriminant function E(k n ,k) in a least squares method. The basic expression is given by 
                 1       (     K   -   1     )     ⁢   N       ⁢         ∑   N       n   =   1       ⁢       ∑     k   ≠     k   n         ⁢       (       log   ⁢           ⁢         p   ⩓     (       k   ⁢          x   n         )           p   ⩓     (         k   n     ⁢          x   n         )           -     E   ⁢     (       k   n     ,   k     )         )     2           =       1       (     K   -   1     )     ⁢   N       ⁢         ∑   N       n   =   1       ⁢       ∑     k   ≠     k   n         ⁢       (         ∑   j     ⁢       λ   j     ⁢           ⁢   log   ⁢         p   j     (       k   ⁢          x   n         )           p   j     (         k   n     ⁢          x   n         )             -     E   ⁢     (       k   n     ,   k     )         )     2                 
Herein,  ^ =Q −1 P, wherein Q is a matrix with elements Q i,j  given by
 
               Q     i   ,   j       =       1       (     K   -   1     )     ⁢   N       ⁢         ∑     n   =   1       N     ⁢       ∑     k   ≠     k   n         ⁢       {     log   ⁢           ⁢         p   i     (         k   n     ⁢          x   n         )           p   i     (       k   ⁢          x   n         )           }     ⁢     {     log   ⁢           ⁢         p   j     (         k   n     ⁢          x   n         )           p   j     (       k   ⁢          x   n         )           }                   
Furthermore, P is a vector with elements P i  given by,
 
               P   i     =       1       (     K   -   1     )     ⁢   N       ⁢         ∑     n   =   1       N     ⁢       ∑     k   ≠     k   n         ⁢       E   ⁢     (       k   n     ,   k     )       ⁢           ⁢     {     log   ⁢           ⁢         p   i     (         k   n     ⁢          x   n         )           p   i     (       k   ⁢          x   n         )           }                   
Now, the empirical error rate has been given earlier in
 
                 1         ∑     n   =   1       N     ⁢     L   n         ⁢         ∑     n   =   1       N     ⁢     E   ⁡     (       arg   ⁢           ⁢       max   k     ⁢     (     log   ⁢           ⁢         p   ⩓     (       k   ⁢          x   n         )           p   ⩓     (         k   n     ⁢          x   n         )           )         ,     k   n       )           =       1         ∑     n   =   1       N     ⁢     L   n         ⁢         ∑     n   =   1       N     ⁢       ∑     k   ≠     k   n         ⁢       E   ⁡     (       k   n     ,   k     )       ·     δ   ⁡     (     k   ,     arg   ⁢           ⁢       max     k   ′       ⁢     (     log   ⁢           ⁢         p   ⩓     (         k   ′     ⁢          x   n         )           p   ⩓     (         k   n     ⁢          x   n         )           )           )                     
For calculatory reasons this is approximated by a smoothed empirical error rate as expressed by
 
               1         ∑     n   =   1       N     ⁢     L   n         ⁢         ∑     n   =   1       N     ⁢       ∑     k   ≠     k   n         ⁢       E   ⁡     (     k   ,     k   n       )       ·     S   ⁡     (     log   ⁢           ⁢         p   ⩓     (       k   ⁢          x   n         )           p   ⩓     (         k   n     ⁢          x   n         )           )                   
Herein, an indication is given on the number of errors between k and k n  through using a sigmoid function S or a similarly useful function. A useful form is S(x)={(x+B)/(A+B)} 2 , wherein −B&lt;x&lt;A and −B&lt; 0 &lt;A. for higher values of x, S=1, and for lower values S=0. This parabola has proved to be useful. Various other second degree curves have been found useful. The relevant rivals must now lie in the central and parabolically curved interval of S. Now, finally, a normalization constraint is added for  ^  according to
 
     
       
         
           
             
               
                 ∑ 
                 
                   j 
                   = 
                   1 
                 
                 M 
               
               ⁢ 
               
                   
               
               ⁢ 
               
                 λ 
                 j 
               
             
             = 
             1 
           
         
       
     
     The second criterion is solved according to a matrix equation (α, λ tr ) tr =Q′ −1 P′, wherein an additional row and column have been supplemented to matrix Q′ for normalization reasons, according to Q′ 0, 0 =0; Q′ 0, j =1, Q′ i, 0 =1/2(A+B) 2 . The general element of correlation matrix Q′ has been given in 
               Q     i   ,   j     ′     =       1       (     K   -   1     )     ⁢   N       ⁢       ∑     n   =   1     N     ⁢           ⁢       ∑     k   ≠     k   n         ⁢       E   ⁡     (     k   ,     k   n       )       ⁢     {     log   ⁢         p   i     ⁡     (       k   n     ❘     x   n       )           p   i     ⁡     (     k   ❘     x   n       )           }     ⁢     {     log   ⁢         p   j     ⁡     (       k   n     ❘     x   n       )           p   j     ⁡     (     k   ❘     x   n       )           }                   
Note that the closed solution is rendered possible through the smoothed step function s. Furthermore, vector P′ likewise gets a normalizing element P′ 0 =1, whereas its general element is given by.
 
     
       
         
           
             
               
                 
                   
                     P 
                     0 
                     ′ 
                   
                   = 
                   1 
                 
               
             
             
               
                 
                   
                     P 
                     i 
                     ′ 
                   
                   = 
                   
                     
                       B 
                       
                         
                           ( 
                           
                             K 
                             - 
                             1 
                           
                           ) 
                         
                         ⁢ 
                         N 
                       
                     
                     ⁢ 
                     
                       
                         ∑ 
                         
                           n 
                           = 
                           1 
                         
                         N 
                       
                       ⁢ 
                       
                           
                       
                       ⁢ 
                       
                         
                           ∑ 
                           
                             k 
                             ≠ 
                             
                               k 
                               n 
                             
                           
                         
                         ⁢ 
                         
                           
                             E 
                             ⁡ 
                             
                               ( 
                               
                                 k 
                                 , 
                                 
                                   k 
                                   n 
                                 
                               
                               ) 
                             
                           
                           ⁢ 
                           
                             { 
                             
                               log 
                               ⁢ 
                               
                                 
                                   
                                     p 
                                     i 
                                   
                                   ⁡ 
                                   
                                     ( 
                                     
                                       
                                         k 
                                         n 
                                       
                                       ❘ 
                                       
                                         x 
                                         n 
                                       
                                     
                                     ) 
                                   
                                 
                                 
                                   
                                     p 
                                     i 
                                   
                                   ⁡ 
                                   
                                     ( 
                                     
                                       k 
                                       ❘ 
                                       
                                         x 
                                         n 
                                       
                                     
                                     ) 
                                   
                                 
                               
                             
                             } 
                           
                         
                       
                     
                   
                 
               
             
           
         
       
     
     Experiments have been done with various M-gram language models, such as bigram, trigram, fourgram or tetragram models, various acoustic models, such as word-internal-triphone, cross-word-trigram and pentaphone models. Generally, the automatic DMC procedure performs equally well as the results produced by non-automatic fine tuning using the same set of submodels. However, the addition of extra submodels according to the automatic procedure of the invention allowed to decrease the number of errors by about 8%. This is considered a significant step forward in the refined art of speech recognition. It is expected that the invention could provide similarly excellent results for recognizing other types of patterns, such as signatures, handwriting scene analysis, and the like, given the availability of appropriate sub-models. Other submodels used for broadcast recognition included mllr adaptation, unigram, distance-1 bigram, wherein an intermediate element is considered as don&#39;t care, pentaphones and wsj-models. In this environment, raising the number of submodels in the automatic procedure of the invention also lowered the numbers of errors by a significant amount of 8-13%. 
       FIG. 1  shows an overall flow chart of a method according to the invention. In block  20  the training is started on a set of training data or patterns that is provided in block  22 . The start as far as necessary claims required software and hardware facilities; in particular, the various submodels and the identity of the various patterns is also provided. For simplicity, the number of submodels has been limited to 2, but the number may be higher. In parallel blocks  24  and  26 , the scores are determined for the individual submodels. In block  28  the log-lin combination of the various submodels is executed and normalized. In block  30  the machine optimizing of vector  ^  in view of the lowest attainable error rate is executed. Note that vector  ^  may have one or more zero-valued components to signal that the associated submodel or -models would bring about no improvement at all. 
     Next, the vector  ^  and the various applicable submodels will be used for recognizing target data, as shown in the right half of the Figure. The training at left, and the usage at right may be executed remote from each other both in time and in space; for example a person could have a machine trained to that person&#39;s voice at a provider&#39;s premises. This might require extra data processing facilities. Later, the machine so trained may be used in a household or automobile environment, or other. Thus, blocks  40 - 46  have corresponding blocks at left. 
     In block  48  the scorings from the various submodels are log-lin combined, using the various components of vector . that had been found in the training. Finally, in block  50  the target data are classified using the results from block  50 . In block  52 , the procedure is stopped when ready. 
       FIG. 2  shows a comprehensive system for practising the invention. The necessary facilities may be mapped on standard hardware, or on a special purpose machine. Item  60  is an appropriate pickup, such as a voice recorder, a two-dimensional optical scanner, together with A/D facilities and quality enhancing preprocessing if necessary. Block  64  represents the processing that applies programs from program memory  66  on data that may arrive from pickup  60 , or from data storage  62 , where they may have been stored permanently or transiently, after forwarding from pickup  60 . Line  70  may receive user control signals, such as start/stop, and possibly training-supportive signals, such as for definitively disabling a non-contributory submodel. 
     Block  68  renders the recognition result usable, such as by tabulating, printing, addressing a dialog structure for retrieving a suitable speech answer, or selecting a suitable output control signal. Block  72  symbolizes the use of the recognized speech, such as outputting a speech riposte, opening a gate for a recognized person, selecting a path in a sorting machine, and the like.