A fast and sound tagging method for discontinuous named-entity recognition
Not on the map. Why?
Abstract (arXiv)
We introduce a novel tagging scheme for discontinuous named entity recognition based on an explicit description of the inner structure of discontinuous mentions. We rely on a weighted finite state automaton for both marginal and maximum a posteriori inference. As such, our method is sound in the sense that (1) well-formedness of predicted tag sequences is ensured via the automaton structure and (2) there is an unambiguous mapping between well-formed sequences of tags and (discontinuous) mentions. We evaluate our approach on three English datasets in the biomedical domain, and report comparable results to state-of-the-art while having a way simpler and faster model.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 14 of its 63 references that are in the map. First posted on arXiv 24 Sep 2024.
Builds on
14 of 63 references.
References · 14
- 2020DeBERTa: Decoding-enhanced BERT with Disentangled Attentioncited by 2,181
- 2021DeBERTaV3: Improving DeBERTa using ELECTRA-Style Pre-Training with Gradient-Disentangled Embedding Sharingcited by 1,254
- 2020On the Stability of Fine-tuning BERT: Misconceptions, Explanations, and Strong Baselinescited by 255
- 2019Learning with Fenchel-Young Lossescited by 119
- 2021Unified Named Entity Recognition as Word-Word Relation Classificationcited by 90
- 2018Differentiable Dynamic Programming for Structured Prediction and Attentioncited by 58
- 2020Torch-Struct: Deep Structured Prediction Librarycited by 40
- 2020An Effective Transition-based Model for Discontinuous NERcited by 33
- 2021Discontinuous Named Entity Recognition as Maximal Clique Discoverycited by 17
- 2019Combining Spans into Entities: A Neural Two-Stage Approach for Recognizing Discontiguous Entitiescited by 15
- 2018Learning to Recognize Discontiguous Entitiescited by 10
- 2021Constraining Linear-chain CRFs to Regular Languagescited by 6
2 more
- 2017Decoding with Finite-State Transducers on GPUscited by 2
- 2023CoRec: An Easy Approach for Coordination Recognitioncited by 1
Built on by
Citing papers per year: 2025: 3; 2026: 1.
4 papers.
- 2025Bregman Conditional Random Fields: Sequence Labeling with Parallelizable Inference Algorithmscited by 1
- 2025GapDNER: A Gap-Aware Grid Tagging Model for Discontinuous Named Entity Recognitioncited by 0
- 2025SEDA: A Self-Adapted Entity-Centric Data Augmentation for Boosting Gird-based Discontinuous NER Modelscited by 0
- 2026A Study on Building Efficient Zero-Shot Relation Extraction Modelscited by 0
- 2026A Study on Building Efficient Zero-Shot Relation Extraction Models1 Mar 2026
- 2025SEDA: A Self-Adapted Entity-Centric Data Augmentation for Boosting Gird-based Discontinuous NER Models25 Nov 2025
- 2025GapDNER: A Gap-Aware Grid Tagging Model for Discontinuous Named Entity Recognition13 Oct 2025
- 2025Bregman Conditional Random Fields: Sequence Labeling with Parallelizable Inference Algorithms31 May 2025