This method has the potential to be very fast: linear in k. However, because the number of possible translations is exponential in n, we may have to set k extremely high in order to find the true best translation (taking the LM into account) or something acceptably close to it.
then, the third item is enumerated and merged with the first (unlike in the k-best algorithm).