Show simple item record

Files in this item


Item metadata

dc.contributor.authorNederhof, Mark Jan
dc.identifier.citationNederhof , 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 .
dc.identifier.otherPURE: 259065142
dc.identifier.otherPURE UUID: 309939cb-5253-4ef3-91c8-bda773cea8f2
dc.identifier.otherORCID: /0000-0002-1845-6829/work/58531291
dc.description.abstractWe 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.
dc.relation.ispartofTransactions of the Association for Computational Linguisticsen
dc.rights© 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
dc.subjectFormal language theoryen
dc.subjectAutomata theoryen
dc.subjectQA75 Electronic computers. Computer scienceen
dc.subjectComputational Theory and Mathematicsen
dc.titleCalculating the optimal step in shift-reduce dependency parsing : from cubic to linear timeen
dc.typeJournal articleen
dc.description.versionPublisher PDFen
dc.contributor.institutionUniversity of St Andrews.School of Computer Scienceen
dc.description.statusPeer revieweden

This item appears in the following Collection(s)

Show simple item record