We extract a k-best list from the forest, then select the translation that yields the highest BLEU score relative to the forest's expected n-gram counts.
let BLEU(e; r) compute the similarity of a sentence e to a reference r based on the n-gram counts of each.