• DOI:10.18653/v1/N19-1076
Corpus ID: 84187308

Left-to-Right Dependency Parsing with Pointer Networks

@article{FernndezGonzlez2019LefttoRightDP,
  title={Left-to-Right Dependency Parsing with Pointer Networks},
  author={Daniel Fern{\'a}ndez-Gonz{\'a}lez and Carlos G{\'o}mez-Rodr{\'i}guez},
  journal={ArXiv},
  year={2019},
  volume={abs/1903.08445}
}

Daniel Fernández-González, Carlos Gómez-Rodríguez

Published 2019

Computer Science

ArXiv

We propose a novel transition-based algorithm that straightforwardly parses sentences from left to right by building $n$ attachments, with $n$ being the length of the input sentence. Similarly to the recent stack-pointer parser by Ma et al. (2018), we use the pointer network framework that, given a word, can directly point to a position from the sentence. However, our left-to-right approach is simpler than the original top-down stack-pointer parser (not requiring a stack) and reduces transition… CONTINUE READING

View PDF on arXiv

Save to Library

Create Alert

Cite

Launch Research Feed