Skip to main navigation Skip to search Skip to main content

A Scalable Framework for Automated NER Annotation Correction in Low-Resource Languages

  • Toqeer Ehsan*
  • , Thamar Solorio
  • *Corresponding author for this work
  • Mohamed bin Zayed University of Artificial Intelligence (MBZUAI)

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingsScientificpeer-review

Abstract

Poor quality or noisy annotations in Named Entity Recognition (NER), as in any other NLP task, make it challenging to achieve state-of-the-art performance. In this paper, we present a multi-step framework to enhance the annotation quality of NER datasets by employing automated techniques. We propose a frequency-based iterative approach that leverages self-training and a dual-threshold mechanism to enhance inference confidence. Experimental evaluations on different NER datasets demonstrate significant improvements in NER performance with respect to the original datasets. This work further explores the potential of generative Large Language Models (LLMs) to perform NER for low-resource languages.

Original languageEnglish
Title of host publicationFindings of the Association for Computational Linguistics: EACL 2026
EditorsV. Demberg, K. Inui, L. Marquez
PublisherAssociation for Computational Linguistics (ACL)
Pages4138-4151
Number of pages14
ISBN (Electronic)979-8-89176-386-9
DOIs
Publication statusPublished - 2026
MoE publication typeA4 Article in a conference publication
Event19th Conference of the European Chapter of the Association for Computational Linguistics, Findings of EACL 2026 - Rabat, Morocco
Duration: 24 Mar 202629 Mar 2026

Conference

Conference19th Conference of the European Chapter of the Association for Computational Linguistics, Findings of EACL 2026
Country/TerritoryMorocco
CityRabat
Period24/03/2629/03/26

Fingerprint

Dive into the research topics of 'A Scalable Framework for Automated NER Annotation Correction in Low-Resource Languages'. Together they form a unique fingerprint.

Cite this