First of all, we adapt the computation of the set of individually unreachable arcs U(c, t G ) to the new algorithm.
if c has focus words i and j (i.e., c = λ 1 |i, λ 2 , j|B, A ), then an arc x → y is in U(c, t G ) if it is not in A, and at least one of the following holds: • j > max(x, y), (i.e., we have read too far in the string and can no longer get max(x, y) as Shift: Figure 2: Transitions of the non-monotonic Covington non-projective dependency parser.