Calculating the optimal step in shift-reduce dependency parsing : from cubic to linear time
MetadataShow full item record
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.
Nederhof , M J 2019 , ' Calculating the optimal step in shift-reduce dependency parsing : from cubic to linear time ' , Transactions of the Association for Computational Linguistics , vol. 7 , pp. 283-296 . https://doi.org/10.1162/tacl_a_00268
Transactions of the Association for Computational Linguistics
© 2019 Association for Computational Linguistics. This is an open-access article distributed under the terms of the Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. For a full description of the license, please visit https://creativecommons.org/licenses/by/4.0/legalcode.
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.