Constraining search that way increases the run time as the γ-bounds are lower.
greedy and beam search both achieve reasonable BLEU scores but rely on a high number of search errors 5 to not be affected by a serious NMT model error: For 51.8% of the sentences, NMT assigns the global best model score to the empty translation, i.e.