CLFeb 26, 2024

Rethinking Negative Instances for Generative Named Entity Recognition

arXiv:2402.16602v234 citationsh-index: 9ACL
AI Analysis

This work addresses the challenge of generalizing NER to unseen domains for users in natural language processing, representing an incremental improvement over existing methods.

The paper tackles the problem of improving zero-shot performance in Named Entity Recognition by incorporating negative instances into training, resulting in a system that surpasses state-of-the-art methods by 9 F1 score.

Large Language Models (LLMs) have demonstrated impressive capabilities for generalizing in unseen tasks. In the Named Entity Recognition (NER) task, recent advancements have seen the remarkable improvement of LLMs in a broad range of entity domains via instruction tuning, by adopting entity-centric schema. In this work, we explore the potential enhancement of the existing methods by incorporating negative instances into training. Our experiments reveal that negative instances contribute to remarkable improvements by (1) introducing contextual information, and (2) clearly delineating label boundaries. Furthermore, we introduce an efficient longest common subsequence (LCS) matching algorithm, which is tailored to transform unstructured predictions into structured entities. By integrating these components, we present GNER, a Generative NER system that shows improved zero-shot performance across unseen entity domains. Our comprehensive evaluation illustrates our system's superiority, surpassing state-of-the-art (SoTA) methods by 9 $F_1$ score in zero-shot evaluation.

Code Implementations2 repos
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes