Calculating the optimal step of arc-eager parsing for non-projective trees

Abstract

It is shown that the optimal next step of an arc-eager 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'.

Tasks

Reproductions