$R^3$-NL2GQL: A Model Coordination and Knowledge Graph Alignment Approach for NL2GQL
Yuhang Zhou, Yu He, Siyu Tian, Yuchen Ni, Zhangyue Yin, Xiang Liu, Chuanjun Ji, Sen Liu, Xipeng Qiu, Guangnan Ye, Hongfeng Chai
TL;DR
This work addresses NL2GQL by introducing R^3-NL2GQL, a model-coordination framework that assigns distinct roles to smaller ranker/rewriter models and a larger refiner to generate accurate GQL queries. It leverages code-structured graph schemas and code-structured skeletons to convert natural-language inputs into precise GQL, supported by a bilingual, multi-schema dataset and retrieval-alignment techniques. Empirical results show the approach outperforms GPT-family baselines across syntax, semantics, and execution metrics, with ablations confirming the value of code-based prompts and collaborative model interaction. The study demonstrates the practicality of structured, code-oriented representations for graph query generation and sets a foundation for scalable NL2GQL development in diverse schemas and real-world settings.
Abstract
While current tasks of converting natural language to SQL (NL2SQL) using Foundation Models have shown impressive achievements, adapting these approaches for converting natural language to Graph Query Language (NL2GQL) encounters hurdles due to the distinct nature of GQL compared to SQL, alongside the diverse forms of GQL. Moving away from traditional rule-based and slot-filling methodologies, we introduce a novel approach, $R^3$-NL2GQL, integrating both small and large Foundation Models for ranking, rewriting, and refining tasks. This method leverages the interpretative strengths of smaller models for initial ranking and rewriting stages, while capitalizing on the superior generalization and query generation prowess of larger models for the final transformation of natural language queries into GQL formats. Addressing the scarcity of datasets in this emerging field, we have developed a bilingual dataset, sourced from graph database manuals and selected open-source Knowledge Graphs (KGs). Our evaluation of this methodology on this dataset demonstrates its promising efficacy and robustness.
