(2008) propose linear BLEU, an approximation to the BLEU score to efficiently perform MBR decoding when the search space is represented with lattices.
our hypotheses space is the full set of finite-length strings in the target vocabulary and can not be represented in a lattice.