To approximate the intractable decoding problem of (2), most MT systems (Koehn et al., 2003;Chiang, 2007) use a simple Viterbi approximation, Clearly, (5) replaces the sum in (2) with a max.
it approximates the probability of a translation string by the probability of its mostprobable derivation.