Challenge: Existing neural models take long distance dependencies into account when predicting the tag of the current token.
Approach: They propose a method to capture long distance tag dependencies and use them for dependency analysis.
Outcome: The proposed model can predict multiple tags for the current token without taking dependencies between tags into account.

Similar Papers

Bringing Emerging Architectures to Sequence Labeling in NLP (2026.eacl-long)

Copied to clipboard

Challenge: Pretrained Transformer encoders are the dominant approach to sequence labeling . however, few have been applied to sequence labels on flat or simplified tasks .
Approach: They propose to use pretrained Transformer encoders to model relations across words . they find that the architectures adapt well across tagging tasks that vary in complexity .
Outcome: The proposed architectures perform well across tagging tasks across languages and datasets.
Rethinking Complex Neural Network Architectures for Document Classification (N19-1)

Copied to clipboard

Challenge: Neural network models for many NLP tasks have grown increasingly complex in recent years . authors of recent papers question the necessity of such architectures and find them quite effective .
Approach: They propose to use regularization techniques borrowed from language modeling to improve model accuracy . they find that a simple biLSTM architecture with appropriate regularization yields competitive results .
Outcome: a simple biLSTM model outperforms the state-of-the-art on four benchmark datasets . authors say that improvements are not real, but are attributed to mundane reasons .
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.
Morphosyntactic Tagging with a Meta-BiLSTM Model over Context Sensitive Token Encodings (P18-1)

Copied to clipboard

Challenge: recurrent neural networks have produced significant advances in part-of-speech tagging accuracy . a common feature of these models is the presence of rich initial word encodings . however, word or sub-word information interacts only through subsequent recursive layers .
Approach: They propose to use recurrent neural networks with sentence-level context for initial character and word-based representations.
Outcome: The proposed model has the highest accuracy of all participating systems in the CoNLL 2017 task.
MODE-LSTM: A Parameter-efficient Recurrent Network with Multi-Scale for Sentence Classification (2020.emnlp-main)

Copied to clipboard

Challenge: Existing models for sentence classification use linear convolution, which may not be sufficient to model the non-consecutive dependency of the phrase and may overfit the sequential information.
Approach: They propose a model that extracts multi-scale n-gram features for understanding the semantic meaning of sentences by some key-phrases located at different positions.
Outcome: The proposed model outperforms existing models on eight benchmark datasets and is competitive against state-of-the-art models.
Revisiting Higher-Order Dependency Parsers (2020.acl-main)

Copied to clipboard

Challenge: Neural encoders have allowed dependency parsers to shift from higher-order structured models to simpler first-order ones, making decoding faster and still achieving better accuracy than non-neural parser.
Approach: They found that neural parsers may benefit from higher-order features when employing a powerful pre-trained encoder, such as BERT.
Outcome: Using a pre-trained encoder, we found that higher-order models are more accurate on full sentence parses and match of modifier lists.
State-of-the-art Chinese Word Segmentation with Bi-LSTMs (D18-1)

Copied to clipboard

Challenge: A wide variety of neural-network architectures have been proposed for the task of Chinese word segmentation.
Approach: They propose a bidirectional LSTM model with standard deep learning techniques and best practices for the task of Chinese word segmentation.
Outcome: The proposed model outperforms models based on standard deep learning techniques and best practices on Chinese word segmentation datasets.
An Empirical Exploration of Local Ordering Pre-training for Structured Prediction (2020.findings-emnlp)

Copied to clipboard

Challenge: Recent studies have shown that pre-training contextualized encoders with language model objectives is effective for structured prediction.
Approach: They propose a semi-supervised method for pre-training contextualized encoders with language model objectives.
Outcome: The proposed method is effective on three typical structured prediction tasks in four languages.
Hierarchically-Refined Label Attention Network for Sequence Labeling (D19-1)

Copied to clipboard

Challenge: Conditional random fields (CRF) is a powerful model for statistical sequence labeling, but it does not give much information gain over strong neural encoding.
Approach: They propose a hierarchically-refined label attention network which captures potential long-term label dependency by giving each word incrementally refined label distributions with hierarchical attention.
Outcome: The proposed model improves POS tagging accuracy and speeds up training and testing compared to the current model.
What Part of the Neural Network Does This? Understanding LSTMs by Measuring and Dissecting Neurons (D19-1)

Copied to clipboard

Challenge: Biological neural systems consist of a huge number of neurons, and can react to the environment in complicated ways.
Approach: They propose a metric to quantify the sensitivity of neurons to each label and conduct experiments to prove it.
Outcome: The proposed metric is based on a set of experiments that show that dropping an arbitrary neuron significantly degrades the accuracy of the model.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations