Auxiliary tasks to boost Biaffine Semantic Dependency Parsing (2022.findings-acl)
Copied to clipboard
| Challenge: | Semantic dependency parsing (SDP) is a task of producing a dependency graph for a sentence. |
| Approach: | They propose to use simple auxiliary tasks that introduce some form of interdependence between arcs to circumvent such an independence of decision. |
| Outcome: | The proposed method shows modest but systematic performance gains on a near-state-of-the-art baseline using transformer-based contextualized representations. |
Similar Papers
Multitask Easy-First Dependency Parsing: Exploiting Complementarities of Different Dependency Representations (2020.coling-main)
Copied to clipboard
| Challenge: | Existing dependency parsing models for Arabic use complementary annotations, CATiB and UD treebanks, and partially created trees for one annotation are also available to the other as features for the score function. |
| Approach: | They propose to use Arabic dependency annotations to parse projective dependency trees using CATiB and UD treebanks. |
| Outcome: | The proposed model gives 9.9% error reduction on CATiB and 6.1% on UD compared to a strong baseline and ablation tests show that the main contribution is given by sharing tree representation between tasks, and not simply sharing biLSTM layers as is often performed in NLP multitask systems. |
ATP: AMRize Then Parse! Enhancing AMR Parsing with PseudoAMRs (2022.findings-naacl)
Copied to clipboard
| Challenge: | Abstract Meaning Representation (AMR) implicitly involves compound semantic annotations. |
| Approach: | They propose to use auxiliary tasks which are semantically or formally related to enhance AMR parsing. |
| Outcome: | The proposed method achieves state-of-the-art performance on benchmarks especially in topology-related scores. |
Efficient Second-Order TreeCRF for Neural Dependency Parsing (2020.acl-main)
Copied to clipboard
| Challenge: | In the deep learning (DL) era, dependency parsing models are extremely simplified with little hurt on performance thanks to the remarkable capability of multi-layer BiLSTMs in context representation. |
| Approach: | They propose to extend the biaffine parser to a second-order TreeCRF extension to reduce the complexity of the inside-outside algorithm. |
| Outcome: | The proposed extension can be used to batchify the inside and Viterbi algorithms and avoid the complex outside algorithm via efficient back-propagation. |
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. |
Multi-Layer Pseudo-Siamese Biaffine Model for Dependency Parsing (2022.coling-1)
Copied to clipboard
| Challenge: | Existing work only uses biaffine method at the end of the dependency parser as a scorer, and its application in multi-layer form is ignored. |
| Approach: | They propose a multi-layer pseudo-Siamese biaffine model for neural dependency parsing that uses biaffin method as a scorer and a biaffin module to construct arc weight matrix. |
| Outcome: | The proposed model achieves state-of-the-art on PTB, CTB, and UD datasets with low efficiency loss. |
Modal Dependency Parsing via Biaffine Attention with Self-Loop (2025.findings-acl)
Copied to clipboard
| Challenge: | A modal dependency structure is a web of connections between events and sources of information in a document that allows for tracing of who-said-what with what levels of certainty. |
| Approach: | They propose a modal dependency structure that integrates biaffine attention with a large language model to optimize against domain-specific challenges of modal dependence parsing. |
| Outcome: | The proposed approach outperforms the previous state-of-the-art on English and Chinese datasets by 2% and 4% respectively. |
Semi-Supervised Semantic Dependency Parsing Using CRF Autoencoders (2020.acl-main)
Copied to clipboard
| Challenge: | Semantic dependency parsing allows words to have multiple dependency heads, resulting in graph-structured representations. |
| Approach: | They propose an approach to semi-supervised learning of semantic dependency parsers based on the CRF autoencoder framework. |
| Outcome: | The proposed model improves over the baseline model and is arc-factored. |
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. |
End-to-End Argument Mining as Biaffine Dependency Parsing (2021.eacl-main)
Copied to clipboard
| Challenge: | Argumentation mining (AM) is a new field of research that uses dependency parsing to analyse arguments. |
| Approach: | They propose a neural end-to-end approach to argument mining based on dependency parsing . their model is biaffine dependency parsed and outperforms the current state-of-the-art . |
| Outcome: | The proposed model outperforms the state-of-the-art in component identification and relation identification. |
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. |