| Challenge: | Existing neural sequence labeling models have been used for many tasks such as POS tagging, chunking and named entity recognition (NER). |
| Approach: | They propose to replicate twelve neural sequence labeling models and compare them to three benchmarks to find out which models are effective and which are inconsistent. |
| Outcome: | The proposed models are compared on NER, Chunking, and POS tagging benchmarks. |
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. |
GNN-SL: Sequence Labeling Based on Nearest Examples via GNN (2023.findings-acl)
Copied to clipboard
| Challenge: | Existing sequence labeling algorithms can be decomposed into two parts . |
| Approach: | They propose a graph neural networks sequence labeling (GNN-SL) that augments the vanilla SL model output with similar tagging examples retrieved from the whole training set. |
| Outcome: | The proposed model performs well on three sequence labeling tasks. |
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. |
More Embeddings, Better Sequence Labelers? (2020.findings-emnlp)
Copied to clipboard
| Challenge: | Existing work suggests contextual embeddings improve sequence labeling accuracy . but, there is no definite conclusion on whether concatenating different kinds of embeddables is effective . |
| Approach: | They propose a family of contextual embeddings that improves sequence labeling accuracy . they conduct extensive experiments on 3 tasks over 18 datasets and 8 languages . |
| Outcome: | The proposed family of contextual embeddings improves the accuracy of sequence labelers over non-contextual embedders. |
Parsing linearizations appreciate PoS tags - but some are fussy about errors (2022.aacl-short)
Copied to clipboard
| Challenge: | Recent work on the impact of PoS tags on graph- and transition-based parsers suggests that they are only useful when tagging accuracy is prohibitively high or in low-resource scenarios. |
| Approach: | They examine the impact of PoS tags on graph- and transition-based parsers and propose to use them in a new paradigm for sequence labeling. |
| Outcome: | The proposed model is best when tagging accuracy and resource availability are high. |
Even the Simplest Baseline Needs Careful Re-investigation: A Case Study on XML-CNN (2022.naacl-main)
Copied to clipboard
| Challenge: | XML-CNN has been a popular research topic in NLP due to its superior performance . however, the increasing complexity brings difficulties to ensure the true architectural progress . |
| Approach: | They propose to re-examine an influential multi-label text classification method . they propose suitable baselines for multi-level text classification tasks . |
| Outcome: | The proposed method performs better than the original model, the authors show . they show that the re-implementation reveals contradictory results to the original work . |
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 Investigation of Potential Function Designs for Neural CRF (2020.findings-emnlp)
Copied to clipboard
| Challenge: | Existing approaches to sequence labeling are based on the neural linear-chain CRF model. |
| Approach: | They propose a series of increasingly expressive potential functions for neural CRF models that integrate emission and transition functions and explicitly take contextual words as input. |
| Outcome: | The proposed model consistently achieves the best performance on the decomposed quadrilinear potential function based on the representations of two neighboring labels and two neighbored words. |
UZH@CRAFT-ST: a Sequence-labeling Approach to Concept Recognition (D19-57)
Copied to clipboard
| Challenge: | CRAFT shared task 2019: concept recognition using named entity recognition and normalization . a biLSTM-based network and a transformer system were used to tackle both tasks in a single model . |
| Approach: | They propose two different neural approaches to concept recognition . they propose a BiLSTM-based network and a bioBERT-based system for NER and normalization . |
| Outcome: | The proposed systems model the task as a sequence labeling problem. |
Unleashing the True Potential of Sequence-to-Sequence Models for Sequence Tagging and Structure Parsing (2023.tacl-1)
Copied to clipboard
| Challenge: | Sequence-to-Sequence (S2S) models have been successful on text generation tasks . however, learning complex structures with S2S models remains challenging . |
| Approach: | They propose to use constrained decoding to model part-of-speech tagging, named entity recognition, constituency, and dependency parsing tasks with 3 lexically diverse linearization schemas and corresponding constrained coding methods. |
| Outcome: | The proposed methods outperform the state-of-the-art on four core tasks. |