Scaling Graph-Based Dependency Parsing with Arc Vectorization and Attention-Based Refinement (2025.naacl-short)
Copied to clipboard
| Challenge: | Existing graph-based dependency parsers use a standard two-pipeline approach that only scores arcs and labels . |
| Approach: | They propose a graph-based dependency parsing architecture that explicitly constructs vectors from which both arcs and labels are scored. |
| Outcome: | The proposed model outperforms state-of-the-art models on PTB and UD in accuracy and efficiency. |
Similar Papers
Dependency Graph Parsing as Sequence Labeling (2024.emnlp-main)
Copied to clipboard
| Challenge: | Various linearizations have been proposed to cast syntactic dependency parsing as sequence labeling, but they cannot handle reentrancy or cycles. |
| Approach: | They propose unbounded linearizations that can be used to cast dependency parsing as sequence labeling. |
| Outcome: | The proposed linearizations can cast syntactic dependency parsing as a sequence labeling task. |
Graph-based Dependency Parsing with Graph Neural Networks (P19-1)
Copied to clipboard
| Challenge: | In graph-based dependency parsers, learning representations is gaining in importance, and we use graph neural networks to learn the representations. |
| Approach: | They propose to use graph neural networks to learn dependency tree nodes and propose to add a new aggregation function to the system. |
| Outcome: | The proposed model achieves the best UAS and LAS on PTB (96.0%, 94.3%) without using external resources. |
Graph-to-Graph Transformer for Transition-based Dependency Parsing (2020.findings-emnlp)
Copied to clipboard
| Challenge: | Existing models for conditioning on graphs and predicting graphs are weak, but they are effective for transition-based dependency parsing. |
| Approach: | They propose a Transformer architecture for conditioning on and predicting arbitrary graphs. |
| Outcome: | The proposed architecture outperforms the state-of-the-art in transition-based dependency parsing on English Penn Treebank and 13 languages of Universal Dependencies Treebanks. |
Combining (Second-Order) Graph-Based and Headed-Span-Based Projective Dependency Parsing (2022.findings-acl)
Copied to clipboard
| Challenge: | Existing graph-based methods that score dependency trees do not score dependency arcs at all. |
| Approach: | They propose a headed-span-based method that decomposes the score of a dependency tree into scores of headed spans. |
| Outcome: | The proposed method improves over first-order graph-based methods, but does not score dependency arcs at all. |
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. |
Higher-Order Dependency Parsing for Arc-Polynomial Score Functions via Gradient-Based Methods and Genetic Algorithm (2022.aacl-main)
Copied to clipboard
| Challenge: | Existing methods for higher-order dependency parsing are based on arc-polynomials . a score function is linear in arc variables, while for second-order models it is linear . |
| Approach: | They propose a method which takes advantage of arc-polynomials score functions . they use coordinate ascent and genetic search to iteratively update a candidate parse . |
| Outcome: | The proposed method matches state-of-the-art second order parsers on three standard datasets. |
Recursive Non-Autoregressive Graph-to-Graph Transformer for Dependency Parsing with Iterative Refinement (2021.tacl-1)
Copied to clipboard
| Challenge: | RNGTr is a non-recursive Graph-to-Graph Transformer for iterative refinement of graphs . it can improve the accuracy of initial parsers on 13 languages . |
| Approach: | They propose a recursive non-autoregressive Graph-to-Graph Transformer architecture for iterative refinement of arbitrary graphs and apply it to syntactic dependency parsing. |
| Outcome: | The proposed architecture can improve state-of-the-art on 13 languages and the German CoNLL2009 corpus. |
Hierarchical Bracketing Encodings Work for Dependency Graphs (2025.emnlp-main)
Copied to clipboard
| Challenge: | Sequence labeling (SL) is a simple yet effective paradigm for a wide range of natural language problems. |
| Approach: | They propose a new bracketing approach for dependency graph parsing that encodes graphs as sequences and n tagging actions. |
| Outcome: | The proposed approach significantly reduces label space while preserving structural information. |
Scene Graph Parsing as Dependency Parsing (N18-1)
Copied to clipboard
| Challenge: | Recent studies have focused on parsing structured knowledge graphs from textual descriptions. |
| Approach: | They propose an alternative but equivalent scene graph representation that connects to dependency parses. |
| Outcome: | The proposed model outperforms best approaches on image retrieval applications. |
Graph-Based Decoding for Task Oriented Semantic Parsing (2021.findings-emnlp)
Copied to clipboard
| Challenge: | Existing paradigms for semantic parsing are sequence-to-sequence and AMR parsers. |
| Approach: | They propose to formulate parsing as a sequence-to-sequence task using graph-based decoding techniques developed for syntactic parsers. |
| Outcome: | The proposed approach is competitive with sequence decoders on the standard setting and offers significant improvements in data efficiency and data availability. |