Search Results for author:
Found 23 papers, 3 papers with code
Replicating and Extending ``Because Their Treebanks Leak'': Graph Isomorphism, Covariants, and Parser Performance
S{\o}gaard (2020) obtained results suggesting the fraction of trees occurring in the test data isomorphic to trees in the training set accounts for a non-trivial variation in parser performance.
Data Augmentation via Subtree Swapping for Dependency Parsing of Low-Resource Languages
The lack of annotated data is a big issue for building reliable NLP systems for most of the world{'}s languages.
Transition-based Semantic Dependency Parsing with Pointer Networks
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 outperforming graph-based models in this task.
Ranked #2 on
Semantic Dependency Parsing
on DM
Enriched In-Order Linearization for Faster Sequence-to-Sequence Constituent Parsing
Sequence-to-sequence constituent parsing requires a linearization to represent trees as sequences.
Bringing Roguelikes to Visually-Impaired Players by Using NLP
In these projects we seek expressivity and variety in the descriptions, so we can offer the users a fun roguelike experience that does not sacrifice any of the key characteristics that define the genre.
Left-to-Right Dependency Parsing with Pointer Networks
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.
Dynamic Oracles for Top-Down and In-Order Shift-Reduce Constituent Parsing
In addition, by improving the performance of the state-of-the-art in-order shift-reduce parser, we achieve the best accuracy to date (92. 0 F1) obtained by a fully-supervised single-model greedy shift-reduce constituent parser on the WSJ benchmark.
A Dynamic Oracle for Linear-Time 2-Planar Dependency Parsing
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.
Non-Projective Dependency Parsing with Non-Local Transitions
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 the current focus positions.
A Full Non-Monotonic Transition System for Unrestricted Non-Projective Parsing
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 previous states due to the lack of information.
Generic Axiomatization of Families of Noncrossing Graphs in Dependency Parsing
We present a simple encoding for unlabeled noncrossing graphs and show how its latent counterpart helps us to represent several families of directed and undirected graphs used in syntactic and semantic parsing of natural language as context-free languages.
EN-ES-CS: An English-Spanish Code-Switching Twitter Corpus for Multilingual Sentiment Analysis
Code-switching texts are those that contain terms in two or more different languages, and they appear increasingly often in social media.
