| 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. |
Similar Papers
Zero-Shot Sequence Labeling: Transferring Knowledge from Sentences to Tokens (N18-1)
Copied to clipboard
| Challenge: | Recent work has used attention weights to visualize the focus of neural models in input data. |
| Approach: | They propose to use attention-based visualization techniques to infer token-level labels from a network trained only on sentence-level labeling. |
| Outcome: | The proposed approach outperforms gradient-based methods on four datasets and is expected to outperfect supervised methods. |
Structured Refinement for Sequential Labeling (2021.findings-acl)
Copied to clipboard
| Challenge: | Existing work on identifying target-irrelevant information relies on locally normalized attention without considering possible labels at other time steps. |
| Approach: | They propose to extend local normalized attention to leverage structural information for refinement . they propose to use two implementation tricks to accelerate CRF computation and an initialization trick for Chinese character embeddings . |
| Outcome: | The proposed method can be extended to include Chinese character embeddings and two implementation tricks to accelerate CRF computation. |
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. |
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. |
An Exploration of Arbitrary-Order Sequence Labeling via Energy-Based Inference Networks (2020.emnlp-main)
Copied to clipboard
| Challenge: | Recent work shows that conditional random fields (CRFs) perform well in sequence labeling tasks. |
| Approach: | They propose several high-order energy terms to capture dependencies among labels in sequence labeling . they use convolutional, recurrent, and self-attention networks to construct these energy terms . |
| Outcome: | The proposed approach improves on four sequence labeling tasks while having the same decoding speed as simple classifiers. |
GCDT: A Global Context Enhanced Deep Transition Architecture for Sequence Labeling (P19-1)
Copied to clipboard
| Challenge: | Existing systems for sequence labeling are limited by shallow connections between consecutive hidden states and insufficient modeling of global information. |
| Approach: | They propose a global context enhanced deep transition architecture for sequence labeling . they deepen the state transition path at each position in a sentence and assign tokens with global representations . |
| Outcome: | The proposed architecture outperforms the best reported results on two standard sequence labeling tasks. |
Phrase Grounding by Soft-Label Chain Conditional Random Field (D19-1)
Copied to clipboard
| Challenge: | Existing methods to ground entities depend on inference or non-differentiable losses. |
| Approach: | They propose a phrase grounding task that grounds entities to corresponding regions in an image . they use neural chain Conditional Random Fields to model dependencies among regions . |
| Outcome: | The proposed method is based on a dataset of the Flickr30k Entities dataset. |
Recurrent Alignment with Hard Attention for Hierarchical Text Rating (2024.emnlp-main)
Copied to clipboard
| Challenge: | Large language models excel at understanding and generating plain text, but they are not tailored to handle hierarchical text structures or directly predict task-specific properties such as text rating. |
| Approach: | They propose a framework that integrates Recurrent Alignment with Hard Attention to analyze hierarchically structured text. |
| Outcome: | The proposed framework outperforms existing state-of-the-art methods on three hierarchical text rating datasets. |
Weakly Supervised Attention Networks for Entity Recognition (D19-1)
Copied to clipboard
| Challenge: | Existing approaches to entity recognition require large amounts of token-level data, which can be expensive and cumbersome to obtain. |
| Approach: | They propose a weakly supervised model that can be annotated at word level from a corpus containing binary presence/absence labels. |
| Outcome: | The proposed model performs reasonably well on the task of entity recognition despite not having access to token-level ground truth data. |
NAT: Noise-Aware Training for Robust Neural Sequence Labeling (2020.acl-main)
Copied to clipboard
| Challenge: | Sequence labeling systems should perform reliably under ideal conditions and with corrupted inputs. |
| Approach: | They propose two noise-aware training objectives that improve robustness of sequence labeling performed on perturbed inputs. |
| Outcome: | The proposed methods improve robustness on English and German named entity recognition benchmarks. |