Abstract:
Training using tree transducers is described. Given sample input/output pairs as training, and given a set of tree transducer rules, the information is combined to yield locally optimal weights for those rules. This combination is carried out by building a weighted derivation forest for each input/output pair and applying counting methods to those forests.

Description:
[0001]     This application claims the benefit of the priority of U.S. Provisional Application Ser. No. 60/553,587, filed Mar. 15, 2004 and entitled “TRAINING TREE TRANSDUCERS”, the disclosure of which is hereby incorporated by reference. 
     
    
     BACKGROUND  
       [0002]     Many different applications are known for tree transducers. These have been used in calculus, other forms of higher mathematics. Tree transducers are used for decidability results in logic, for modeling mathematically the theories of syntax direction translations and program schemata, syntactic pattern recognition, logic programming, term rewriting and linguistics.  
         [0003]     Within linguistics, automated language monitoring programs often use probabilistic finite state transducers that operate on strings of words. For example, speech recognition may transduce acoustic sequences to word sequences using left to right substitution. Tree based models based on probabilistic techniques have been used for machine translation, machine summarization, machine paraphrasing, natural language generation, parsing, language modeling, and others.  
         [0004]     A special kind of tree transducer, often called an R transducer, operates with its roots at the bottom, with R standing for “root to frontier”. At each point within the operation, the transducer chooses a production to apply. That choice is based only on the current state and the current root symbol. The travel through the transducer continues until there are no more state annotated nodes.  
         [0005]     The R transducer represents two pairs, T1 and T2, and the conditions under which some sequence of productions applied to T1 results in T2. This is similar to what is done by a finite state transducer.  
         [0006]     For example, if a finite state transition from state q to state r eats symbol A and outputs symbol B, then this can be written as an R production of q(A x0)-&gt;B (r x0).  
         [0007]     The R transducer may also copy whole trees, transform subtrees, delete subtrees, and other operations.  
       SUMMARY  
       [0008]     The present application teaches a technique of training tree transducers from sample input/output pairs. A first embodiment trains the tree pairs, while a second embodiment trains the tree transducers based on tree/string pairs. Techniques are described that facilitate the computation, and simplify the information as part of the training process.  
         [0009]     An embodiment is described which uses these techniques to train transducers for statistical based language processing: e.g. language recognition and/or language generation. However, it should be understood that this embodiment is merely exemplary, and the other applications for the training of the tree transducers are contemplated.  
     
    
     BRIEF DESCRIPTION OF THE DRAWINGS  
       [0010]     These and other aspects will now be described in detail with reference to the accompanying drawings, wherein:  
         [0011]      FIG. 1  shows derivation trees and their simplifications;  
         [0012]      FIG. 2A  shows a flowchart;  
         [0013]      FIG. 2B  shows a speech engine that can execute the flowchart of  FIG. 2A ;  
         [0014]      FIG. 2C  shows a flowchart of a second embodiment; and  
         [0015]      FIGS. 3 and 4  show a model and parameter table. 
     
    
     DETAILED DESCRIPTION  
       [0016]     The present application describes training of tree transducers. The embodiment describes training of tree transducers, e.g., probabilistic R transducers. These transducers may be used for any probabilistic purpose. In an embodiment, the trained transducers are used for linguistic operations, such as machine translation, paraphrasing, text compression and the like. Training data may be obtained in the form of tree pairs. Linguistic knowledge is automatically distilled from those tree pairs and transducer information.  
         [0017]     TΣ represents the set of trees over the alphabet Σ. An alphabet is a finite set of symbols. Trees may also be written as strings over the set Σ.  
         [0018]     A regular tree grammar or RTG allows compactly representing a potentially infinite set of trees. A weighted regular tree grammar is a set of values, where trees in the set have weights associated with them. The trees can be described as a quadruple G (Σ, N, S, P), where Σ is the alphabet, and N is the set of non-terminals, S is the starting (initial) terminal, and P is the set of weighted productions. The productions are written left to right. A weighted RTG can accept information from an infinite number of trees. More generally, the weighted RTG can be any list which includes information about the trees in a tree grammar, in a way that allows the weight to change rather than a new entry each time the same information is reobtained.  
         [0019]     The RTG can take the following form:  
                   TABLE I                           Σ =   {S, NP, VP, PP, PREP, DET, N, V, run, the, of, sons, daughters}       N =   {qnp, qpp, qdet, qn, qprep}       S =   q       P =   {q → 1.0  S(qnp, VP(VB(run))),           qnp → 0.6  NP(qdet, qn),           qnp → 0.4  NP(qnp, qpp),           qpp → 1.0  PP(qprep, np),           qdet → 1.0  DET(the),           qprep → 1.0  PREP(of),           qn → 0.5  N(sons),           qn → 0.5  N(daughters)}                  
 
         [0020]     The tree is parsed from left to right, so that the leftmost non-terminal is the next one to be expanded as the next item in the RTG. The left most derivations of G build a tree pre-order from left to right according to 
 
 LD ( G )≡{( t , (( p   1   , r   1 ), . . . , ( p   n   , r   n ))ε D   G |∀1≦ i&lt;n:p   i+1 ≮ lez   p   i }
 
         [0021]     The total weight of t in G is given by W G :T Σ →R, the sum of leftmost den derivations producing t:  
             W   G     ⁡     (   t   )       ≡       ∑       (     t   ,   h     )     ∈     LD   ⁡     (   G   )           ⁢       ∏     i   =   1     n     ⁢       w   i     ⁢           ⁢   where           ⁢               
               ⁢     h   =         (       h   1     ,   …   ⁢           ,     h   n       )     ⁢           ⁢   and   ⁢           ⁢     h   i       =     (       p   i     ,     (       l   i     ,     r   i     ,     w   i       )       )             
 
         [0022]     Therefore, for every weighted context free grammar, there is an equivalent weighted RTG that produces weighted derivation trees. Each weighted RTG is generated from exactly the recognizable tree language.  
         [0023]     An extended transducer are is also used herein. According to this extended transducer xR, an input subtree matching pattern in state q is converted into its right hand side (“rhs”), and it&#39;s Q paths are replaced by their recursive transformations. The right hand side of these rules may have no states for further expansions (terminal rules) or may have states for further expansion. In notation form  
       ⇒     x   ≡     {         (       (     a   ,   h     )     ,     (     b   ,     h   ·     (     i   ,     (     q   ,   pattern   ,   rhs   ,   w     )       )         )       )     ❘     
     ⁢       (     q   ,   pattern   ,   rhs   ,   w     )     ∈     R   ⋀     
     ⁢   i     ∈       paths   a     ⋀   q         =           label   a     ⁡     (   i   )       ⋀     pattern   ⁡     (     a   ↓     (     i   ·     (   1   )       )       )         =       1   ⋀     
     ⁢   b     =     a   ⁡     [     i   ←     rhs   ⁡     [             p   ←       q   ′     ⁡     (     a   ↓     (     i   ·     (   1   )     ·     i   ′       )       )         ,                 ∀     p   ∈       paths   rhs     ⁢     :     ⁢       label   rhs     ⁡     (   p   )             =     (       q   ′     ,     i   ′       )             ]         ]             }           
 
 where, b is derived from a by application of a 
    rule (queue, pattern)-&gt;rhs     to an unprocessed input subtree ai which is in state q. 
 
 Its output is replaced by the output given by rhs. Its non-terminals are replaced by the instruction to transform descendent input subtrees. 
   
 
         [0026]     The sources of a rule r=(q, l, rhs, w) ε R are the input-paths in the rhs: 
 
sources( rhs )≡{ i   l   |∃p ε paths rhs ( Q× paths),  q   l    εQ :label rhs ( p )=( q   l   , i   l )}
 
         [0027]     The reflexive, transitive closure of          x is written          * x , and the derivations of X, written D(X), are the ways of transforming input tree I (with its root in the initial state) to an output tree O: 
 
 D ( X )≡{( I, O, h )ε T   Σ   ×T   Δ ×(paths× P )*|( Q   i ( I )( ))          * x ( O, h )}
 
 The leftmost derivations of X transform the tree-preorder from left to right (always applying a transformation rule to the state-labeled subtree furthest left in its string representation): 
 
 LD ( X )≡{( I, O , (( p   1   , r   1 ), . . . , ( p   n ,r n ))ε D ( X )|∀1≦ i&lt;n:p   i+1 ≮ lez   p   i }
 
 The total weight of (I, O) in X is; given by W x :T Σ ×T Δ →R, the sum of leftmost derivations transforming I to O:  
         W   ⁢           ⁢     x   ⁡     (     I   ,   O     )         ≡       ∑       (     I   ,   O   ,   h     )     ∈     LD   ⁡     (   X   )           ⁢       ∏     i   =   1     n     ⁢       w   i     ⁢           ⁢   where             
       h   =         (       h   1     ,   …   ⁢           ,     h   n       )     ⁢           ⁢   and   ⁢           ⁢     h   i       =     (       p   i     ,     (       l   i     ,     r   i     ,     w   i       )       )           
 
         [0028]     The tree transducers operate by starting at an initial state root and recursively applying output generating rules until no states remain, so that there is a complete derivation. In this way, the information (trees and transducer information) can be converted to a derivation forest, stored as a weighted RTG.  
         [0029]     The overall operation is illustrated in the flow chart of  FIG. 2A ; and  FIG. 2B  illustrates an exemplary hardware device which may execute that flowchart. For the application of language translation, a processing module  250  receives data from various sources  255 . The sources may be the input and output trees and transducer rules described herein. Specifically, this may be the translation memories, dictionaries, glossaries, Internet, and human-created translations. The processor  250  processes this information as described herein to produce translation parameters which are output as  260 . The translation parameters are used by language engine  265  in making translations based on input language  270 . In the disclosed embodiment, the speech engine is a language translator which translates from a first language to a second language. However, alternatively, the speech engine can be any engine that operates on strings of words such as a language recognition device in speech recognition device, a machine paraphraser, natural language generator, modeler, or the like.  
         [0030]     The processor  250  and speech engine  265  may be any general purpose computer, and can be effected by a microprocessor, a digital signal processor, or any other processing device that is capable of executing the steps described herein.  
         [0031]     The flowchart described herein can be instructions which are embodied on a machine-readable medium such as a disc or the like. Alternatively, the flowchart can be executed by dedicated hardware, or by any known or later discovered processing device.  
         [0032]     The system obtains a plurality of input and output trees or strings, and transducer rules with parameters. The parameters may then be used for statistical machine translation. More generally, however, the parameters can be used for any tree transformation task.  
         [0033]     At  210 , the input tree, output tree and tranducer rules are converted to a large set of individual derivation trees, “a derivation forest”.  
         [0034]     The derivation forest effectively flattens the rules into trees of depth one. The root is labeled by the original rule. All the non-expanding A labeled nodes of the rule are deterministically listed in order. The weights of the derivation trees are the products of the weights of the rules in those derivation trees.  
         [0035]      FIG. 1  illustrates an input tree  100  being converted to an output tree  110  and generating derivation trees  130 .  FIG. 1  also shows the transducer rules  120 . All of these are inputs to the system, specifically the input and output tree are the data that is obtained from various language translation resources  255 , for example. The transducer rules are known. The object of the parsing carried out in  FIG. 1  is to derive the derivation trees  130  automatically.  
         [0036]     The input/output tree pairs are used to produce a probability estimate for each production in P, that maximizes the probability of the output trees given the input trees. The result is to find a local maximum. The present system uses simplifications to find this maximum.  
         [0037]     The technique describes the use of memoization by creating the weighted RTG&#39;s. Memoization means that the possible derivations for a given produced combination are constant. This may prevent certain combinations from being computed more than once. In this way, the table, here the wRTG can store the answers for all past queries and return those instead of recomputing.  
         [0038]     Note the way in which the derivation trees are converted to weighted RTG&#39;s. At the start, rule one will always be applied, so the first RTG represents a 1.0 probability of rule one being applied. The arguments of rule one are 1.12 and 2.11. If 1.12 is applied, rule 2 is always used, while 2.11 can be either rule 3 or rule 4, with the different weightings for the different rules being also shown.  
         [0039]     At  230 , the weighted RTG is further processed to sum the weights of the derivation trees. This can use the “inside-outside” technique, (Lari, et al, “The estimation of stochastic context free grammars using the inside-outside algorithm, Computer Speech and Language, 4, pp 35-36). The inside-outside technique observes counts and determines each time a rule gets used. When a rule gets used, the probability of that rule is increased. More specifically, given a weighted RTG with parameters, the inside outside technique enables computing the sums of weights of the trees derived using each production. Inside weights are the sum of all weights that can be derived for a non-terminal or production. This is a recursive definition. The inside weights for a production are the sum of all the weights of the trees that can be derived from that production.  
           β   G     ⁡     (     n   ∈   N     )       ≡       ∑       (     n   ,   r   ,   w     )     ∈   P       ⁢     w   ·       β   G     ⁡     (   r   )               
           β   G     (       r   ∈       T   Σ     ⁡     (   N   )         ❘       (     n   ,   r   ,   w     )     ∈   P       }     ≡       ∏     p   ∈       paths   r     ⁡     (   N   )           ⁢       β   G     ⁡     (       label   r     ⁡     (   p   )       )             
 
         [0040]     The outside weights for a non-terminal are the sum of weights of trees generated by the weighted RTG that have derivations containing it but exclude its inside weights, according to  
           α   G     ⁡     (     n   ∈   N     )       ≡     
     ⁢     {                           1           if   ⁢           ⁢   n     =   S                             ∑     p   ,         (       n   ′     ,   r   ,   w     )     ∈     P   :       label   r     ⁡     (   p   )           =   n         ⁢     w   ·       α   G     ⁡     (     n   ′     )             ︷     uses   ⁢           ⁢   of   ⁢           ⁢   n   ⁢           ⁢   in   ⁢           ⁢   productions         ·         ∏       p   ′     ∈         paths   r     ⁡     (   N   )       -     {   p   }           ⁢       β   G     ⁡     (       label   r     ⁡     (     p     ′   ⁢               )       )           ︸     sibling   ⁢           ⁢   nonterminals           ⁢                   otherwise   .                 
 
         [0041]     Estimation maximization training is then carried out at  240 . This maximizes the expectation of decisions taken for all possible ways of generating the training corpus, according to expectation, and then maximization, as:  
       ∀     p   ∈       parameters   ⁢     :     ⁢     counts   p       ≡       E     t   ∈     training             ⁢           [               ∑     d   ∈     derivations   i         ⁢       (     #   ⁢           ⁢   of   ⁢           ⁢   times   ⁢           ⁢   p   ⁢           ⁢   used   ⁢           ⁢   in   ⁢           ⁢   d     )     ·                   weight   parameters     ⁡     (   d   )                 ∑     d   ∈     derivations   i         ⁢       weight   parameters     ⁡     (   d   )           ]                 
 
         [0042]     2. Maximizing by assigning the counts to the parameters and renormalizing  
       ∀     p   ∈     parameters   :     p   ←       counts   p       Z   ⁡     (   p   )                   
 
         [0043]     Each iteration increases the likelihood until a local maximum is reached.  
         [0044]     The step  230  can be written in pseudocode as:  
           For   ⁢           ⁢   each   ⁢           ⁢     (     i   ,   o   ,     w   example       )       ∈     T   :       //   Estimate       
           i   .           ⁢   Let     ⁢           ⁢   D     ≡     d     i   ,   o           
           ii   .           ⁢   compute     ⁢           ⁢     α   D       ,         β   D     ⁢           ⁢   using   ⁢           ⁢   latest   ⁢           ⁢   W     //     inside   ⁢     -     ⁢   outside   ⁢           ⁢   weights           
           iii   .           ⁢   For     ⁢           ⁢   each   ⁢           ⁢   prod     =       (     n   ,   rhs   ,   w     )     ∈     P   :         label   r     ⁢     hs   ⁡     (     (           )     )         ∈     R   ⁢           ⁢   in               
               ⁢       derivation   ⁢           ⁢   wRTG   ⁢           ⁢   D     =       (     R   ,   N   ,   S   ,   P     )     :           ⁢     
     ⁢           ⁢       A   .           ⁢       γ   D     ⁡     (   prod   )         ←         α   G     ⁡     (   n   )       ·   w   ·       β   G     ⁡     (   rhs   )                   
               ⁢         B   .           ⁢   Let     ⁢           ⁢   rule     ≡       label   rhs     ⁡     (     (           )     )             
               ⁢       C   .           ⁢     count   rule       ←       count   rule     +       w     example   ⁢               ·         γ   D     ⁡     (   prod   )           β   D     ⁡     (   S   )                   
         iv   .           ⁢   L     ←     L   +     log   ⁢           ⁢         β   D     ⁡     (   S   )       ·     w   example               
         For   ⁢           ⁢   each   ⁢           ⁢   r     =         (     q   ,   pattern   ,   rhs   ,   w     )     ∈     R   :       //   Maximize         
         i   .           ⁢     w   r       ←       count   r       Z   ⁡     (     counts   ,   r     )             
       δ   ←       L   -   lastL          L              
         lastL   ←   L     ,     itno   ←     itno   +   1           
 
 By using the weighted RTG&#39;s, each estimation maximum iteration takes an amount of time that is linear to the size of the transducer. For example, this may compute the sum of all the counts for rules having the same state, to provide model weights for a joint probability distribution of the input output tree pairs. This joint normalization may avoid many different problems. 
 
         [0045]     The above has described tree-to-tree transducers. An alternative embodiment describes tree to string transducers is shown in the flowchart of  FIG. 2C . This transducer will be used when a tree is only available at the input side of the training corpus. Note that  FIG. 2C  is substantially identical to  FIG. 2A  other than the form of the input data.  
         [0046]     The tree to string transduction is then parsed using an extended R transducer as in the first embodiment. This is used to form a weighted derivation tree grammar. The derivation trees are formed by converting the input tree and the string into a flattened string of information which may include trees and strings.  285  of  FIG. 5   c  simply refers to this as derivation information. The parsing of the tree to string transduction may be slightly different then the tree to tree transduction. Instead of derivation trees, there may be output string spans. A less constrained alignment may result.  
         [0047]     This is followed in  FIG. 2C  by operations that are analogous to those in  FIG. 2A : specifically, creation of the weighted RTG, the same as the weight summing of  230  and the expectation maximization of  240 .  
       EXAMPLE  
       [0048]     An example is now described here in of how to cast a probabilistic language model as an R transducer.  
         [0049]     Table 2 shows a bilingual English tree Japanese string training corpus.  
                           TABLE 2                                       ENGLISH:   (VB (NN hypocrisy)                (VB is)                (JJ (JJ abhorrent)                 (TO (TO to) (PRP them))))           JAPANESE:   kare ha gizen ga daikirai da           ENGLISH:   (VB (PRP he)                (VB has)                (NN (JJ unusual) (NN ability))                (IN (IN in) (NN english)))           JAPANESE:   kare ha eigo ni zubanuke-ta sainou wo mot-te iru           ENGLISH:   (VB (PRP he)                (VB was)                (JJ (JJ ablaze)                 (IN (IN with) (NN anger))))           JAPANESE:   kare ha mak-ka ni nat-te okot-te i-ta           ENGLISH:   (VB (PRP i)                (VB abominate)                (NN snakes))           JAPANESE:   hebi ga daikirai da            etc.                      
 
         [0050]      FIGS. 3 and 4  respectively show the generative model and its parameters. The parameter values that are shown are learned via expectation maximization techniques as described in Yamada and Knight 2001.  
         [0051]     According to the model, an English tree becomes a Japanese string in four operations.  FIG. 3  shows how the channel input is first reordered, that is its children are permeated probabilistically. If there are three children, then there are six possible permutations whose probabilities add up to one. The reordering is done depending only on the child label sequence.  
         [0052]     In  320 , a decision is made at every node about inserting a Japanese function word. This is a three-way decision at each node, requiring determination of whether the word should be inserted to the left, to the right, or not inserted at all. This insertion technique at  320  depends on the labels of the node and the parent. At  330 , the English leaf words are translated probabilistically into Japanese, independent of context. At  340 , the internal nodes are removed, leaving only the Japanese string.  
         [0053]     This model can effectively provide a formula for 
    P. (Japanese string|English tree) 
 
 in terms of individual parameters. The expectation maximization training described herein seeks to maximize the product of these conditional probabilities based on the entire tree-string corpus. 
   
 
         [0055]     First, an xRs tree to string transducer is built that embodies the probabilities noted above. This is a four state transducer. For the main-start state, the function q, meaning translate this tree, has three productions: 
        q x→i x, r x     q x→r x, i x     q x→r x 
 
 State 5 means “produce a Japanese word out of thin air.” There is an i production for each Japanese word in the vocabulary. 
    i x→“de”    i x→“kuruma”    i x→“wa”    . . .        
 
         [0063]     State r means “reorder my children and then recurse”. For internal nodes, this includes a production for each parent/child sequence, and every permutation thereof: 
        r NN(x0:CD, x1:NN)→q x0, q x1     r NN(x0:CD, x1:NN)→q x1, q x0     . . .        
 
         [0067]     The RHS then sends the child subtrees back to state q for recursive processing. For English leaf nodes, the process instead transitions to a different state t to prohibit any subsequent Japanese function word insertion: 
        r NN(x0:“car”)→t x0     r CC (x0:“and”)→t x0     . . .        
 
         [0071]     State t means “translate this word”. There is a production for each pair of cooccuring in English and Japanese words. 
        t “car”→“kuruma”    t “car”→*e*     t “car”→*e*     . . .        
 
         [0076]     Each production in the XRS transducer has an associated weight, and corresponds to exactly 1 of the model parameters.  
         [0077]     The transducer is unfaithful in one respect, specifically the insert function word decision is independent of context. It should depend on the node label and the parent label. This is addressed by fixing the q and r production. Start productions are used: 
        q x:VB→q.TOP.VB x     q x:JJ→q.TOP.JJ x     . . .        
 
         [0081]     States are used, such as q.top.vb which states mean something like “translate this tree, whose route is vb”. Every parent-child payer in the corpus gets its own set of insert function word productions: 
        q.TOP.VB x →i x, r x     q.TOP.VB x →r x, i x     q.TOP.VB x →r x     q.VB.NN x →i x, r x     q.VB.NN x →r x, i x     q.VB.NN x →r x     . . .        
 
         [0089]     Finally, the R productions need to send parent child information when they recurse to the q.parent.child states.  
         [0090]     The productions stay the same. Productions for appraisal translations and others can also be added.  
         [0091]     Although only a few embodiments have been disclosed in detail above, other modifications are possible, and this disclosure is intended to cover all such modifications, and most particularly, any modification which might be predictable to a person having ordinary skill in the art. For example, an alternative embodiment could use the same techniques for string to string training, based on tree based models or based only on string pair data. Another application is to generate likely input trees from output trees or vide versa. Also, and to reiterate the above, many other applications can be carried out with tree transducers, and the application of tree transducers to linguistic issues is merely exemplary.  
         [0092]     Also, only those claims which use the words “means for” are intended to be interpreted under 35 USC 112, sixth paragraph. Moreover, no limitations from the specification are intended to be read into any claims, unless those limitations are expressly included in the claims  
         [0093]     All such modifications are intended to be encompassed within the following claims