We present an improvement of the online reordering algorithm for non-projective parsing presented by Nivre in 2009, which reduces the number of Swap transition and thus the total execution time on guided parsing.

Analysis and improvement of a non-projective dependency parsing algorithm

Camillo, Marco
2016/2017

Abstract

We present an improvement of the online reordering algorithm for non-projective parsing presented by Nivre in 2009, which reduces the number of Swap transition and thus the total execution time on guided parsing.
2016-12-14
parsing, grammar, NLP
File in questo prodotto:
File Dimensione Formato  
Tesi.pdf

accesso aperto

Dimensione 699.06 kB
Formato Adobe PDF
699.06 kB Adobe PDF Visualizza/Apri

The text of this website © Università degli studi di Padova. Full Text are published under a non-exclusive license. Metadata are under a CC0 License

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.12608/24012