However, non-deterministic oracles aim to allow a deterministic parser to recover from incorrect actions by including information in the training of the local classifiers based on the notion that there may be several correct actions at a given point, as long as a desired tree remains reachable.
our local classifier, or oracle, is trained to encode a notion of state quality or approximate global loss that is specifically designed for search.