Language translation apparatus and method using context-based translation models

Abstract: An apparatus for translating a series of source words in a first language to a series of target words in a second language. For an input series of source words, at least two target hypotheses, each comprising a series of target words, are generated. Each target word has a context comprising at least one other word in the target hypothesis. For each target hypothesis, a language model match score comprises an estimate of the probability of occurrence of the series of words in the target hypothesis. At least one alignment connecting each source word with at least one target word in the target hypothesis is identified. For each source word and each target hypothesis, a word match score comprises an estimate of the conditional probability of occurrence of the source word, given the target word in the target hypothesis which is connected to the source word and given the context in the target hypothesis of the target word which is connected to the source word. For each target hypothesis, a translation match score comprises a combination of the word match scores for the target hypothesis and the source words in the input series of source words. A target hypothesis match score comprises a combination of the language model match score for the target hypothesis and the translation match score for the target hypothesis. The target hypothesis having the best target hypothesis match score is output.

Description: Background of the Invention The invention relates to computerized language translation, such as computerized translation of a French sentence into an English sentence. In EP-A-0 525 470 (originally filed as United States patent application serial number 07/736,278, filed July 25, 1991 entitled "Method and System For Natural Language Translation" by Peter F. Brown et al) there is described a computerized language translation system for translating a text F in a source language to a text E in a target language. The system described therein evaluates, for each of a number of hypothesized target language texts E, the conditional probability P(E|F) of the target language text E given the source language text F. The hypothesized target language text Ê having the highest conditional probability P(E|F) is selected as the translation of the source language text F. Using Bayes' theorem, the conditional probability P(E|F) of the target language text E given the source language text F can be written as P(E|F) = P(F|E)P(E) P(F) Since the probability P(F) of the source language text F in the denominator of Equation 1 is independent of the target language text E, the target language text Ê having the highest conditional probability P(E|F) will also have the highest product P(F|E) P(E). We therefore arrive at In Equation 2, the probability P(E) of the target language text E is a language model match score and may be estimated from a target language model. While any known language model may be used to estimate the probability P(E) of the target language text E, Brown et al describe an n-gram language model comprising a 1-gram model, a 2-gram model, and a 3-gram model combined by parameters whose values are obtained by interpolated estimation. The conditional probability P(F|E) in Equation 2 is a translation match score. As described by Brown et al, the translation match score P(F|E) for a source text F comprising a series of source words, given a target hypothesis E comprising a series of target words, may be estimated by finding all possible alignments connecting the source words in the source text F with the target words in the target text E, including alignments in which one or more source words are not connected to any target words, but not including alignments where a source word is connected to more than one target word. For each alignment and each target word e in the target text E connected to  source words in the source text F, there is estimated the fertility probability n(|e) that the target word e is connected to the  source words in the alignment. There is also estimated for each source word f in the source text F and each target word e in the target text E connected to the source word f by the alignment, the lexical probability t(f|e) that the source word f would occur given the occurrence of the connected target word e. For each alignment and each source word f, Brown et al further estimate the distortion probability a(j|a j ,m) that the source word f is located in position j of the source text F, given that the target word e connected to the source word f is located in position a j in the target text E, and given that there are m words in the source text F. By combining the fertility probabilities for an alignment and for all target words e in the target text E, and multiplying the result by the probability of the number  0 of target words not connected with any source words in the alignment, given the sum of the fertilities  of all of the target words in the target text E in the alignment, a fertility score for the target text E and the alignment is obtained. By combining the lexical probabilities for an alignment and for all source words in the source text F, a lexical score for the alignment is obtained. By combining the distortion probabilities for an alignment and for all source words in the source text F which are connected to a target word in the alignment, and by multiplying the result by 1 /  0 !(where  0 is the number of target words in the target text E that are not connected with any source words), a distortion score for the alignment is obtained. Finally, by combining the fertility, lexical, and distortion scores for the alignment, and multiplying the result by the combinatorial factor a translation match score for the alignment is obtained. (See, Brown et al, Section 8.2.) The translation match score P(F|E) for the source text F and the target hypothesis E may be the sum of the translation match scores for all permitted alignments between the source text F and the target hypothesis E. Preferably, the translation match score P(F|E) for the source text F and the target hypothesis E is the translation match score for the alignment estimated to be most probable. Equation 2 may be used to directly estimate the target hypothesis match score P(F|E)P(E) for a hypothesized target language text E and a source language text F. However, in order to simply the language model P(E) and the translation model P(F|E), and in order to estimate the parameters of these models from a manageable amount of training data, Brown et al estimate the target hypothesis match score P(F|E)P(E) for simplified intermediate forms E' and F' of the target language text E and the source language text F, respectively. Each intermediate target language word e' represents a class of related target language words. Each intermediate source language word f' represents a class of related source language words. A source language transducer converts the source language text F to the intermediate form F'. The hypothesized intermediate form target language text Ê' having the highest hypothesis match score P(F'|E')P(E') is estimated from Equation 2. A target language transducer converts the best matched intermediate target language text Ê' to the target language text Ê. In their language translation system, Brown et al estimate the lexical probability of each source word f as the conditional probability t(f|e) of each source word f given solely the target words e connected to the source word in an alignment. Consequently, the lexical probability provides only a coarse estimate of the probability of the source word f. Summary of the Invention It is an object of the invention to provide an apparatus and method for translating a series of source words in a first language to a series of target words in a second language different from the first language, in which the apparatus and method provide improved estimates of the lexical probabilities of the source words. It is another object of the invention to provide an apparatus and method for translating a series of source words in a first language to a series of target words in a second language different from the first language, in which the lexical probability of a source word is estimated as a conditional probability given the target word connected to the source word in an alignment, and given the context of the target word connected to the source word. According to the invention, an apparatus for translating a series of source words in a first language to a series of target words in a second language different from the first language comprises means for inputting a series of source words. Means are also provided for generating at least two target hypotheses. Each target hypothesis comprises a series of target words selected from a vocabulary of words in the second language. Each target word has a context comprising at least one other word in the target hypothesis. A language model match score generator generates, for each target hypothesis, a language model match score comprising an estimate of the probability of occurrence of the series of words in the target hypothesis. An alignment identifier identifies at least one alignment between the input series of source words and each target hypothesis. The alignment connects each source word with at least one target word in the target hypothesis. A word match score generator is provided for generating, for each source word and each target hypothesis, a word match score comprising an estimate of the conditional probability of occurrence of the source word, given the target word in the target hypothesis which is connected to the source word and given the context of the target word in the target hypothesis which is connected to the source word. A translation match score generator generates, for each target hypothesis, a translation match score comprising a combination of the word match scores for the target hypothesis and the source words in the input series of source words. A hypothesis match score generator is provided for generating a target hypothesis match score for each target hypothesis. Each target hypothesis match score comprises a combination of the language model match score for the target hypothesis and the translation match score for the target hypothesis. The target hypothesis having the best target hypothesis match score is provided at an output. Preferably, each target hypothesis comprises a series of target words selected from a vocabulary comprising words in the second language and a null word representing the absence of a word. The alignment identifier may comprise means for identifying two or more alignments between the input series of source words and each target hypothesis. Each alignment connects each source word with at least one target word in the target hypothesis. The word match score generator generates, for each source word and each alignment and each target hypothesis, a word match score comprising an estimate of the conditional probability of occurrence of the source word, given the target word connected to the source word, and given the context of the target word. The translation match score generator generates, for each target hypothesis, a translation match score comprising a combination of the word match scores for the target hypothesis and the alignments and the source words in the input series of source words. The source text input device may comprise means for transforming the input series of source words into a series of transformed source words. The alignment means identifies at least one alignment between the series of transformed source words and each target hypothesis. Each alignment connects each transformed source word with at least one target word in the target hypothesis. The word match score generator generates, for each transformed source word and each target hypothesis, a word match score comprising an estimate of the conditional probability of occurrence of the transformed source word, given the target word in the target hypothesis which is connected to the transformed word and given the context of the target word in the target hypothesis which is connected to the transformed source word. The translation match score generator generates, for each target hypothesis, a translation match score comprising a combination of the word match scores for the target hypothesis and the transformed source word. Output means are provided for synthesizing a series of output words from the target hypothesis having the best target hypothesis match score, and for outputting the output words. The translation match score for a target hypothesis may comprise the product of the word match scores for the target hypothesis and the source words in the input series of source words. The target hypothesis match score for a target hypothesis may comprise the product of the language model match score for the target hypothesis multiplied by the translation match score for the target hypothesis. The context of the target word in the target hypothesis which is connected to a source word may be contained in at least one of two or more context classes. The estimated conditional probability of occurrence of the source word, given the target word connected to the source word and given the context of the target word, comprises at least one function having a value dependent on the class containing the context of the target word. Alternatively, the estimated conditional probability of occurrence of the source word may comprise a function having a value dependent on the part of speech in the target hypothesis of at least one word in the context of the target word which is connected to the source word, or dependent on the identity of at least one word in the context of the target word which is connected to the source word. The means for outputting the target hypothesis having the best match score may comprise a display. The input means may comprise a keyboard, a computer disk drive, or a computer tape drive. By estimating the lexical probability of a source word as the conditional probability of the source word given the target word connected to the source word in an alignment, and given the context of the target word connected to the source word, the present invention obtains translation match scores with improved accuracy. Brief Description of the Drawings Figure 1 is a block diagram of an example of an apparatus for translating words from a first language to a second language according to the present invention. Figure 2 schematically shows an example of an alignment between a hypothetical series of source words and a hypothetical series of target words. Figure 3 schematically shows an example of a second alignment between the hypothetical series of source words and the hypothetical series of target words of Figure 2. Figure 4 schematically shows an example of a third alignment between the hypothetical series of source words and the hypothetical series of target words of Figure 2. Description of the Preferred Embodiments Figure 1 is a block diagram of an example of an apparatus for translating words from a first language to a second language according to the present invention. The apparatus comprises a source text input device 10 for inputting a series of source words. The source text input device 10 may comprise, for example, a keyboard, a computer disk drive, or a computer tape drive. The source text input device 10 may further comprise means for transforming the input series of source words into a series of transformed source words. Each transformed source word may represent a set of related input source words. For example, each of the input source words in the set {etre, etant, ete, suis, es, est, sommes, etes, sont, fus, fumes, serai, serons, sois, soit, soyons, soyez, soient} are forms of the verb infinitive "etre", and may be transformed to "etre" with a tag representing the tense of the original input source word. The means for transforming the input series of source words into a series of transformed source words may comprise the source transducers described in Sections 3, 4, and 11 of Brown et al, above, which are incorporated herein by reference. In essence, these transducers check and correct the spelling of the input source words, check and correct the case of the input source words, detect titles of documents in the input series of source words, and detect names in the input series of source words. The transducers also tag each input source word with the most likely part of speech of the source word, and flag unknown source words (which are not contained in a stored vocabulary of source words). The means for transforming the input series of source words also collapses multi-word units of input source words into single transformed source words, and splits compound input source words into two or more transformed source words. The means for transforming the input series of source words into a series of transformed source words further performs linguistic or morphological transformations of different forms of a word into a single basic form. Finally, the means for transforming the input series of source words may also estimate the sense of each input source word, and assign that sense to the transformed source word. Table 1 shows a hypothetical example of an input series of source words according to the invention. In this example, the source words are French words. Input Series of Source Words, F f 1 f 2 f 3 f 4 f 5 f 6 La clef est dans la porte . The translation apparatus according to the present invention further comprises a target hypothesis generator 12. The target hypothesis generator 12 generates at least two target hypotheses. Each target hypothesis comprises a series of target words selected from a vocabulary of words in the second language. The vocabulary of words in the second language may be stored in a target language vocabulary store 14. Each target word in a target hypothesis has a context comprising at least one other word in the target hypothesis. An example of a target hypothesis generator is described in Section 14 of Brown et al, cited above. Table 2 shows a hypothetical example of target hypotheses E 1 , E 2 , and E 3 . In this example, the target words are English language words. Target Hypotheses E h E h e h,1 e h,2 e h,3 e h,4 e h,5 e h,6 E 1 The key is in the door . E 2 The key is in the gate . E 3 The wrench is in the door . Preferably, each target hypothesis comprises a series of target words selected from a vocabulary comprising words in the second language, and a null word representing the absence of a word. In Table 2, all of the target hypotheses E h will be considered to include the "null" word. Returning to Figure 1, the translation apparatus comprises a language model match score generator 16 for generating, for each target hypothesis, a language model match score comprising an estimate of the probability of occurrence of the series of words in the target hypothesis. Sections 6 and 7 of Brown et al, cited above, describe an example of a language model match score generator. While any known language model may be used to estimate the probability of occurrence of the series of words in the target hypothesis, Brown et al describe an n-gram language model comprising a 1-gram model, a 2-gram model, and a 3-gram model combined by parameters whose values are obtained by interpolated estimation. The translation apparatus further comprises an alignment identifier 18 for identifying at least one alignment between the input series of source words and each target hypothesis. The alignment connects each source word with at least one target word in the target hypothesis. Figures 2, 3, and 4 schematically show examples of possible alignments between the hypothetical input series of source words in Table 1 and the hypothetical input series of target words in target hypothesis E 1 in Table 2. In each alignment, each source word in the input series of source words F is connected with at least one target word in the target hypothesis E 1 by a solid line. In the alignment of Figure 4, the second occurrence of the source word "La" has no solid line therefrom, and is therefore considered to be connected to the "null" word. Tables 3, 4, and 5 provide alternate descriptions of the alignments of Figures 2, 3, and 4, respectively. Alignment A h,1 For Hypothesis E h (h=1) and Source Words F j f j a j e a j 1 La 1 The 2 clef 2 key 3 est 3 is 4 dans 4 in 5 la 5 the 6 porte 6 door Alignment A h,2 For Hypothesis E h (h=1) and Source Words F j f j a j e a j 1 La 5 the 2 clef 2 key 3 est 3 is 4 dans 4 in 5 la 1 The 6 porte 6 door Alignment A h,2 For Hypothesis E h (h=1) and Source Words F j f j a j e a j 1 La 1 The 2 clef 2 key 3 est 3 is 4 dans 4 in 5 la 0 <null> 6 porte 6 door In each Table, for each parameter j ranging from 1 to m (where m is the number of words in the input series of source words), there is another parameter a j having a single value in the range from 0 to 1 (where 1 is the number of words in the target hypothesis). For a given alignment, each word f j in the input series of source words is connected to the word e a j in the target hypothesis. In general, there are 2 lm possible alignments between a series of m source words and a series of l non-null target words, where each source word may be connected to either the null source word or one or more non-null target words. If each source word is constrained to be connected to only one null or non-null target word, then there are m (l+1) possible alignments. Preferably, only one alignment between the input series of source words and each target hypothesis is identified for obtaining a word match score, described below, for each source word. The one identified alignment for the series of source words and each target hypothesis is preferably that which is produced by the target hypothesis generator, as described in Section 14 of Brown et al, cited above. If the source text input device 10 comprises means for transforming the input series of source words into a series of transformed source words, then the alignment identifier 18 identifies at least one alignment between the series of transformed source words and each target hypothesis. The alignment connects each transformed source word with at least one target word in the target hypothesis. Returning to Figure 1, the translation apparatus further comprises a word match score generator 20. The word match score generator 20 generates, for each source word and each target hypothesis, a word match score comprising an estimate of the conditional probability P(f|e, X) of occurrence of the source word f, given the target word e in the target hypothesis which is connected to the source word f and given the context X of the target word e in the target hypothesis which is connected to the source word f. Table 6 illustrates a hypothetical example of the context X of each target word e a j in the target hypothesis E 1 of Table 2 for the alignment A 1,1 of Table 3 with the input series of source words F of Table 1. Context X of Target Word e a j For Alignment A 1,1 j f j e a j X = {e (a j - 3) , e (a j - 2) , e (a j - 1) , e (a j + 1) , e (a j + 2) , e (a j + 3) } x 1 x 2 x 3 x 4 x 5 x 6 1 La The <null> <null> <null> key is in 2 clef key <null> <null> The is in the 3 est is <null> The key in the door 4 dans in The key is the door . 5 la the key is in door . <null> 6 porte door is in the . <null> <null> As shown in Table 6, in this hypothetical example the context X of a selected target word consists of the three target words preceding the selected target word and the three target words following the selected target word in the target hypothesis. The context also includes punctuation and absence of words. In general, the context of the target word e a j in the target hypothesis E which is connected to a source word f j may be contained in at least one of two or more context classes. The estimated conditional probability of occurrence of a source word, given the target word in the target hypothesis which is connected to the source word and given the context of the target word connected to the source word, may comprise at least one function having a value dependent on the class containing the context of the target word which is connected to the source word. Alternatively, the context may comprise at least one word having a part of speech in the target hypothesis. The estimated conditional probability of occurrence of a source word, given the target word in the target hypothesis which is connected to the source word and given the context of the target word which is connected to the source word, may comprise at least one function having a value dependent on the part of speech in the target hypothesis of at least one word in the context of the target word which is connected to the source word. In another example, the context of the target word in the target hypothesis which is connected to a source word comprises at least one word having an identity. The estimated conditional probability of occurrence of the source word, given the target word in the target hypothesis which is connected to the source word and given the context of the target word which is connected to the source word, comprises at least one function having a value dependent on the identity of at least one word in the context of the target word which is connected to the source word. Equations 3, 4, 5, and 6 are hypothetical examples of functions having values dependent on the context of the target word which is connected to a source word. g 1 (f,e = key,X)= 1, if f = "clef", and the word x 3 in X immediately preceding "key" is "the"; (3) = 0, otherwise. g 2 (f,e= key,X)=1, if f = "clef", and the word x 3 in X immediately preceding "key" is "car"; (4) = 0, otherwise. g 3 (f,e= key,X)=1, if f = "ton", and the word x 3 in X immediately preceding "key" is "the"; (5) = 0, otherwise. g 4 (f,e = key,X) = 1, if f = "ton", and the word x 4 in X immediately following "key", or the word x 5 in X next following "key" is (6) an element of the set {A, B, C, D, E, F, G}; = 0, otherwise. In Equation 3, the function g, has a value of 1, if the source word f is "clef", if the target word e is "key", and if the word in the context X immediately preceding "key" is "the". If these conditions are not met, the context function g 1 has a value of 0. The hypothetical context function g 2 of Equation 4 has a value of 1, if the source word f is "clef", if the target word e is "key", and if the word in the context X immediately preceding "key" is "car". If these conditions are not met, the function g 2 has a value of 0. In Equation 5, the context function g 3 has a value of 1 if the source word f is "ton", if the target word e is "key", and if the word in the context X immediately preceding "key" is "the". If these conditions are not met, the context function g 3 has a value of 0. Finally, the hypothetical context function g 4 in Equation 6 has a value of 1 if the source word f is "ton", the target word e is "key", and if the word in the context X immediately following "key", or the word in the context X next following "key" is an element of the set {A, B, C, D, E, F, G}. If these conditions are not met, the context function g 4 has a value of 0. Table 7 illustrates the evaluation of context functions g(f,e,X) for the source word f="clef", for the target word e="key", and for the context X of the target word "key" in the target hypothesis E 1 of Table 2. As shown in Table 7, the context function g 1 has a value of 1, and the context functions g 2 , g 3 and g 4 have values of 0. As discussed above, the word match score for each source word and each target hypothesis comprises an estimate of the conditional probability P(f|e, X) of occurrence of the source word f given the target word e in the target hypothesis which is connected to the source word f and given the context X of the target word e in the target hypothesis which is connected to the source word f. The word match score may be obtained, for example, using a model defined by Equation 7 as follows. In Equation 7, the functions g i (f,e,X) are functions having values dependent on the context X of the target word e which is connected to the source word f in an alignment between an input series of source words and a target hypothesis. The parameters λ (e,i) are parameters representing the relative strength of each context function g i in predicting the source word f from the target word e in the context X. The quantity N(e,X) is a normalization factor which depends on the target word e and the context X of the target word e, as shown in Equation 8. For the target word e = "key" and for the hypothetical context functions g 1 through g 4 of Equations 3-6, above, Equation 9 is a hypothetical model for generating word match scores for source words f. P(f|e = key, X) = 1 (N(e,X) × e [λ (e = key,1) g 1 (f,e = key,X) + λ (e = key,2) g 2 (f,e = key,X)] × e [λ (e = key,3) g 3 (f,e = key,X) + λ (e = key,4) g 4 (f,e = key, X)] For the purpose of Equation 9, the normalization N(e,X) is given by Equation 10. To illustrate the use of this model, hypothetical values for the model parameters are λ (e = key,1) = .12, λ (e = key,2) = .34, λ (e = key,3) = .09, and λ(e = key,4) = .40 . Table 8 illustrates the computation of the word match score from Equations 7 and 9 for the source word "clef", the target word "key", and the context X of "key" in the target hypothesis E 1 of Table 2. In this hypothetical example, the conditional probability P("clef"|"key", X) of occurrence of the source word "clef" given the target word "key" in the target hypothesis which is connected to the source word "clef" and given the context X of the target word "key" in the target hypothesis which is connected to the source word "clef" is equal to 0.507 (from Equations 9 and 10). If the alignment identifier 18 identifies two or more alignments between the input series of source words and each target hypothesis, the word match score generator generates a word match score for each source word and each alignment and each target hypothesis. Each word match score may be estimated using the model of Equation 7. If the source text input device 10 comprises means for transforming the input series of source words into a series of transformed source words, then the word match score generator generates a word match score for each transformed source word and each target hypothesis. The word match score comprises an estimate of conditional probability of occurrence of the transformed source word, given the target word in the target hypothesis which is connected to the transformed source word and given the context of the target word in the target hypothesis which is connected to the transformed source word. The word match score for a transformed word may also be estimated using the model of Equation 7. The translation apparatus according to the invention further comprises a translation match score generator 22. The translation match score generator 22 generates, for each target hypothesis, a translation match score comprising a combination of the word match scores for the target hypothesis and the source words in the input series of source words. The translation match score for a target hypothesis may, for example, comprise the product of the word match scores for the target hypothesis and the source words in the input series of source words. Table 9 illustrates the computation of a translation match score for the input series of source words f j of Table 1, and for the target words in the target hypothesis E 1 of Table 2. Each word match score P(f j |e a j , X) is obtained from Equation 7. The numbers in Table 9 are hypothetical numbers. For the purpose of illustrating the present invention, the fertility and distortion scores of Brown et al, described above, are assumed equal to one. Returning to Figure 1, the translation apparatus comprises a hypothesis match score generator 24 for generating a target hypothesis match score for each target hypothesis. Each target hypothesis match score comprises a combination (for example, the product) of the language model match score for the target hypothesis and the translation match score for the target hypothesis. As discussed above, the language model match score may be obtained from known language models such as the n-gram language models described by Brown et al. If the alignment identifier 18 identifies two or more alignments between the input series of source words and each target hypothesis, the translation match score for each target hypothesis comprises a combination of the word match scores for the target hypothesis and the alignments and the source words in the input series of source words. If the source text input device 10 comprises means for transforming the input series of source words into a series of transformed source words, the translation match score comprises a combination of the word match scores for the target hypothesis and the transformed source words. The translation apparatus according to the invention further comprises an output 26. The output 26 outputs the target hypothesis having the best target hypothesis match score. The output 26 may comprise, for example, a display or a printer. If the source text input device 10 comprises means for transforming the input series of source words into a series of transformed source words, then the output 26 comprises means for synthesizing a series of output words from the target hypothesis having the best target hypothesis match score. The means for synthesizing output words from the target hypothesis may comprise target transducers such as those described at Section 5 of Brown et al (cited above) which is incorporated herein by reference. For example, the target word "be" with a tag representing the tense of the original input source word, may be transformed to one of the synthesized output words {be, was, were, been, am, are, is, being} which are forms of the verb infinitive "be". As described above, Equation 7 is an example of a model which may be used to obtain word match scores according to the present invention. The context functions g i (f,e,X) of the word match score model, and the parameters λ (e,i) , of the word match score model may be obtained as follows. Candidate context functions g i (f,e,X) may be obtained, for example, by limiting the context X of the target word in the target hypothesis to three words to the left of the target word e and three words to the right of the target word e, as shown in the example of Table 6, above. Next, a training text of source language sentences and target language sentences which are translations of each other is obtained. Corresponding source language sentences and target language sentences which are translations of each other may be identified, for example, by a skilled translator. Preferably, corresponding source language sentences and target language sentences which are translations of each other may be identified automatically, for example, by the method described in Sections 12 and 13 of Brown et al (cited above). For each pair of corresponding source and target sentences in the training text, the estimated most probable alignment between the source words and the target words is found using the method described above used by the alignment identifier 18. Each occurrence of a target word e a j in the training text is then identified and tagged with the source word fj connected to the target word e a j in each alignment. The target word e a j is also tagged with its context X in each target sentence. Table 10 illustrates a hypothetical example of training events for a target word e a j = "key" in a training text of aligned source language sentences and target language sentences. Using the training events for a target word from the training text, candidate context functions g i (f,e,X) may be obtained by first identifying types of context functions. For example, one type of context function tests for the presence of a particular word in one or more positions in the context. Another type of context function tests for the presence of a particular word class (for example, part of speech) in one or more positions in the context. The particular words or word classes to be tested for in a context function for a target word e can be obtained from the words and classes in the context of the target word e in the training text. Alternatively, candidate context functions g i (f,e,X) may be obtained by clustering the training events according to their context X using the method described in Section 7 of Brown et al (cited above). Initially, all of the parameters λ (e,i) of the word match score model of Equation 7 are set equal to zero. For each candidate context function g i (f,e,X), a "measure of merit" G(i) is calculated to according to Equation 11. where In Equations 11 through 14, the conditional probability P(f|X) of a source word f given the context X of the connected target word e is obtained from Equation 7 using the most recent values of the model parameters. The probability (X) of a context X is obtained by counting occurrences of the target word e and the context X in the training text events of the type shown in Table 10, and dividing the count by the total number of events in the training text in which the target word is e. The probability (f,X) of a source word f and a context X are obtained by counting occurrences of the target word e, the context X, and the source word f in the training text events of the type shown in Table 10, and dividing each count by the total number of events in the training text in which the target word is e. The context function g i (f,e,X) having the highest "measure of merit" G(i) from Equation 11 is selected as a context function to be used in Equation 7. The parameter λ (e,i) is obtained by initially setting λ (e,i) =0, and then solving the following Equation 15 for the quantity Δλ (e,i) . A new value of λ (e,i) is obtained by adding the value of Δλ (e,i) to the previous value of λ (e,i) . Using the new value of λ (e,i) , Equation 15 is then again solved for a new value of Δλ (e,i) . The process is repeated, each time updating the value of λ (e,i) , until the value of Δλ (e,i) falls below a selected threshold. This method is known as iterative scaling. Using the new model for the word match score (Equation 7), the "measures of merit" G(i) of Equation 11 are recomputed for the remaining candidate context functions g i (f,e,X) to identify the remaining context function having the highest "measure of merit". The best remaining context function is added to the word match score model of Equation 7 and new values of all of the parameters λ (e,i) are calculated using the iterative scaling method and Equation 15. When the word match score model of Equation 7 contains two or more parameters λ (e,i) , every parameter λ (e,i) is updated exactly once per iteration, so all parameters λ (e,i) converge in the same iteration. The process is repeated on the remaining candidate context functions g i (f,e,X) until the "measure of merit" of the best context function falls below a selected threshold. In the translation apparatus according to the present invention, the target hypothesis generator 12, the language model match score generator 16, the alignment identifier 18, the word match score generator 20, the translation match score generator 22, and the hypothesis match score generator 24 may be suitably programmed general purpose or special purpose digital signal processors. The target language vocabulary store 14 may be computer storage, such as random access memory. The means for transforming the input series of source words into a series of transformed source words in the source text input device 10, and the means for synthesizing a series of output words from the target hypothesis having the best target hypothesis match score of the output 26 may also be suitably programmed general purpose or special purpose digital signal processors.

Claims: An apparatus for translating a series of source words in a first language to a series of target words in a second language different from the first language, said apparatus comprising: means (10) for inputting a series of source words; means (12) for generating at least two target hypotheses, each target hypothesis comprising a series of target words selected from a vocabulary of words in the second language, each target word having a context comprising at least one other word in the target hypothesis; means (16) for generating, for each target hypothesis, a language model match score comprising an estimate of the probability of occurrence of the series of words in the target hypothesis; means (18) for identifying at least one alignment between the input series of source words and each target hypothesis, the alignment connecting each source word with at least one target word in the target hypothesis; means (20) for generating, for each source word and each target hypothesis, a word match score comprising an estimate of the conditional probability of occurrence of the source word, given the target word in the target hypothesis which is connected to the source word and given the context of the target word in the target hypothesis which is connected to the source word; means (22) for generating, for each target hypothesis, a translation match score comprising a combination of the word match scores for the target hypothesis and the source words in the input series of source words; means (24) for generating a target hypothesis match score for each target hypothesis, each target hypothesis match score comprising a combination of the language model match score for the target hypothesis and the translation match score for the target hypothesis; and means (26) for outputting the target hypothesis having the best target hypothesis match score. An apparatus as claimed in Claim 1, characterized in that each target hypothesis comprises a series of target words selected from a vocabulary comprising words in the second language and a null word representing the absence of a word. An apparatus as claimed in Claim 2, characterized in that: the means for identifying at least one alignment identifies two or more alignments between the input series of source words and each target hypothesis, each alignment connecting each source word with at least one target word in the target hypothesis; the word match score generator generates, for each source word and each alignment and each target hypothesis, a word match score comprising an estimate of the conditional probability of occurrence of the source word, given the target word in the target hypothesis which is connected to the source word and given the context of the target word in the target hypothesis which is connected to the source word; the translation match score generator generates, for each target hypothesis, a translation match score comprising a combination of the word match scores for the target hypothesis and the alignments and the source words in the input series of source words. An apparatus as claimed in Claim 2, characterized in that: the input means comprises means for transforming the input series of source words into a series of transformed source words; the alignment means identifies at least one alignment between the series of transformed source words and each target hypothesis, the alignment connecting each transformed source word with at least one target word in the target hypothesis; the word match score generator generates, for each transformed source word and each target hypothesis, a word match score comprising an estimate of the conditional probability of occurrence of the transformed source word, given the target word in the target hypothesis which is connected to the transformed source word and given the context of the target word in the target hypothesis which is connected to the transformed source word; the translation match score generator generates, for each target hypothesis, a translation match score comprising a combination of the word match scores for the target hypothesis and the transformed source words; and the output means comprises means for synthesizing a series of output words from the target hypothesis having the best target hypothesis match score, and means for outputting the synthesized output words. An apparatus as claimed in Claim 2, characterized in that: the translation match score for a target hypothesis comprises the product of the word match scores for the target hypothesis and the source words in the input series of source words; and the target hypothesis match score for a target hypothesis comprises the product of the language model match score for the target hypothesis multiplied by the translation match score for the target hypothesis. An apparatus as claimed in Claim 2, characterized in that: the context of the target word in the target hypothesis which is connected to a source word is contained in at least one of two or more context classes; and the estimated conditional probability of occurrence of the source word, given the target word in the target hypothesis which is connected to the source word and given the context of the target word which is connected to the source word, comprises at least one function having a value dependent on the class containing the context of the target word which is connected to the source word. An apparatus as claimed in Claim 2, characterized in that: the context of the target word in the target hypothesis which is connected to a source word comprises at least one word having a part of speech in the target hypothesis; and the estimated conditional probability of occurrence of the source word, given the target word in the target hypothesis which is connected to the source word and given the context of the target word which is connected to the source word, comprises at least one function having a value dependent on the part of speech in the target hypothesis of at least one word in the context of the target word which is connected to the source word. An apparatus as claimed in Claim 2, characterized in that: the context of the target word in the target hypothesis which is connected to a source word comprises at least one word having an identity; and the estimated conditional probability of occurrence of the source word, given the target word in the target hypothesis which is connected to the source word and given the context of the target word which is connected to the source word, comprises at least one function having a value dependent on the identity of at least one word in the context of the target word which is connected to the source word. An apparatus as claimed in Claim 2, characterized in that the means for outputting the target hypothesis having the best match score comprises a display. An apparatus as claimed in Claim 2, characterized in that the input means comprises a keyboard. An apparatus as claimed in Claim 2, characterized in that the input means comprises a computer disk drive. An apparatus as claimed in Claim 2, characterized in that the input means comprises a computer tape drive. A method of translating a series of source words in a first language to a series of target words in a second language different from the first language, said method comprising the steps of: inputting (10) a series of source words; generating (12) at least two target hypotheses, each target hypothesis comprising a series of target words selected from a vocabulary of words in the second language, each target word having a context comprising at least one other word in the target hypothesis; generating (16), for each target hypothesis, a language model match score comprising an estimate of the probability of occurrence of the series of words in the target hypothesis; identifying (18) at least one alignment between the input series of source words and each target hypothesis, the alignment connecting each source word with at least one target word in the target hypothesis; generating (20), for each source word and each target hypothesis, a word match score comprising an estimate of the conditional probability of occurrence of the source word, given the target word in the target hypothesis which is connected to the source word and given the context of the target word in the target hypothesis which is connected to the source word; generating (22), for each target hypothesis, a translation match score comprising a combination of the word match scores for the target hypothesis and the source words in the input series of source words; generating (24) a target hypothesis match score for each target hypothesis, each target hypothesis match score comprising a combination of the language model match score for the target hypothesis and the translation match score for the target hypothesis; and outputting (26) the target hypothesis having the best target hypothesis match score. A method as claimed in Claim 13, characterized in that each target hypothesis comprises a series of target words selected from a vocabulary comprising words in the second language and a null word representing the absence of a word. A method as claimed in Claim 14, characterized in that: the step of identifying at least one alignment comprises identifying two or more alignments between the input series of source words and each target hypothesis, each alignment connecting each source word with at least one target word in the target hypothesis; the step of generating a word match score comprises generating, for each source word and each alignment and each target hypothesis, a word match score comprising an estimate of the conditional probability of occurrence of the source word, given the target word in the target hypothesis which is connected to the source word and given the context of the target word in the target hypothesis which is connected to the source word; the step of generating a translation match score comprises generating, for each target hypothesis, a translation match score comprising a combination of the word match scores for the target hypothesis and the alignments and the source words in the input series of source words. A method as claimed in Claim 14, characterized in that: the step of inputting comprises the step of transforming the input series of source words into a series of transformed source words; the step of aligning comprises identifying at least one alignment between the series of transformed source words and each target hypothesis, the alignment connecting each transformed source word with at least one target word in the target hypothesis; the step of generating a word match score comprises generating, for each transformed source word and each target hypothesis, a word match score comprising an estimate of the conditional probability of occurrence of the transformed source word, given the target word in the target hypothesis which is connected to the transformed source word and given the context of the target word in the target hypothesis which is connected to the transformed source word; the step of generating a translation match score comprises generating, for each target hypothesis, a translation match score comprising a combination of the word match scores for the target hypothesis and the transformed source words; and the step of outputting comprises the step of synthesizing a series of output words from the target hypothesis having the best target hypothesis match score, and means for outputting the synthesized output words. A method as claimed in Claim 14, characterized in that: the translation match score for a target hypothesis comprises the product of the word match scores for the target hypothesis and the source words in the input series of source words; and the target hypothesis match score for a target hypothesis comprises the product of the language model match score for the target hypothesis multiplied by the translation match score for the target hypothesis. A method as claimed in Claim 14, characterized in that: the context of the target word in the target hypothesis which is connected to a source word is contained in at least one of two or more context classes; and the estimated conditional probability of occurrence of the source word, given the target word in the target hypothesis which is connected to the source word and given the context of the target word which is connected to the source word, comprises at least one function having a value dependent on the class containing the context of the target word which is connected to the source word. A method as claimed in Claim 14, characterized in that: the context of the target word in the target hypothesis which is connected to a source word comprises at least one word having a part of speech in the target hypothesis; and the estimated conditional probability of occurrence of the source word, given the target word in the target hypothesis which is connected to the source word and given the context of the target word which is connected to the source word, comprises at least one function having a value dependent on the part of speech in the target hypothesis of at least one word in the context of the target word which is connected to the source word. A method as claimed in Claim 14, characterized in that: the context of the target word in the target hypothesis which is connected to a source word comprises at least one word having an identity; and the estimated conditional probability of occurrence of the source word, given the target word in the target hypothesis which is connected to the source word and given the context of the target word which is connected to the source word, comprises at least one function having a value dependent on the identity of at least one word in the context of the target word which is connected to the source word. A method as claimed in Claim 14, characterized in that the step of outputting the target hypothesis having the best match score comprises displaying the target hypothesis having the best match score.

Inventors: BERGER ADAM L, BROWN PETER FITZHUGH, DELLA PIETRA STEPHEN ANDREW, DELLA PIETRA VINCENT JOSEPH, KEHLER ANDREW SCOTT, MERCER ROBERT LEROY, BERGER, ADAM L., BROWN, PETER FITZHUGH, DELLA PIETRA, STEPHEN ANDREW, KEHLER, ANDREW SCOTT, MERCER, ROBERT LEROY
Applicants: IBM, INTERNATIONAL BUSINESS MACHINES CORPORATION
Application year: 1994
Main classification: G06F17
IPC codes: G06F17