In this way, the search process only requires the use of a regular SMT system which filters its phrase-table in order to obtain those translations of f that are compatible with e. As noted in [16], this technique has no practical interest when applied on regular tasks.
the technique is not applicable when the alignments cannot be generated due to coverage problems of the phrase-based model (i.e.