But it is remarkable that the only failure to beat the baseline in terms of BLEU is when the algorithm is tasked with placing four random constraints (before BPE) with a beam size of 5.
dBA never has any trouble placing phrasal constraints (dashed lines).