Calculating the Optimal Step in Shift-Reduce Dependency Parsing: From Cubic to Linear Time | Zendy

Mark-Jan Nederhof | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Calculating the Optimal Step in Shift-Reduce Dependency Parsing: From Cubic to Linear Time

Author(s) -

Mark-Jan Nederhof

Publication year - 2019

Publication title -

transactions of the association for computational linguistics

Language(s) - English

Resource type - Journals

ISSN - 2307-387X

DOI - 10.1162/tacl_a_00268

Subject(s) - dependency (uml) , computer science , oracle , dependency grammar , time complexity , parsing , algorithm , artificial intelligence , theoretical computer science , programming language

We present a new cubic-time algorithm to calculate the optimal next step in shift-reduce dependency parsing, relative to ground truth, commonly referred to as dynamic oracle. Unlike existing algorithms, it is applicable if the training corpus contains non-projective structures. We then show that for a projective training corpus, the time complexity can be improved from cubic to linear.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research