1 However, the complexity of generating this translation forest is up to O(n 6 ), because we still need biparsing to create the reference derivations.
we propose a method to fast generate a subset of the forest.