Moreover, the inference procedure for each sentence pair is non-trivial, proving NP-complete for learning phrase based models  or a high order polynomial (O(|f | 3 |e| 3 )) 1 for a sub-class of weighted synchronous context free grammars (Wu, 1997).
for such models both the parameterisation and approximate inference techniques are fundamental to their success.