activity
20152023
most citedFaster Shift-Reduce Constituent Parsing with a Non-Binary, Bottom-Up Strategy

20 citations · 25 across the 10 of their papers we have counts for

collaborators

17 papers

cs.CL2023

Structured Sentiment Analysis as Transition-based Dependency Graph Parsing

Daniel Fernández-González

Structured sentiment analysis (SSA) aims to automatically extract people's opinions from a text in natural language and adequately represent that information in a graph structure.…

cs.CL2022

Shift-Reduce Task-Oriented Semantic Parsing with Stack-Transformers

Daniel Fernández-González

Intelligent voice assistants, such as Apple Siri and Amazon Alexa, are widely used nowadays. These task-oriented dialogue systems require a semantic parsing module in order to proc…

cs.CL2022

Transition-based Semantic Role Labeling with Pointer Networks

Daniel Fernández-González

Semantic role labeling (SRL) focuses on recognizing the predicate-argument structure of a sentence and plays a critical role in many natural language processing tasks such as machi…

cs.CL2021

Discontinuous Grammar as a Foreign Language

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

In order to achieve deep natural language understanding, syntactic constituent parsing is a vital step, highly demanded by many artificial intelligence systems to process both text…

cs.CL2021

Dependency Parsing with Bottom-up Hierarchical Pointer Networks

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

Dependency parsing is a crucial step towards deep language understanding and, therefore, widely demanded by numerous Natural Language Processing applications. In particular, left-t…

cs.CL2021

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…

cs.CL2020★ 5 cited

Multitask Pointer Network for Multi-Representational Parsing

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

We propose a transition-based approach that, by training a single model, can efficiently parse any input sentence with both constituent and dependency trees, supporting both contin…

cs.CL2020

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…

cs.CL2020

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…

cs.CL2020

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…

cs.CL2019

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…

cs.CL2018

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.…

cs.CL2018

A Dynamic Oracle for Linear-Time 2-Planar Dependency Parsing

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

We propose an efficient dynamic oracle for training the 2-Planar transition-based parser, a linear-time parser with over 99% coverage on non-projective syntactic corpora. This nove…

cs.CL2018★ 20 cited

Faster Shift-Reduce Constituent Parsing with a Non-Binary, Bottom-Up Strategy

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

An increasingly wide range of artificial intelligence applications rely on syntactic information to process and extract meaning from natural language text or speech, with constitue…

cs.CL2017

Non-Projective Dependency Parsing with Non-Local Transitions

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

We present a novel transition system, based on the Covington non-projective parser, introducing non-local transitions that can directly create arcs involving nodes to the left of t…

cs.CL2017

A Full Non-Monotonic Transition System for Unrestricted Non-Projective Parsing

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

Restricted non-monotonicity has been shown beneficial for the projective arc-eager dependency parser in previous research, as posterior decisions can repair mistakes made in previo…

cs.CL2015

Parsing as Reduction

Daniel Fernández-González, André F. T. Martins

We reduce phrase-representation parsing to dependency parsing. Our reduction is grounded on a new intermediate representation, "head-ordered dependency trees", shown to be isomorph…