We present a method that allows for fast extraction of very large n-best lists based on the k shortest paths algorithm by (Eppstein, 1998).
most reference translations would never have been selected as final candidates.