Knowledge Base Construction from Language Models
Treating LLMs as compressed, implicit knowledge bases — extracting, evaluating, and comparing their knowledge to structured sources.
A large language model can be studied as a compressed, implicit knowledge source. This thread asks what kind of knowledge source it is — how to extract it, how to evaluate it, and where it diverges from structured sources like Wikidata.
Methodological work includes KAMEL (AKBC 2022), a probing benchmark with multi-token entities (Kalo & Fichtel, 2022); Evaluating the Knowledge Base Completion Potential of GPT (EMNLP Findings 2023), a systematic study of LLMs as KB completion sources (Veseli et al., 2023); and KnowlyBERT (ISWC 2020), a hybrid architecture combining language models with knowledge graphs at query time (Kalo et al., 2020). Earlier work on Prompt Tuning or Fine-Tuning (AKBC 2021) (Fichtel et al., 2021) and Prompting as Probing (LM-KBC 2022) (Alivanistos et al., 2022) laid the groundwork for treating LMs as queryable KBs. The position paper Large Language Models and Knowledge Graphs: Opportunities and Challenges (TGDK 2023) maps the broader space (Pan et al., 2023).
Recent work extends this to multilingual settings: A Wikidata-Based Framework to Measure Cross-Lingual Bias in Multilingual LLMs (KG-LLM @ LREC 2026) introduces the WILA-PopQA benchmark and disentangles the effects of question language, entity language, and popularity on factual recall (Iferroudjene et al., 2026).
I co-organise the LM-KBC Challenge at ISWC, which has run since 2022.
References
2026
2023
2022
- AKBCKAMEL: Knowledge Analysis with Multitoken Entities in Language ModelsIn 4th Conference on Automated Knowledge Base Construction (AKBC 2022), 2022