Automatically Selecting the Best Dependency Annotation Design with Dynamic Oracles (N18-2)
Copied to clipboard
| Challenge: | Multiple annotation conventions have been proposed for representing dependency structures. |
| Approach: | They propose to consider a set of syntactic references encoding alternative syntak representations to train a parser with a dynamic oracle. |
| Outcome: | The proposed approach can predict the best syntactic representation among all possible references. |
Similar Papers
A Dynamic Oracle for Linear-Time 2-Planar Dependency Parsing (N18-2)
Copied to clipboard
| Challenge: | Existing dynamic oracles for greedy parsers can handle non-projective syntax, but none are available for these types of training. |
| Approach: | They propose an efficient dynamic oracle for training the 2-Planar transition-based parser with over 99% coverage on non-projective syntactic corpora. |
| Outcome: | The proposed model outperforms the static training strategy in the vast majority of languages tested and scored better on most datasets than the arc-hybrid parser enhanced with the Swap transition. |
Enhancing Structure-aware Encoder with Extremely Limited Data for Graph-based Dependency Parsing (2022.coling-1)
Copied to clipboard
| Challenge: | Dependency parsing is an important natural language processing task which analyzes the syntactic structure of an input sentence. |
| Approach: | They propose a structure-aware encoder pre-trained on auto-parsed data to improve dependency parsing . they propose combining gold dependency trees with existing parsers to improve parser performance . |
| Outcome: | The proposed approach outperforms baselines under different parsers and dependency standards under different parameters and model architectures. |
Dynamic Oracles for Top-Down and In-Order Shift-Reduce Constituent Parsing (D18-1)
Copied to clipboard
| Challenge: | Top-down and in-order shift-reduce constituent parsers are the most accurate known shift-reducing algorithms for constituent paring. |
| Approach: | They propose to use dynamic oracles to train two of the most accurate shift-reduce algorithms for constituent parsing. |
| Outcome: | The proposed top-down and in-order shift-reduce parsers improve on the WSJ benchmark. |
Viable Dependency Parsing as Sequence Labeling (N19-1)
Copied to clipboard
| Challenge: | Existing work on dependency parsing by sequence labeling suggested that it was impractical. |
| Approach: | They propose to use dependency trees as sequence labels to obtain fast and accurate parsers using a conventional BILSTM-based model. |
| Outcome: | The proposed models are conceptually simple, not needing traditional parsing algorithms or auxiliary structures, and provide a good speed-accuracy tradeoff, with results competitive with more complex approaches. |
A Root of a Problem: Optimizing Single-Root Dependency Parsing (2021.emnlp-main)
Copied to clipboard
| Challenge: | Graph-based dependency parsers can be improved without compromising on accuracy or accuracy. |
| Approach: | They propose two approaches to single-root dependency parsing that yield speed ups . they show that one approach is fully correct and finds the optimal dependency tree . |
| Outcome: | The proposed approach finds the optimal dependency tree without loss of accuracy or optimality. |
Simpler but More Accurate Semantic Dependency Parsing (P18-2)
Copied to clipboard
| Challenge: | Syntactic dependency parsing is the most popular method for automatically extracting low-level relationships between words in a sentence. |
| Approach: | They extend a syntactic dependency parser to train on and generate graph-structured representations that capture between-word relationships that are more closely related to the meaning of a sentence. |
| Outcome: | The proposed system beats the current state-of-the-art system by 0.6% and linguistically richer representations push the margin even higher. |
Automatic Correction of Syntactic Dependency Annotation Differences (2022.lrec-1)
Copied to clipboard
| Challenge: | Annotation inconsistencies between data sets can cause problems for low-resource NLP . a simple method for automatically detecting annotation mismatches between corpora is proposed . |
| Approach: | They propose a method for automatically detecting annotation mismatches between dependency parsing corpora . they also propose three related methods for automatically configuring the mismatch . |
| Outcome: | The proposed method improves performance on both converted and unconverted data. |
Dynamic Head Selection for Neural Lexicalized Constituency Parsing (2025.acl-long)
Copied to clipboard
| Challenge: | Lexicalized parsing has traditionally been neglected in favor of unlexicalized, span-based methods. |
| Approach: | They propose a latent lexicalization framework that dynamically infers lexicals from data without relying on predefined head-finding rules. |
| Outcome: | The proposed model learns lexical dependencies directly from data, offering greater adaptability across languages and datasets. |
Parsing as Tagging (2020.lrec-1)
Copied to clipboard
| Challenge: | Existing methods for dependency parsing treat parse as tagging, but they are not perfect. |
| Approach: | They propose a simple yet accurate method that treats parsing as tagging . they use a sequence model with a bidirectional LSTM over BERT embeddings . |
| Outcome: | The proposed method outperforms the state-of-the-art method on universal dependency (UD) by 1.76% unlabeled attachment score (UAS) for English, 1.98% UAS for French, and 1.16% UAS in German. |
Neural Reranking for Dependency Parsing: An Evaluation (2020.acl-main)
Copied to clipboard
| Challenge: | Recent work shows that neural rerankers can improve dependency parsing results over the top k trees produced by a base parser. |
| Approach: | They propose to use a discriminative reranker to improve dependency parsing results . they propose to incorporate global information into the model to improve parse accuracies . |
| Outcome: | The proposed model outperforms existing models on English and German and Czech, and is the only one to improve on German and Chinese data. |