arXiv Computation and Language By Qi Zhan, Yile Wang, Hui Huang

Assessment of Generative Named Entity Recognition in the Era of Large Language Models

Read the original on arXiv Computation and Language →

The paper evaluates open‑source large language models (LLMs) for both flat and nested named entity recognition (NER) tasks, comparing them to traditional encoder‑based models and decoder‑based LLMs using in‑context learning. It shows that with parameter‑efficient fine‑tuning and structured output formats (e.g., inline brackets or XML), LLMs can match or exceed the performance of conventional NER systems, and that their NER abilities arise from instruction following rather than memorization. Additionally, fine‑tuning for NER minimally affects, and can even improve, the LLMs’ general capabilities on other benchmarks.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Computation and Language.

arXiv Computation and Language
Sep 1

Generative vs. Encoder Models for Multilingual NER: A Comprehensive Empirical Study on Naamapadam

The paper compares generative and encoder-based neural models for multilingual Named Entity Recognition (NER) across the eleven languages of the Naamapadam benchmark. Five classic model families, four decoder-only large language models fine‑tuned with LoRA and 4‑bit NF4 quantisation, and nine generative models in zero‑to‑5‑shot inference were evaluated under strict CoNLL span‑level metrics. Encoder-based models (mBERT and XLM‑R) achieved substantially higher F1 scores—up to 0.675 on Hindi—than any generative architecture, with gaps of 7.5–40 percentage points; the best few‑shot result reached only 28% of the encoder baseline. The study identifies three language clusters (encoder‑dominant, partial‑coverage, and failure‑zone) and offers deployment guidelines based on transfer learning and low‑resource NLP principles.

By Jakkala Mahesh, Jatavath Shravan Kumar, Komalla Shivani, Sujoy Sarkar
arXiv AI
Sep 17

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

The paper introduces a scalable, multi-step framework designed to improve the quality of Named Entity Recognition (NER) annotations, particularly in low-resource languages. It employs a frequency-based iterative approach that combines self‑training with a dual‑threshold mechanism to increase inference confidence. Experiments on various NER datasets show notable performance gains over the original data, and the study also investigates the use of generative Large Language Models for NER tasks.

By Toqeer Ehsan, Thamar Solorio
arXiv AI
Oct 1

On the (In)effectiveness of AMR Augmentation for Large Language Models

The paper investigates whether adding Abstract Meaning Representation (AMR) data to large language models (LLMs) improves performance on downstream tasks. By reproducing recent studies and applying a consistent hyperparameter protocol, the authors find that text-only baselines match or surpass AMR-augmented models. A perplexity-based probe shows that AMR does not provide LLMs with additional relational knowledge, suggesting no clear benefit from AMR augmentation.

By Hoa Quynh Nhung Nguyen, Jacopo Staiano, Michael Sullivan
arXiv Computation and Language
Sep 1

Error-Type-Aware Loss Reweighting for Robust Named Entity Recognition with Noisy LLM Labels

Large language models (LLMs) are increasingly used to annotate datasets for training smaller, task‑specialized models such as named entity recognition (NER). However, current fine‑tuning processes ignore the annotation noise introduced by LLMs, leading to degraded performance, and existing noise‑robust losses fail to handle the heterogeneous nature of NER noise (e.g., missing mentions vs. type errors). The authors propose error‑type‑aware loss reweighting, which applies separate reweighting rules for different erroneous token types, improving F1 scores by 0.8–2.0 percentage points on average and up to 4.6 points on Wikigold at 24.1% noise.

By Elena Merdjanovska, Jonas Golde, Alan Akbik
arXiv Computation and Language
Aug 27

Just Pass Twice: Efficient Token Classification with LLMs for Zero-Shot NER

Just Pass Twice (JPT) is a method that allows causal large language models to perform token classification for zero‑shot named entity recognition by concatenating the input with itself, giving each token full bidirectional context without architectural changes. The approach combines these representations with definition‑guided entity embeddings to enable flexible zero‑shot generalization. JPT achieves state‑of‑the‑art results, outperforming prior methods by an average of +7.9 F1 on CrossNER and MIT benchmarks and running over 20× faster than comparable generative approaches.

By Ahmed Ewais, Ahmed Hashish, Amr Ali