From the set of all possible sentences of the target language, we are interested in that with the highest probability according to the following equation: {Pr(e I 1 | f J 1 )} Early works on SMT decompose Pr(e I 1 | f J 1 ) applying Bayes' theorem and thus obtaining two new distributions, Pr(e I 1 ) and Pr( f J 1 |e I 1 ), which are approximated by means of parametric statistical models.
pr(e I 1 ) is modeled by means of a language model, and pr( f J 1 |e I 1 ) is modeled by means of a translation model.