Motivated by these work, we use a translation forest (Section 3) which contains both "reference" derivations that potentially yield the reference translation and also neighboring "non-reference" derivations that fail to produce the reference translation.
1 the complexity of generating this translation forest is up to O(n 6 ), because we still need biparsing to create the reference derivations.