Calculating the optimal step of arc-eager parsing for non-projective trees
Mark-Jan Nederhof · 2021
It is shown that the optimal next step of an arceager parser relative to a non-projective dependency structure can be calculated in cubic time, solving an open problem in parsing theory.Applications are in training of parsers by means of a 'dynamic oracle'.