ARUQULA -- An LLM based Text2SPARQL Approach using ReAct and Knowledge Graph Exploration Utilities
Felix Brei, Lorenz Bühmann, Johannes Frey, Daniel Gerber, Lars-Peter Meyer, Claus Stadler, Kirill Bulert
TL;DR
ARUQULA tackles Text2SPARQL for RDF knowledge graphs by extending SPINACH with ReAct-based reasoning and dedicated KG exploration utilities. A dual grounding strategy separates schema-term grounding from named-entity grounding, employing a hybrid vector search for concepts and a full-text Lucene index for entities. Evaluated on the TEXT2SPARQL challenge with CK25 and DB25, the work analyzes agent behavior, timing, and failure modes to reveal strengths and limitations of automatic evaluation in KGQA. The approach advances multilingual, multi-KG Text2SPARQL methods and points to practical directions for reducing latency, improving grounding reliability, and enabling cross-KG deployment.
Abstract
Interacting with knowledge graphs can be a daunting task for people without a background in computer science since the query language that is used (SPARQL) has a high barrier of entry. Large language models (LLMs) can lower that barrier by providing support in the form of Text2SPARQL translation. In this paper we introduce a generalized method based on SPINACH, an LLM backed agent that translates natural language questions to SPARQL queries not in a single shot, but as an iterative process of exploration and execution. We describe the overall architecture and reasoning behind our design decisions, and also conduct a thorough analysis of the agent behavior to gain insights into future areas for targeted improvements. This work was motivated by the Text2SPARQL challenge, a challenge that was held to facilitate improvements in the Text2SPARQL domain.
