Pith. sign in

REVIEW

LELA: an LLM-based Entity Linking Approach with Zero-Shot Domain Adaptation

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 2601.05192 v2 pith:QMK3CTQ4 submitted 2026-01-08 cs.CL

classification cs.CL
keywords entityknowledgelelalinkingapproachllmsacrossadaptation
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Entity linking (mapping ambiguous mentions in text to entities in a knowledge base) is a foundational step in tasks such as knowledge graph construction, question-answering, and information extraction. Our method, LELA, is a modular coarse-to-fine approach that leverages the capabilities of large language models (LLMs), and works with different target domains, knowledge bases and LLMs, without any fine-tuning phase. Our experiments across various entity linking settings show that LELA is highly competitive with fine-tuned approaches, and substantially outperforms the non-fine-tuned ones.

Discussion (0). Continue with ORCID to comment.

Pith tools