# Patent

## Title
Discriminative training of language models for text and speech classification

## Abstract

Methods are disclosed for estimating language models such that the conditional likelihood of a class given a word string, which is very well correlated with classification accuracy, is maximized. The methods comprise tuning statistical language model parameters jointly for all classes such that a classifier discriminates between the correct class and the incorrect ones for a given training sentence or utterance. Specific embodiments of the present invention pertain to implementation of the rational function growth transform in the context of a discriminative training technique for n-gram classifiers.

## Background
BACKGROUND OF THE INVENTION
The present invention deals with text and speech classification. More specifically, the present invention deals with an enhancement of language models to improve classification accuracy.
Natural language understanding involves using a computer to determine the meaning of text or speech generated by a user. One step in determining the meaning of natural language input is to classify the input into one of a set of predetermined classes. For example, a specific input such as “I want to book a flight to Rome” could be classified into a Travel Arrangements class. An application dedicated to this class could then be invoked to decipher further information from the input and execute the user goal represented by the input.
Such classification is a well-defined problem in natural language processing. Specific examples of practical applications include call routing for automated call centers and natural language based help systems.
Classifiers can be used to facilitate the classification process. Common examples of classifiers include statistical classifiers such as n-gram, Naive Bayes and Maximum Entropy classifiers. In n-gram classifiers, statistical language models are used to assign natural language word strings (i.e., sentences) to a class. Specifically, a separate n-gram language model is constructed for each class. At run-time, the language models are used in parallel to assign a probability to a given test word string or speech utterance. The class associated with the language model demonstrating the highest probability to the test word string or utterance is designated as the class to which the string/utterance belongs. The class assignment need not be one-to-one. The test sentence or utterance can be assigned to a set of N-best class candidates depending on the probability that each class receives given the test string or utterance. For speech classification, n-gram classifiers have the advantage that they can be used in a one-pass scenario wherein speech utterance recognition and classification are integrated.
A straightforward way of training an n-gram classifier is to train the language model for each class separately using maximum likelihood (ML) estimation. Although such training schemes are easy to implement, they produce a classifier with limited classification accuracy.
SUMMARY OF THE INVENTION
Embodiments of the present invention pertain to a way of training language models such that the conditional likelihood of a class given a word string, which is very well correlated with classification accuracy, is maximized. The method comprises tuning statistical language model parameters jointly for all classes such that a classifier discriminates between the correct class and the incorrect ones for a given training sentence or utterance. Specific embodiments of the present invention pertain to implementation of the rational function growth transform in the context of a discriminative training technique for n-gram classifiers.



BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1 is a block diagram of one illustrative environment in which the present invention can be used.
FIG. 2 is a block diagram of a portion of a natural language classification system.
FIG. 3 is a block diagram of a portion of another natural language classification system.
FIG. 4 is a flow chart illustrating steps associated with task or class identification.
FIG. 5 is a flow chart illustrating steps associated with training class specific language models.



DETAILED DESCRIPTION OF ILLUSTRATIVE EMBODIMENTS
I. Exemplary Operating Environments
Various aspects of the present invention pertain to conditional maximum likelihood (CML) estimation of language models used for text or speech utterance classification. However, prior to discussing the invention in more detail, one embodiment of an exemplary environment in which the present invention can be implemented will be discussed.
FIG. 1 illustrates an example of a suitable computing system environment 100 on which the invention may be implemented. The computing system environment 100 is only one example of a suitable computing environment and is not intended to suggest any limitation as to the scope of use or functionality of the invention. Neither should the computing environment 100 be interpreted as having any dependency or requirement relating to any one or combination of components illustrated in the exemplary operating environment 100.
The invention is operational with numerous other general purpose or special purpose computing system environments or configurations. Examples of well-known computing systems, environments, and/or configurations that may be suitable for use with the invention include, but are not limited to, personal computers, server computers, hand-held or laptop devices, multiprocessor systems, microprocessor-based systems, set top boxes, programmable consumer electronics, network PCs, minicomputers, mainframe computers, telephony systems, distributed computing environments that include any of the above systems or devices, and the like.
The invention may be described in the general context of computer-executable instructions, such as program modules, being executed by a computer. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types. The invention is designed to be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules are located in both local and remote computer storage media including memory storage devices. Tasks performed by the programs and modules are described below and with the aid of figures. Those skilled in the art can implement the description and figures as processor executable instructions, which can be written on any form of a computer readable media.
With reference to FIG. 1, an exemplary system for implementing the invention includes a general-purpose computing device in the form of a computer 110. Components of computer 110 may include, but are not limited to, a processing unit 120, a system memory 130, and a system bus 121 that couples various system components including the system memory to the processing unit 120. The system bus 121 may be any of several types of bus structures including a memory bus or memory controller, a peripheral bus, and a local bus using any of a variety of bus architectures. By way of example, and not limitation, such architectures include Industry Standard Architecture (ISA) bus, Micro Channel Architecture (MCA) bus, Enhanced ISA (EISA) bus, Video Electronics Standards Association (VESA) local bus, and Peripheral Component Interconnect (PCI) bus also known as Mezzanine bus.
Computer 110 typically includes a variety of computer readable media. Computer readable media can be any available media that can be accessed by computer 110 and includes both volatile and nonvolatile media, removable and non-removable media. By way of example, and not limitation, computer readable media may comprise computer storage media and communication media. Computer storage media includes both volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital versatile disks (DVD) or other optical disk storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can be accessed by computer 110.
Communication media typically embodies computer readable instructions, data structures, program modules or other data in a modulated data signal such as a carrier wave or other transport mechanism and includes any information delivery media. The term “modulated data signal” means a signal that has one or more of its characteristics set or changed in such a manner as to encode information in the signal. By way of example, and not limitation, communication media includes wired media such as a wired network or direct-wired connection, and wireless media such as acoustic, RF, infrared and other wireless media. Combinations of any of the above should also be included within the scope of computer readable media.
The system memory 130 includes computer storage media in the form of volatile and/or nonvolatile memory such as read only memory (ROM) 131 and random access memory (RAM) 132. A basic input/output system 133 (BIOS), containing the basic routines that help to transfer information between elements within computer 110, such as during start-up, is typically stored in ROM 131. RAM 132 typically contains data and/or program modules that are immediately accessible to and/or presently being operated on by processing unit 120. By way of example, and not limitation, FIG. 1 illustrates operating system 134, application programs 135, other program modules 136, and program data 137.
The computer 110 may also include other removable/non-removable volatile/nonvolatile computer storage media. By way of example only, FIG. 1 illustrates a hard disk drive 141 that reads from or writes to non-removable, nonvolatile magnetic media, a magnetic disk drive 151 that reads from or writes to a removable, nonvolatile magnetic disk 152, and an optical disk drive 155 that reads from or writes to a removable, nonvolatile optical disk 156 such as a CD ROM or other optical media. Other removable/non-removable, volatile/nonvolatile computer storage media that can be used in the exemplary operating environment include, but are not limited to, magnetic tape cassettes, flash memory cards, digital versatile disks, digital video tape, solid state RAM, solid state ROM, and the like. The hard disk drive 141 is typically connected to the system bus 121 through a non-removable memory interface such as interface 140, and magnetic disk drive 151 and optical disk drive 155 are typically connected to the system bus 121 by a removable memory interface, such as interface 150.
The drives and their associated computer storage media discussed above and illustrated in FIG. 1, provide storage of computer readable instructions, data structures, program modules and other data for the computer 110. In FIG. 1, for example, hard disk drive 141 is illustrated as storing operating system 144, application programs 145, other program modules 146, and program data 147. Note that these components can either be the same as or different from operating system 134, application programs 135, other program modules 136, and program data 137. Operating system 144, application programs 145, other program modules 146, and program data 147 are given different numbers here to illustrate that, at a minimum, they are different copies.
A user may enter commands and information into the computer 110 through input devices such as a keyboard 162, a microphone 163, and a pointing device 161, such as a mouse, trackball or touch pad. Other input devices (not shown) may include a joystick, game pad, satellite dish, scanner, or the like. These and other input devices are often connected to the processing unit 120 through a user input interface 160 that is coupled to the system bus, but may be connected by other interface and bus structures, such as a parallel port, game port or a universal serial bus (USB). A monitor 191 or other type of display device is also connected to the system bus 121 via an interface, such as a video interface 190. In addition to the monitor, computers may also include other peripheral output devices such as speakers 197 and printer 196, which may be connected through an output peripheral interface 195.
The computer 110 is operated in a networked environment using logical connections to one or more remote computers, such as a remote computer 180. The remote computer 180 may be a personal computer, a hand-held device, a server, a router, a network PC, a peer device or other common network node, and typically includes many or all of the elements described above relative to the computer 110. The logical connections depicted in FIG. 1 include a local area network (LAN) 171 and a wide area network (WAN) 173, but may also include other networks. Such networking environments are commonplace in offices, enterprise-wide computer networks, intranets and the Internet.
When used in a LAN networking environment, the computer 110 is connected to the LAN 171 through a network interface or adapter 170. When used in a WAN networking environment, the computer 110 typically includes a modem 172 or other means for establishing communications over the WAN 173, such as the Internet. The modem 172, which may be internal or external, may be connected to the system bus 121 via the user input interface 160, or other appropriate mechanism. In a networked environment, program modules depicted relative to the computer 110, or portions thereof, may be stored in the remote memory storage device. By way of example, and not limitation, FIG. 1 illustrates remote application programs 185 as residing on remote computer 180. It will be appreciated that the network connections shown are exemplary and other means of establishing a communications link between the computers may be used.
It should be noted that the present invention can be carried out on a computer system such as that described with respect to FIG. 1. However, the present invention can be carried out on a server, a computer devoted to message handling, or on a distributed system in which different portions of the present invention are carried out on different parts of the distributed computing system.
II. Overview of Task Classification System
FIG. 2 is a block diagram of a portion of a natural language classification system 200. System 200 includes a statistical classifier 204. System 200 can also include optional speech recognition engine 206. Where interface 200 is to accept speech signals as an input, it includes the recognizer 206. However, where interface 200 is to receive textual input, recognizer 206 is not needed. The present discussion will proceed with respect to an embodiment in which speech recognizer 206 is present, although it will be appreciated that it need not be present in other embodiments. Also, other natural language communication modes can be used, such as handwriting or other modes. In such cases, suitable recognition components, such as handwriting recognition components, are utilized.
In order to perform class or task classification, system 200 first receives an utterance 208 in the form of a speech signal that represents natural language speech spoken by a user. Speech recognizer 206 performs speech recognition on utterance 208 and provides, at its output, natural language text 210. Text 210 is a textual representation of the natural language utterance 208 received by speech recognizer 206. Speech recognizer 206 can be any known speech recognition system that performs speech recognition on a speech input. Speech recognizer 206 may include an application-specific dictation language model, but the particular way in which speech recognizer 206 recognizes speech does not form a major part of the present invention. Similarly, in another embodiment, speech recognizer 206 outputs a list of results or interpretations with respective probabilities. Later components operate on each interpretation and use the associated probabilities in class or task classification.
In accordance with one embodiment, all or a portion of natural language text 210 is provided to statistical classifier 204 for analysis and classification. A portion might be provided in instances where preprocessing is utilized to remove certain elements (i.e., articles such as a, an, the, etc.) from text 210. In accordance with another embodiment, a less direct representation of natural language text 210 (i.e., a vector representation) is provided to statistical classifier 204 for analysis and classification.
In accordance with one embodiment, a set of features is extracted from the natural language text for submission to statistical classifier 204. The set of features will illustratively be those found to be most helpful in performing task classification. This can be empirically, or otherwise, determined.
In one embodiment, the extracted features are a set of word identifiers that indicate the presence or absence of words in the natural language input text 210. For example, only words in a certain vocabulary designed for a specific application might be tagged for consideration by classifier 204, and words outside the vocabulary are mapped to a distinguished word-type such as <UNKNOWN>.
It should be noted that more complex types of features can be selected for consideration as well. For example, the co-occurrences of words can be selected features. This may be used, for instance, in order to more explicitly identify tasks to be performed. For example, the co-occurrence of the words “send mail” may be a feature noted to be of particular importance for processing by statistical classifier 204. If these two words are found, in this order, in the input text, then statistical classifier 204 will receive notification of the fact. A wide variety of other features can be selected as well, such as bi-grams, tri-grams, other n-grams, and any other desired features.
Preprocessing can optionally be performed on natural language text 210 to facilitate the processing of text 210 prior to a feature extraction process. For example, it may be desirable that natural language text 210 only include indications of the presence or absence of words that have been predetermined to carry certain types of content.
Stemming can also be used prior to feature extraction. Stemming is a process of removing morphological variations in words to obtain their root form. Examples of morphological variations include inflectional changes (such as pluralization, verb tense, etc.) and derivational changes that alter a word's grammatical role (such as adjective versus adverb as in slow versus slowly, etc). Stemming can be used to condense multiple features with the same underlying semantics into single features. This can help overcome data sparseness, improve computational efficiency, and reduce the impact of the feature independence assumptions used in statistical classification methods.
In any case, statistical classifier 204 receives the natural language text 210 information and utilizes statistical classification components 207 to classify the information into one or more of a plurality of predefined classes or tasks. Components 207 are illustratively any of a variety of statistical language models such as those associated with n-gram, Naive Bayes or Maximum Entropy classifiers. A trainer 209 illustratively trains the language models utilizing a collection of training data 205 and test data 213. Test data 213 is illustratively a limited amount of data held back from training data 205 to facilitate the training process.
The theory underlying the task or class identification performed by classifier 204 will now be described in greater detail. To fix notation, a speech utterance is hereinafter denoted with A. The word string that gave rise to utterance A is denoted with W=w1 . . . wn. The class of utterance A is denoted with C(A). The word vocabulary is denoted with ν, and the class vocabulary with C. The corpus, split into training and test data, T and ε, respectively, consists of tuples (or samples) s containing: utterance A, transcription W and utterance class C(A). For reference, the performance of a given classifier is measured by the class error rate (CER):




  
    
      
        CER
        =
        
          
            ∑
            
              s
              ∈
              ɛ
            
          
          ⁢
          
            δ
            ⁡
            
              (
              
                
                  C
                  ⁡
                  
                    (
                    
                      s
                      ·
                      A
                    
                    )
                  
                
                ,
                
                  
                    C
                    ^
                  
                  ⁡
                  
                    (
                    
                      s
                      ·
                      A
                    
                    )
                  
                
              
              )
            
          
        
      
    
    
      
        (
        1
        )
      
    
  




where s.A denotes the acoustics in sample s and δ(.,.) is the Kronecker-δ operator, which is equal to one when its arguments are equal to each other and is equal to zero otherwise.

In the context of an n-gram language model classifier, assuming a two-pass scenario, an n-gram model P(wi|wi−1, . . . , wi−n+1, C) is built for each class CεC by pooling transcriptions that have been labeled with class C. A pooled n-gram language model P(wi|wi−1,wi−n+1) is built from all the training transcriptions in addition to the class specific language models P(·|C). Each test utterance is then assigned a class by doing text classification on the 1-best recognition output using the pooled language model:




  
    
      
        
          Most
          ⁢
          
            
          
          ⁢
          likely
          ⁢
          
            
          
          ⁢
          class
        
        =
        
          
            
              C
              ^
            
            ⁡
            
              (
              A
              )
            
          
          =
          
            
              arg
              ⁢
              
                
              
              ⁢
              
                
                  max
                  C
                
                ⁢
                
                  log
                  ⁢
                  
                    
                  
                  ⁢
                  
                    P
                    ⁡
                    
                      (
                      
                        
                          W
                          ^
                        
                        |
                        C
                      
                      )
                    
                  
                
              
            
            +
            
              log
              ⁢
              
                
              
              ⁢
              
                P
                ⁡
                
                  (
                  C
                  )
                
              
            
          
        
      
    
    
      
        (
        2
        )
      
    
  
  
    
      
        
          Most
          ⁢
          
            
          
          ⁢
          likely
          ⁢
          
            
          
          ⁢
          word
          ⁢
          
            
          
          ⁢
          sequence
        
        =
        
          
            W
            ^
          
          =
          
            
              arg
              ⁢
              
                
              
              ⁢
              
                
                  max
                  W
                
                ⁢
                
                  
                
                ⁢
                
                  log
                  ⁢
                  
                    
                  
                  ⁢
                  
                    P
                    ⁡
                    
                      (
                      
                        A
                        |
                        W
                      
                      )
                    
                  
                
              
            
            +
            
              log
              ⁢
              
                
              
              ⁢
              
                P
                ⁡
                
                  (
                  W
                  )
                
              
            
          
        
      
    
    
      
        (
        3
        )
      
    
  




This is a two-pass approach where the first step of Equation 2 is performed by speech recognizer 206 and the second step of Equation 2 is performed by statistical classifier 204. The second stage of the two-pass approach illustratively implements an n-gram text classifier.

The n-gram type of classifier has a special potential efficiency advantage in that it can be used in a single-pass system wherein a given speech utterance is assigned a class concurrently with speech recognition. In addition, it is worth noting that the n-gram type of classifier is advantageous in that it enables consideration of word co-occurrences of a relatively high order. For example, consideration of tri-grams involves the examination of word triplets. Even if only uni-grams are considered, the number of occurrences of the word will be considered in an n-gram classifier.
FIG. 3 is an illustration of a portion of a single-pass classification system 220. Elements in FIG. 3 having the same or similar functionality as elements in FIG. 2 have been labeled with the same or similar reference numerals.
System 220 (FIG. 3) is different than system 200 (FIG. 2) in that it includes a statistical classifier/decoder 211. Classifier/decoder 211 illustratively decodes and classifies utterance 208 in a single pass. Classifier/decoder 211 includes statistical classification components 207 (i.e., language models) that are trained by trainer 209. Components 207 are illustratively n-gram language models configured for a single-pass system whereby a given utterance A is assigned a class Ĉ(A) concurrently with speech decoding that finds the word string Ŵ.
In accordance with the single pass system of FIG. 3, an n-gram model P(wi|wi−1, . . . , wi−n+1, C) is built for each class CεC by pooling all the training transcriptions that have been labeled with class C. A recognition network is constructed by stacking each of the language models P(·|C), with associated labels for each class, in parallel. The transition into each language model P(·|C) has a score log P(C). In one pass, the most likely path is identified as follows:

(Ĉ(A),Ŵ)=arg max(C,W)log P(A|W)+log P(W|C)+log P(C)  (4)

Accordingly, upon receipt of utterance 208, classifier/decoder 211 is able to assign a class concurrently with speech decoding. The word string that is recognized as being most likely will have a class tag that is returned with the string. The output is a task or class ID 214 and a decoded string 215. Decoded string 215 is illustratively a word string representation of utterance 208.
In the context of both one and two pass systems, n-gram language models can be smoothed to accommodate for unseen training data. In accordance with one embodiment, the n-gram probabilities for the class specific training models are estimated using linear interpolation of relative frequency estimates at different orders (such as 0 for a uniform model, n−1 for a n-gram model). The linear interpolation weights at different orders are bucketed according to context counts, and their values are estimated using maximum likelihood techniques on cross-validation data. The n-gram counts from the cross-validation data are then added to the counts gathered from the main training data to enhance the quality of the relative frequency estimates. Such smoothing is set out in greater detail in Jelinek and Mercer, Interpolated Estimation of Markov Source Parameters From Sparse Data, Pattern Recognition in Practice, Gelsema and Kanal editors, North-Holland (1980). This is one example of smoothing.
There are other ways to define the process of smoothing. In accordance with another embodiment of smoothing, in order to estimate n-gram language models, a recursive deleted interpolation scheme is utilized between relative frequency estimates at different orders, fk(·),k=0 . . . n:

Pn(w|hn)=λ(hn)·Pn−1(w|hn−1)+ λ(hn)·fn(w|hn),

P−1(w)=uniform(v)  (5)

where

 λ(hn)=1−λ(hn)

hn=w−1, . . . , w−n 

The relative frequencies, fn(w/hn), and interpolation weights, λ(hn), are estimated using maximum likelihood estimation from main and held-out data, respectively, obtained by a 70/30% random split of training data available to a given language model. The interpolation weights are bucketed according to the context count:

λ(hn)=λ(CML(hn))  (6)

where CML(hn) is the number of times the context hn is found in the training data assigned to the class.

Generally speaking, classifiers 204 and 211 are configured to output a task or class identifier 214 identifying the particular task or class assigned to corresponding natural language input. Identifier 214 can alternatively be a ranked list (or n-best list) of task or class identifiers. The identifier 214 is provided to an application or other component that can take action based on the identified task. For example, if the identified task is to SendMail, identifier 214 is sent to an electronic mail application which can in turn display an electronic mail template for use by a user. Of course, any other task or class is contemplated as well. Similarly, if an n-best list of identifiers 214 is output, each item in the list can be displayed through a suitable user interface such that a user can select the desired class or task. Note that the decoded string 215 is typically also provided to the application.
III. Task or Class Identification
FIG. 4, in accordance with one embodiment of the present invention, is a flow chart illustrating steps associated with a method of task or class identification. It should be noted that the method could be customized for either a one-pass or a two-pass system as described above in relation to FIGS. 2 and 3. The classifier utilizes classification components 207, which are illustratively a set of class-dependent n-gram statistical language model classifiers. In accordance with block 402, one class specific model is generated for each class or task. Therefore, when natural language input 210 is received (block 404), the class specific language models are run on that information for each class (block 406). The output from each language model is multiplied by a prior probability for the respective class (block 408). The class with the highest resulting value illustratively corresponds to the target class (block 410).
FIG. 5, in accordance with one embodiment, is a flow chart illustrating steps associated with the training of class specific language models. Such training is illustratively carried out by trainer 209 (FIGS. 2 and 3). In accordance with block 502, class specific n-gram language models are trained by splitting sentences in a training corpus among the various classes for which n-gram language models are being trained. In accordance with block 506, the sentences corresponding to each class are used in training the n-gram classifier for that class. This yields a given number of n-gram language models, wherein the number corresponds to the total number of classes to be considered. It should be noted that, in accordance with block 504, feature extraction techniques such as stemming and other forms of preprocessing can optionally be applied to sentences prior to training. The preprocessing could occur before or after sentences are divided among classes. Also, step 506 may include defining the language models using smoothing to help reduce the effects of sparse data as described above.
IV. Conditional Maximum Likelihood (CML) Estimation of n-Gram Classifiers
Under some embodiments of the present invention, training step 506 is performed utilizing a conditional maximum likelihood (CML) ESTIMATION scheme. The CML training scheme enables statistical language model parameters to be trained jointly for all classes such that the classifier discriminates between the correct class and the incorrect ones for a given training sentence or utterance.
Under one embodiment, the language models P(W|C), ∀C are jointly trained such that the class error rate (Equation 1) is minimized. Since the CER is not analytically tractable, a convenient substitute is the conditional probability




  
    ∏
    
      i
      =
      1
    
    T
  
  ⁢
  
    
  
  ⁢
  
    P
    ⁡
    
      (
      
        
          
            s
            i
          
          ·
          C
        
        |
        
          
            s
            i
          
          ·
          A
        
      
      )
    
  




for speech utterance classification or





  
    ∏
    
      i
      =
      1
    
    T
  
  ⁢
  
    
  
  ⁢
  
    P
    ⁡
    
      (
      
        
          
            s
            i
          
          ·
          C
        
        |
        
          
            s
            i
          
          ·
          W
        
      
      )
    
  




for text classification, where T is the number of samples in the training data, |si.A represents the acoustics in training sample i, |si.C is the class associated with training sample i and |si.W is the sentence (word string) associated with training sample i. The choice is justified by an inverse correlation with the CER on the training data (equal to the expected probability of error on the training data).

Restricting attention to the text only case, it is desirable to tune the language models P(W|C), ∀C to maximize the conditional log-likelihood:




  
    
      
        
          L
          ⁡
          
            (
            
              C
              |
              W
            
            )
          
        
        =
        
          
            ∑
            
              i
              =
              1
            
            T
          
          ⁢
          
            log
            ⁢
            
              
            
            ⁢
            
              P
              ⁡
              
                (
                
                  
                    
                      s
                      i
                    
                    ·
                    C
                  
                  |
                  
                    
                      s
                      i
                    
                    ·
                    W
                  
                
                )
              
            
          
        
      
    
    
      
        (
        7
        )
      
    
  




where:




  
    
      
        
          P
          ⁡
          
            (
            
              C
              |
              W
            
            )
          
        
        =
        
          
            P
            ⁡
            
              (
              C
              )
            
          
          ·
          
            
              P
              ⁡
              
                (
                
                  W
                  |
                  C
                
                )
              
            
            /
            
              
                ∑
                
                  L
                  ∈
                  C
                
              
              ⁢
              
                
                  P
                  ⁡
                  
                    (
                    L
                    )
                  
                
                ·
                
                  P
                  ⁡
                  
                    (
                    
                      W
                      |
                      L
                    
                    )
                  
                
              
            
          
        
      
    
    
      
        (
        8
        )
      
    
  




The goal becomes to maximize the objective function of equation (7). For efficiency reasons, it is desirable to keep the same parameterization as in the maximum likelihood (ML) case (see Eq. 5) for the class specific language models. For example, it is desirable to keep the same λ and fn parameters as in the ML case (although determining different values for the parameters). The storage requirements and run time should illustratively be the same as for the ML models. This is an optional constraint and could be removed.

    
    
        It is worth noting that for speech utterance classification, the language model P(W|C), ∀C can be tuned such that the conditional likelihood L(C|A) is maximized:
    
    






  
    
      
        
          L
          ⁡
          
            (
            
              C
              |
              A
            
            )
          
        
        =
        
          
            ∑
            
              i
              =
              1
            
            T
          
          ⁢
          
            log
            ⁢
            
              
            
            ⁢
            
              P
              ⁡
              
                (
                
                  
                    
                      s
                      i
                    
                    ·
                    C
                  
                  |
                  
                    
                      s
                      i
                    
                    ·
                    A
                  
                
                )
              
            
          
        
      
    
    
      
        (
        9
        )
      
    
  




where





  
    
      
        
          P
          ⁡
          
            (
            
              C
              |
              A
            
            )
          
        
        =
        
          
            P
            ⁡
            
              (
              
                C
                ,
                A
              
              )
            
          
          /
          
            
              ∑
              
                L
                ∈
                C
              
            
            ⁢
            
              P
              ⁡
              
                (
                
                  L
                  ,
                  A
                
                )
              
            
          
        
      
    
    
      
        (
        10
        )
      
    
  
  
    
      
        
          P
          ⁡
          
            (
            
              C
              ,
              A
            
            )
          
        
        =
        
          
            P
            ⁡
            
              (
              C
              )
            
          
          ⁢
          
            
              ∑
              
                w
                ∈
                
                  v
                  *
                
              
            
            ⁢
            
              
                P
                ⁡
                
                  (
                  
                    W
                    |
                    C
                  
                  )
                
              
              ·
              
                P
                ⁡
                
                  (
                  
                    A
                    |
                    W
                  
                  )
                
              
            
          
        
      
    
    
      
        (
        11
        )
      
    
  




A notable difference between tuning the language models for maximizing L(C|A) (Eq. 9) versus L(C|W) (Eq. 7) is that in the former case the language model will take into account the acoustic confusability between words and will try to discount the contribution of highly confusable words to the classification result.
Maximizing L(C|W) requires word transcriptions along with class labels for language model training (the acoustic data is not used for language model training). Since the resulting models are n-grams they can be easily used for both speech and text classification.
V. Rational Function Growth Transformation for CML n-Gram Parameter Estimation
As has been described, each class specific n-gram model is parameterized according to Equation 5. The goal of the CML estimation procedure is to tune the relative frequency values fn(w|w−1, . . . , w−n) as well as the interpolation weights λ(w−1, . . . , w−n) at all orders 0 . . . n−1 such that the conditional likelihood of the training data L(C|W) (see Equation 7) is maximized.
In accordance with one aspect of the present invention, an efficient and effective optimization technique is the rational function growth transform (RFGT). The RFGT algorithm, which is a known mathematical application, is described in detail in P. S. Gopalakrishanan et al., An inequality for rational functions with applications to some statistical estimation problems, IEEE Transaction on Information Theory, Vol. 37, No. 1, pp. 107-113, January 1991. The RFGT procedure is particularly appropriate for the presently described application because it operates on probability distributions and thus it enforces proper normalization of the probability distributions underlying model parameterization at each iteration.
Under the parameterization in Equation 5, the re-estimation equations for the relative frequency fk(w|hk,c) of order k are:




  
    
      
        
          
            
              
                f
                ^
              
              k
            
            ⁡
            
              (
              
                
                  x
                  |
                  
                    h
                    k
                  
                
                ,
                c
              
              )
            
          
          =
          
            
              
                
                  f
                  k
                
                ⁡
                
                  (
                  
                    
                      w
                      |
                      
                        h
                        k
                      
                    
                    ,
                    c
                  
                  )
                
              
              +
              
                
                  β
                  ⁡
                  
                    (
                    
                      
                        h
                        k
                      
                      ,
                      c
                    
                    )
                  
                
                ⁢
                
                  
                
                ⁢
                
                  
                    
                      ∏
                      
                        l
                        =
                        
                          k
                          +
                          1
                        
                      
                      n
                    
                    ⁢
                    
                      
                    
                    ⁢
                    
                      
                        
                          λ
                          1
                        
                        ⁡
                        
                          (
                          
                            
                              h
                              1
                            
                            ,
                            c
                          
                          )
                        
                      
                      ⁢
                      
                        
                          
                            λ
                            k
                          
                          ⁡
                          
                            (
                            
                              
                                h
                                k
                              
                              ,
                              c
                            
                            )
                          
                        
                        _
                      
                    
                  
                  
                    
                      P
                      n
                    
                    ⁡
                    
                      (
                      
                        
                          w
                          |
                          
                            h
                            n
                          
                        
                        ,
                        c
                      
                      )
                    
                  
                
                ⁢
                
                  
                
                ⁢
                
                  
                    
                      f
                      k
                    
                    ⁡
                    
                      (
                      
                        
                          w
                          |
                          
                            h
                            k
                          
                        
                        ,
                        c
                      
                      )
                    
                  
                  ·
                  
                    
                      
                        C
                        CML
                      
                      ⁡
                      
                        (
                        
                          w
                          ,
                          
                            h
                            k
                          
                          ,
                          c
                        
                        )
                      
                    
                    
                      
                        C
                        ML
                      
                      ⁡
                      
                        (
                        
                          
                            h
                            k
                          
                          ,
                          c
                        
                        )
                      
                    
                  
                
              
            
            
              norm
              ⁡
              
                (
                
                  
                    h
                    k
                  
                  ,
                  c
                
                )
              
            
          
        
        ⁢
        
          

        
        ⁢
        
          
            norm
            ⁡
            
              (
              
                
                  h
                  k
                
                ,
                c
              
              )
            
          
          =
          
            1
            +
            
              
                β
                ⁡
                
                  (
                  
                    
                      h
                      k
                    
                    ,
                    c
                  
                  )
                
              
              ⁢
              
                
                  ∑
                  
                    w
                    ∈
                    v
                  
                
                ⁢
                
                  
                    
                      
                        ∏
                        
                          l
                          =
                          
                            k
                            +
                            1
                          
                        
                        n
                      
                      ⁢
                      
                        
                      
                      ⁢
                      
                        
                          
                            λ
                            l
                          
                          ⁡
                          
                            (
                            
                              
                                h
                                l
                              
                              ,
                              c
                            
                            )
                          
                        
                        ⁢
                        
                          
                            
                              λ
                              k
                            
                            ⁡
                            
                              (
                              
                                
                                  h
                                  k
                                
                                ,
                                c
                              
                              )
                            
                          
                          _
                        
                      
                    
                    
                      
                        P
                        n
                      
                      ⁡
                      
                        (
                        
                          
                            w
                            |
                            
                              h
                              n
                            
                          
                          ,
                          c
                        
                        )
                      
                    
                  
                  ⁢
                  
                    
                      
                        f
                        k
                      
                      ⁡
                      
                        (
                        
                          
                            w
                            |
                            
                              h
                              k
                            
                          
                          ,
                          c
                        
                        )
                      
                    
                    ·
                    
                      
                        
                          C
                          CML
                        
                        ⁡
                        
                          (
                          
                            w
                            ,
                            
                              h
                              k
                            
                            ,
                            c
                          
                          )
                        
                      
                      
                        
                          C
                          ML
                        
                        ⁡
                        
                          (
                          
                            
                              h
                              k
                            
                            ,
                            c
                          
                          )
                        
                      
                    
                  
                
              
            
          
        
      
    
    
      
        (
        12
        )
      
    
  




where CML (w, hk,c) denotes the maximum likelihood count of (w,hk) in sentences of class c gathered from the training data:





  
    
      
        
          
            C
            ML
          
          ⁡
          
            (
            
              w
              ,
              
                h
                k
              
              ,
              c
            
            )
          
        
        =
        
          
            ∑
            
              i
              =
              1
            
            T
          
          ⁢
          
            
              C
              ⁡
              
                (
                
                  
                    (
                    
                      w
                      ,
                      
                        h
                        k
                      
                    
                    )
                  
                  ∈
                  
                    
                      s
                      i
                    
                    ·
                    W
                  
                
                )
              
            
            ·
            
              δ
              ⁡
              
                (
                
                  c
                  ,
                  
                    
                      s
                      i
                    
                    ·
                    C
                  
                
                )
              
            
          
        
      
    
    
      
        (
        13
        )
      
    
  




CCML (w,hk,c) denotes the “CML count” of (w,hk) in sentences of class c:





  
    
      
        
          
            C
            CML
          
          ⁡
          
            (
            
              w
              ,
              
                h
                k
              
              ,
              c
            
            )
          
        
        =
        
          
            ∑
            
              i
              =
              1
            
            T
          
          ⁢
          
            
              C
              ⁡
              
                (
                
                  
                    (
                    
                      w
                      ,
                      
                        h
                        k
                      
                    
                    )
                  
                  ∈
                  
                    
                      s
                      i
                    
                    ·
                    W
                  
                
                )
              
            
            ·
            
              [
              
                
                  δ
                  ⁡
                  
                    (
                    
                      c
                      ,
                      
                        
                          s
                          i
                        
                        ·
                        C
                      
                    
                    )
                  
                
                -
                
                  P
                  ⁡
                  
                    (
                    
                      c
                      |
                      
                        
                          s
                          i
                        
                        ·
                        W
                      
                    
                    )
                  
                
              
              ]
            
          
        
      
    
    
      
        (
        14
        )
      
    
  




with the probability P(c|W) of a class c given a sentence W=w1, . . . , wq being assigned using the class specific n-gram models Pn(w|h,c) and the prior probability on classes P(c):





  
    
      
        
          P
          ⁡
          
            (
            
              c
              |
              W
            
            )
          
        
        =
        
          
            
              P
              ⁡
              
                (
                c
                )
              
            
            ·
            
              P
              ⁡
              
                (
                
                  W
                  |
                  c
                
                )
              
            
          
          
            
              ∑
              
                d
                ∈
                C
              
            
            ⁢
            
              
                P
                ⁡
                
                  (
                  d
                  )
                
              
              ·
              
                P
                ⁡
                
                  (
                  
                    W
                    |
                    d
                  
                  )
                
              
            
          
        
      
    
    
      
        (
        15
        )
      
    
  
  
    
      
        
          P
          ⁡
          
            (
            
              W
              |
              c
            
            )
          
        
        =
        
          
            ∏
            
              i
              =
              1
            
            q
          
          ⁢
          
            
          
          ⁢
          
            
              P
              n
            
            ⁡
            
              (
              
                
                  
                    w
                    i
                  
                  |
                  
                    h
                    i
                  
                
                ,
                c
              
              )
            
          
        
      
    
    
      
        (
        16
        )
      
    
  




The context sensitive “CML weight” β(hk,c) is set to βmax>0 at each iteration. Following development, its value is then lowered for each context β(hk,c) separately such that the numerator in Equation 12 is non-negative for all events (w,hk,c):




  
    
      
        
          
            
              f
              k
            
            ⁡
            
              (
              
                
                  w
                  |
                  
                    h
                    k
                  
                
                ,
                c
              
              )
            
          
          +
          
            
              β
              ⁡
              
                (
                
                  
                    h
                    k
                  
                  ,
                  c
                
                )
              
            
            ⁢
            
              
                
                  ∏
                  
                    l
                    =
                    
                      k
                      +
                      1
                    
                  
                  n
                
                ⁢
                
                  
                
                ⁢
                
                  
                    
                      λ
                      l
                    
                    ⁡
                    
                      (
                      
                        
                          h
                          l
                        
                        ,
                        c
                      
                      )
                    
                  
                  ⁢
                  
                    
                      λ
                      k
                    
                    ⁡
                    
                      (
                      
                        
                          h
                          k
                        
                        ,
                        c
                      
                      )
                    
                  
                
              
              
                
                  P
                  n
                
                ⁡
                
                  (
                  
                    
                      w
                      |
                      
                        h
                        n
                      
                    
                    ,
                    c
                  
                  )
                
              
            
            ⁢
            
              
                
                  f
                  k
                
                ⁡
                
                  (
                  
                    
                      w
                      |
                      
                        h
                        k
                      
                    
                    ,
                    c
                  
                  )
                
              
              ·
              
                
                  
                    C
                    CML
                  
                  ⁡
                  
                    (
                    
                      w
                      ,
                      
                        h
                        k
                      
                      ,
                      c
                    
                    )
                  
                
                
                  
                    C
                    ML
                  
                  ⁡
                  
                    (
                    
                      
                        h
                        k
                      
                      ,
                      c
                    
                    )
                  
                
              
            
          
        
        >
        ɛ
      
    
    
      
        (
        17
        )
      
    
  




It should be noted that for most contexts (hk,c) this adjustment is not necessary if a low enough βmax value is chosen to start with. The downside of choosing a small βmax value is that the relative increase of L(C|W) at each iteration is smaller.
The model parameters are estimated by splitting the training data randomly into main and held-out data. The same partition as the one for ML training is used. The main data is used for estimating the relative frequencies, whereas the held-out data is used for tuning the number of RFGT iterations and the optimal CML weight βmax, The class priors and the interpolation weights are not re-estimated. The initial values for the class priors, relative frequencies and the interpolation weights are illustratively the ML ones. For example, the interpolation weights are those calculated in Equation 5.
The number of RFGT iterations and the optimal CML weight βmax are illustratively determined as follows:

    
    
        Fix a preset number N of RFGT iterations to be run;
        Fix a grid (range of values and step) to be explored for determining the βmax parameter value;
        For each value βmax run as many RFGT iterations as possible (no more than N) such that the conditional likelihood L(C|W) of the main data increases at each iteration; and
        Retain the (number of iterations, βmax) pair that maximizes the conditional likelihood L(C|W) of the held-out data as the desired values.
    
    


After determining the number of RFGT iterations to be run and the βmax value, the main and held-out data are pooled and the model is trained using these values.
Although the present invention has been described with reference to particular embodiments, workers skilled in the art will recognize that changes may be made in form and detail without departing from the spirit and scope of the invention.

## Claims

1. A computer implemented method of classifying a natural language input, comprising:
training a plurality of statistical classification components jointly in relation to one another to maximize a conditional likelihood of a class given a word string using an application of the rational growth transform, the plurality of statistical classification components being n-gram language model classifiers that each correspond to a different class, wherein each class corresponds to a different category of subject matter, and wherein training the plurality of statistical classification components comprises:
identifying an optimal number of rational function growth transform iterations and an optimal conditional maximum likelihood (CML) weight βmax to facilitate application of the rational function growth transform, wherein identifying comprises:
splitting a collection of training data into a collection of main data and a collection of held-out data;
using the main data to estimate a series of relative frequencies for the statistical classification components; and
using the held-out data to tune the optimal number of rational function growth transform iterations and the optimal CML weight βmax;


receiving a natural language input;
applying the plurality of statistical classification components to the natural language input so as to classify the natural language input into a particular one or more of the plurality of classes that represent the category or categories of subject matter that is best correlated to the natural language input;
wherein using the held-out data to tune comprises:
fixing a preset number N of rational function growth transform iterations to be run;
fixing a range of values to be explored for determining the optimal CML weight βmax;
for each value βmax, running as many rational function growth transform functions as possible up to N such that the conditional likelihood of the main data increases at each iteration; and
identifying as optimal the number of rational function growth transforms iterations; and the βmax value that maximizes the conditional likelihood of the held-out data; and

wherein training the plurality of statistical classification components further comprises:
pooling the main and held-out data to form a combined collection of training data; and
training the plurality of statistical classification components on the combined collection of training data using the optimal number of rational function growth transform iterations and the optimal CML weight βmax.

2. The method of claim 1, wherein the plurality of statistical classification components are n-gram language models.

3. The method of claim 1, wherein the natural language input is text that is generated by a speech recognition engine.

4. The method of claim 1, wherein the natural language input is a textual representation of a recognized utterance.

5. The method of claim 1, wherein the natural language input is text generated as a textual representation of a handwritten input.

6. The method of claim 1, further comprising preprocessing the natural language input.

7. The method of claim 6, wherein preprocessing comprises removing an article of speech.

8. The method of claim 6, wherein preprocessing comprises transforming the natural language input into an indirect representation.

9. The method of claim 8, wherein transforming comprises transforming into a vector representation.

10. The method of claim 6, wherein preprocessing comprises reducing the natural language input to a select set of extracted features.

11. The method of claim 6, wherein preprocessing comprises reducing the natural language input to only include words included with a predefined vocabulary.

12. The method of claim 6, wherein preprocessing comprises adding an indication of the presence of absence of words previously determined to carry a predefined type of content.

13. The method of claim 6, wherein preprocessing comprises stemming.