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

Samy Haffoudhi, Fabian M. Suchanek, Nils Holzenberger
1/8/2026
cs.CL

No confident code implementation found for this paper.

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{haffoudhi2026lela,
  title  = {LELA: an LLM-based Entity Linking Approach with Zero-Shot Domain Adaptation},
  author = {Samy Haffoudhi and Fabian M. Suchanek and Nils Holzenberger},
  year   = {2026},
  eprint = {2601.05192},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2601.05192v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2601.05192.svg)](https://codeofpaper.com/paper/2601.05192)

Discussion