Pith. sign in

REVIEW 1 cited by

Rethinking Negative Instances for Generative Named Entity Recognition

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2402.16602 v2 pith:2CECY4OD submitted 2024-02-26 cs.CL

classification cs.CL
keywords entityinstancesnegativedomainsevaluationgenerativellmsmethods
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. DIRECT: Direct Decoding for Efficient and Aligned Sequence Labeling with Large Language Models

    cs.CL 2026-07 conditional novelty 4.0 of 10

    DPO after SFT plus constrained template-filling decoding improves LLM sequence-labeling accuracy and cuts inference time by reusing KV cache for non-label tokens.

Pith tools