In order to maximize BLEU score using the algorithm described in Section 4, we need a sizable trigram forest as a starting point.
this technique, together with the progressive search at previous stages, gives a decoder that produces the highest BLEU score we have obtained on the data in a very reasonable amount of time.