2026/01/31 by Samy Haffoudhi, Fabian M. Suchanek, Nils Holzenberger · 3 citations
Computer Science · #cs.CL
paper · pdf · doi:10.48550/arxiv.2601.05192
Accepted at ISWC 2026. Extended version with appendices
arxiv created 2026/08/06 · arxiv updated 2026/08/07
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.