Calculating the optimal step of arc-eager parsing for non-projective trees
Mark-Jan Nederhof
Syntax: Tagging, Chunking, and Parsing Long paper Paper
You can open the pre-recorded video in separate windows.
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'.
NOTE: Video may display a random order of authors.
Correct author list is at the top of this page.