But for configurations from which T cannot be derived, the dynamic oracle returns transitions leading to the best parse A (in terms of Hamming distance from T ) which is reachable from c. This is the behavior expected from a dynamic oracle, as defined in Section 4.1.
in order to derive a dynamic oracle for an arc-decomposable transition system, it is sufficient to show that the transition cost function C(t; c, T ) can be computed efficiently for that system.