10 papers
Reducing Discontinuous to Continuous Parsing with Pointer Network Reordering
Daniel Fernández-González, Carlos Gómez-Rodríguez
Discontinuous constituent parsers have always lagged behind continuous approaches in terms of accuracy and speed, as the presence of constituents with discontinuous yield introduce…
Transition-based Semantic Dependency Parsing with Pointer Networks
Daniel Fernández-González, Carlos Gómez-Rodríguez
Transition-based parsers implemented with Pointer Networks have become the new state of the art in dependency parsing, excelling in producing labelled syntactic trees and outperfor…
Enriched In-Order Linearization for Faster Sequence-to-Sequence Constituent Parsing
Daniel Fernández-González, Carlos Gómez-Rodríguez
Sequence-to-sequence constituent parsing requires a linearization to represent trees as sequences. Top-down tree linearizations, which can be based on brackets or shift-reduce acti…
Discontinuous Constituent Parsing with Pointer Networks
Daniel Fernández-González, Carlos Gómez-Rodríguez
One of the most complex syntactic representations used in computational linguistics and NLP are discontinuous constituent trees, crucial for representing all grammatical phenomena…
Left-to-Right Dependency Parsing with Pointer Networks
Daniel Fernández-González, Carlos Gómez-Rodríguez
We propose a novel transition-based algorithm that straightforwardly parses sentences from left to right by building attachments, with being the length of the input sentenc…
Dynamic Oracles for Top-Down and In-Order Shift-Reduce Constituent Parsing
Daniel Fernández-González, Carlos Gómez-Rodríguez
We introduce novel dynamic oracles for training two of the most accurate known shift-reduce algorithms for constituent parsing: the top-down and in-order transition-based parsers.…