mlsanityData to 14 Oct 2026

ToNER: Type-oriented Named Entity Recognition with Generative Language Model

arXiv 2404.09145 ↗First posted 14 Apr 2024cs.CL cs.AIcited by 8

Not on the map. Why?

Abstract (arXiv)

In recent years, the fine-tuned generative models have been proven more powerful than the previous tagging-based or span-based models on named entity recognition (NER) task. It has also been found that the information related to entities, such as entity types, can prompt a model to achieve NER better. However, it is not easy to determine the entity types indeed existing in the given sentence in advance, and inputting too many potential entity types would distract the model inevitably. To exploit entity types' merit on promoting NER task, in this paper we propose a novel NER framework, namely ToNER based on a generative model. In ToNER, a type matching model is proposed at first to identify the entity types most likely to appear in the sentence. Then, we append a multiple binary classification task to fine-tune the generative model's encoder, so as to generate the refined representation of the input sentence. Moreover, we add an auxiliary task for the model to discover the entity types which further fine-tunes the model to output more accurate results. Our extensive experiments on some NER benchmarks verify the effectiveness of our proposed strategies in ToNER that are oriented towards entity types' exploitation.

Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). Builds on 26 of its 48 references that are in the map. First posted on arXiv 14 Apr 2024.

Builds on

26 of 48 references.

References · 26

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
  2. 2020Language Models are Few-Shot Learnerscited by 32,419
  3. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
  4. 2019BART: Denoising Sequence-to-Sequence Pre-training for Natural Language Generation, Translation, and Comprehensioncited by 5,893
  5. 2021SimCSE: Simple Contrastive Learning of Sentence Embeddingscited by 2,173
  6. 2019BioBERT: a pre-trained biomedical language representation model for biomedical text miningcited by 1,947
  7. 2017Decoupled Weight Decay Regularizationcited by 1,831
  8. 2023Towards General Text Embeddings with Multi-stage Contrastive Learningcited by 723
  9. 2022Unified Structure Generation for Universal Information Extractioncited by 221
  10. 2019A Unified MRC Framework for Named Entity Recognitioncited by 199
  11. 2023InstructUIE: Multi-task Instruction Tuning for Unified Information Extractioncited by 170
  12. 2021Template-Based Named Entity Recognition Using BARTcited by 153
14 more
  1. 2020Named Entity Recognition as Dependency Parsingcited by 151
  2. 2021A Unified Generative Framework for Various NER Subtaskscited by 141
  3. 2023Revisiting Relation Extraction in the era of Large Language Modelscited by 102
  4. 2021Unified Named Entity Recognition as Word-Word Relation Classificationcited by 90
  5. 2019CrossWeigh: Training Named Entity Tagger from Imperfect Annotationscited by 60
  6. 2019Neural Architectures for Nested NER through Linearizationcited by 56
  7. 2021SpanNER: Named Entity Re-/Recognition as Span Predictioncited by 55
  8. 2017Fast and Accurate Entity Recognition with Iterated Dilated Convolutionscited by 40
  9. 2019Sequence-to-Nuggets: Nested Entity Mention Detection via Anchor-Region Networkscited by 33
  10. 2020An Effective Transition-based Model for Discontinuous NERcited by 33
  11. 2021A Span-Based Model for Joint Overlapped and Discontinuous Named Entity Recognitioncited by 33
  12. 2018Neural Segmental Hypergraphs for Overlapping Mention Recognitioncited by 32
  13. 2021LightNER: A Lightweight Tuning Paradigm for Low-resource NER via Pluggable Promptingcited by 27
  14. 2019BioFLAIR: Pretrained Pooled Contextualized Embeddings for Biomedical Sequence Labeling Taskscited by 11

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 3; 2025: 3; 2026: 2.

8 papers.