Papers with UAS
A Little Pretraining Goes a Long Way: A Case Study on Dependency Parsing Task for Low-resource Morphologically Rich Languages (2021.eacl-srw)
Copied to clipboard
| Challenge: | Neural dependency parsing has been a success for many domains and languages, but the bottleneck of massive labelled data limits its effectiveness for low resource languages. |
| Approach: | They propose to use morphological knowledge to improve dependency parsing for morphology rich languages in a low-resource setting to perform experiments. |
| Outcome: | The proposed method achieves an average gain of 2 points (UAS) and 3.6 points (LAS) on 10 MRLs in low-resource settings. |
BanSuite: A Unified Toolkit and Software Platform for Low-Resource NLP in Bangla (2026.eacl-demo)
Copied to clipboard
Md. Abu Sayed, Faisal Ahamed Khan, Jannatul Ferdous Tuli, Nabeel Mohammed, Mohammad Ruhul Amin, Mohammad Mamun Or Rashid
| Challenge: | Existing efforts to improve Bangla's NLP performance have focused on isolated tasks such as Part-of-Speech tagging and Named Entity Recognition (NER) but comprehensive, integrated systems for core NLP tasks such Shallow Parsing and Dependency Parser are largely absent. |
| Approach: | They propose to integrate a large-scale, manually annotated Bangla Treebank with high-quality pretrained models for POS tagging, NER, shallow parsing, and dependency parse. |
| Outcome: | The proposed system achieves strong in-domain baseline performance while maintaining high efficiency in resource usage. |
Left-to-Right Dependency Parsing with Pointer Networks (N19-1)
Copied to clipboard
| Challenge: | a new algorithm that parses sentences from left to right is simpler than the top-down stack-pointer parser . a graph-based dependency parsing model has been ahead of the curve in terms of accuracy in the past two years . |
| Approach: | They propose a transition-based algorithm that parses sentences from left to right by building n attachments, with n being the length of the input sentence. |
| Outcome: | The proposed algorithm outperforms the top-down stack-pointer parser and is twice as fast as the original top-up stack-pointing parsers. |
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. |
Head-Driven Phrase Structure Grammar Parsing on Penn Treebank (P19-1)
Copied to clipboard
| Challenge: | Head-driven phrase structure grammars have a uniform formalism representing rich contextual syntactic and even semantic meanings. |
| Approach: | They propose to integrate constituent and dependency formal representations into head-driven phrase structure. |
| Outcome: | The proposed parser achieves state-of-the-art performance on Penn Treebank and Chinese Penn TreeBank. |
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. |
Seq2seq Dependency Parsing (C18-1)
Copied to clipboard
| Challenge: | Recent trend for dependency parsing is adopting neural networks due to their significant success in a wide range of applications. |
| Approach: | They propose a sequence to sequence (seq2seque) dependency parser that predicts the relative position of head for each word. |
| Outcome: | The proposed parser achieves 94.11% UAS on PTB and 88.78% UAS . |
75 Languages, 1 Model: Parsing Universal Dependencies Universally (D19-1)
Copied to clipboard
| Challenge: | UDify is a multilingual multi-task model that can predict universal part-of-speech, morphological features, lemmas, and dependency trees. |
| Approach: | They evaluate UDify, a multilingual multi-task model capable of predicting universal part-of-speech, morphological features, lemmas, and dependency trees simultaneously for all 124 Universal Dependencies treebanks across 75 languages. |
| Outcome: | The proposed model can predict universal part-of-speech, morphological features, lemmas, and dependency trees for all 124 treebanks across 75 languages. |
Neural Transition Based Parsing of Web Queries: An Entity Based Approach (D18-1)
Copied to clipboard
| Challenge: | Existing query parsers that account for the unique grammar of web queries rely on resources not available outside of big web corporations. |
| Approach: | They propose a biLSTM query parser that explicitly accounts for the unique grammar of queries. |
| Outcome: | The proposed query parser outperforms existing state-of-the-art parsers on 2500 annotated queries. |
Improved Dependency Parsing using Implicit Word Connections Learned from Unlabeled Data (D18-1)
Copied to clipboard
| Challenge: | Pre-trained word embeddings and language models cannot capture word connections in a sentence. |
| Approach: | They propose to implicitly capture word connections from unlabeled data by word ordering model with self-attention mechanism. |
| Outcome: | The proposed model achieves 96.35% UAS and 95.25% LAS on the English PTB dataset. |
Representation Alignment and Adversarial Networks for Cross-lingual Dependency Parsing (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Pre-trained language models have improved dependency parsing accuracy in resource-rich languages . however, the accuracy drops sharply when the model is transferred to low-resource language . |
| Approach: | They propose a representation alignment and adversarial model to filter out useful knowledge from rich-resource language and ignore useless ones. |
| Outcome: | The proposed model outperforms baseline models on the benchmark datasets by 1.37 LAS and 1.34 UAS. |
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. |
Cheating a Parser to Death: Data-driven Cross-Treebank Annotation Transfer (L18-1)
Copied to clipboard
| Challenge: | Using annotated corpus for linguistic purposes is no longer justified . hand-crafted syntactic resources such as grammars and lexicons can be used as sources of features to guide data driven systems. |
| Approach: | They propose an efficient method for transferring annotations between two different treebanks of the same language. |
| Outcome: | The proposed method is based on the Universal Dependency annotation scheme and was evaluated on the gold standard (94.75% of LAS, 99.40% UAS on the test set). |
Beyond Transcription: Unified Audio Schema for Perception-Aware AudioLLMs (2026.findings-acl)
Copied to clipboard
Linhao Zhang, Yuhan Song, Aiwei Liu, Chuhan Wu, Sijun Zhang, Wei Jia, Yuan Liu, Houfeng Wang, Zhou Xiao
| Challenge: | Recent Audio Large Language Models (AudioLLMs) excel at reasoning tasks, but struggle at elementary auditory perception. |
| Approach: | They propose a framework that organizes audio information into three explicit components in a unified JSON format. |
| Outcome: | The proposed framework boosts fine-grained perception by 10.9% on MMSU over state-of-the-art models while preserving robust reasoning capabilities. |