Large Language Models Meet Knowledge Graphs to Answer Factoid Questions
Mikhail Salnikov1,2 *{}^{*}start_FLOATSUPERSCRIPT * end_FLOATSUPERSCRIPT, Hai Le1 *{}^{*}start_FLOATSUPERSCRIPT * end_FLOATSUPERSCRIPT, Prateek Rajput1, Irina Nikishina5, Pavel Braslavski3, Valentin Malykh4, and Alexander Panchenko1,2 1Skolkovo Institute of Science and Technology, 2Artificial Intelligence Research Institute, 3Nazarbayev University, 4ISP RAS Research Center for Trusted AI, 5Universität Hamburg {mikhail.salnikov, hai.le,
Abstract
Recently, it has been shown that the incorporation of structured knowledge into Large Language Models significantly improves the results for a variety of NLP tasks. In this paper, we propose a method for exploring pre-trained Text-to-Text Language Models enriched with additional information from Knowledge Graphs for answering factoid questions. More specifically, we propose an algorithm for subgraphs extraction from a Knowledge Graph based on question entities and answer candidates. Then, we procure easily interpreted information with Transformer-based models through the linearization of the extracted subgraphs. Final re-ranking of the answer candidates with the extracted information boosts Hits@1 scores of the pre-trained text-to-text language models by $4-6\%$ .
原文 arXiv:2310.02166;中英对照 + 大白话阅读 https://aha.fim.ai/paper/2310.02166v1