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

19/04/2021

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

Mark-Jan Nederhof

Keywords:

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’.

EACL

This is an embedded video. Talk and the respective paper are published at EACL 2021 virtual conference. If you are one of the authors of the paper and want to manage your upload, see the question "My papertalk has been externally embedded..." in the FAQ section.

Comments

Post Comment

no comments yet