| Challenge: | Existing models for semi-supervised dependency parsing use labeled data, but they require large amounts of labeles. |
| Approach: | They propose two end-to-end autoencoding models for semi-supervised graph-based projective dependency parsing. |
| Outcome: | The proposed models outperform a semi-supervised model on WSJ and UD dependency parsing data sets. |
Similar Papers
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. |
Semi-Supervised Dependency Parsing with Arc-Factored Variational Autoencoding (2020.coling-main)
Copied to clipboard
| Challenge: | Existing methods for dependency parsing use unlabelled data to compensate for the lack of training corpora. |
| Approach: | They propose semi-supervised dependency parsing methods that utilize unlabelled data to compensate for the scarcity of labelled training corpora. |
| Outcome: | The proposed model overcomes the tree constraint and the complexity of the training procedure while avoiding the challenges brought by the tree constraints. |
A Semi-Autoregressive Graph Generative Model for Dependency Graph Parsing (2023.findings-acl)
Copied to clipboard
| Challenge: | Existing parsers that capture dependency graphs are lacking in capturing explicit dependencies . graph-based parsing is a popular choice for capturing dependency relationships between words . |
| Approach: | They propose a semi-autoregressive dependency parser that generates dependency graphs by adding nodes and edge groups autoregressively while pouring out all group elements in parallel. |
| Outcome: | The proposed method outperforms baselines on Enhanced Universal Dependencies of multiple languages. |
Second-Order Neural Dependency Parsing with Message Passing and End-to-End Training (2020.aacl-main)
Copied to clipboard
| Challenge: | Existing approaches to dependency parsing use exact and approximate inference to find the best parse tree. |
| Approach: | They propose a second-order graph-based neural dependency parsing approach using message passing and end-to-end neural networks. |
| Outcome: | The proposed methods match the state-of-the-art second-order graph-based neural dependency parsers and have significantly faster speed in training and testing. |
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. |
Headed-Span-Based Projective Dependency Parsing (2022.acl-long)
Copied to clipboard
| Challenge: | Existing methods for dependency parsing based on headed spans are available. |
| Approach: | They propose a method for projective dependency parsing based on headed spans. |
| Outcome: | The proposed method achieves state-of-the-art or competitive results on PTB, CTB, and UD Dependency parsing is an important task in natural language processing. |
Enhancing Unsupervised Generative Dependency Parser with Contextual Information (P19-1)
Copied to clipboard
| Challenge: | Existing approaches to unsupervised dependency parsing are based on probabilistic generative models that learn the joint distribution of the given sentence and its parse. |
| Approach: | They propose a probabilistic model that generates a sentence and its parse from a latent representation, which encodes global contextual information of the generated sentence. |
| Outcome: | The proposed model achieves competitive accuracy compared with state-of-the-art models. |
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. |
Semi-supervised Domain Adaptation for Dependency Parsing via Improved Contextualized Word Representations (2020.coling-main)
Copied to clipboard
| Challenge: | Recent advances in deep neural network models have improved parsing performance on in-domain texts . however, the problem is to improve performance on out-of-domain text data when there is only a small-scale out-domain labeled data. |
| Approach: | They propose to use adversarial learning and fine-tuning BERT to improve contextualized word representations on out-of-domain texts. |
| Outcome: | The proposed models achieve consistent improvement and fine-tune BERT processes boost parsing accuracy by a large margin. |
Hexatagging: Projective Dependency Parsing as Tagging (2023.acl-short)
Copied to clipboard
| Challenge: | Using a pretrained language model, we can train language models on increasingly large amounts of data. |
| Approach: | They propose a dependency parser that constructs dependency trees by tagging words with elements from a finite set of possible tags. |
| Outcome: | The proposed approach achieves state-of-the-art performance of 96.4 LAS and 97.4 UAS on the Penn Treebank test set. |