In SMT, every English sentence e is considered as a translation of a given French sentence f with probability P r (f |e).
the problem of translating f can be viewed as a problem of finding the most probable translation of f : e * = argmax e P r(e|f ) = argmax e P r(f |e)P (e).