A comparative study conducted within BMW AG, focusing on the application of LLM-based Text2Cypher generation for querying a domain-specific knowledge graph designed to support virtual product development, reveals that the primary challenge in industrial Text2Cypher generation lies in correctly interpreting domain-specific graph semantics, particularly relationship selection and graph traversal.
Abstract
In recent years, the integration of Large Language Models (LLMs) with knowledge graphs has gained increasing attention as an approach to improve information retrieval and data accessibility. However, few studies have compared finetuned and prompt-based LLM approaches for generating Cypher queries from natural language inputs. This paper presents a comparative study conducted within BMW AG, focusing on the application of LLM-based Text2Cypher generation for querying a domain-specific knowledge graph designed to support virtual product development. Three approaches are evaluated: a baseline model fine-tuned for generic Cypher generation, a newly developed domain-specific fine-tuned model (KG-Finetune-LLM), and an embedding-based prompt engineering approach (KG-Embed-LLM) leveraging GPT-4. Results show that the KG-Embed-LLM achieves the highest retrieval accuracy (96.88%), outperforming both fine-tuned models. Error analysis further reveals that the primary challenge in industrial Text2Cypher generation lies in correctly interpreting domain-specific graph semantics, particularly relationship selection and graph traversal, rather than in generating syntactically valid Cypher queries. The findings highlight the importance of schema-aware grounding for domain-specific knowledge graph applications and identify key trade-offs between retrieval accuracy, deployment complexity, and reliance on external LLM services. Finally, the study outlines future research directions related to ontology complexity and robustness in enterprise knowledge graph environments.
GCA-KBQA is proposed, a step-wise fine-tuned LLM-based framework that employs hop-wise generation, knowledge-assisted calibration, and path-level assembly to construct complete LFs for KBQA, demonstrating its superior performance compared to state-of-the-art baselines.
Ran-Ran Bu, Jian Cao, Jian-Qi Gao et al.· Annual International ACM SIG...· 0 citations
This study explores a semantic variation methodology to augment training data by generating question-answer pairs with explicit control over semantic similarity, and shows that semantically controlled augmentation improves domain-specific knowledge acquisition while preserving consistency.
Alexander Chen, Caroline Tang, Jennifer Sleeman· TEXT2KG/BiKE@ESWC· 0 citations
AssistEM, a framework for efficient LLM adaptation to EM via principled data selection, demonstrates that selective fine-tuning not only accelerates adaptation but also improves training efficiency (requiring fewer GPU hours), enabling open-source LLMs to rival–and in some cases outperform–closed-source models.
John Bosco Mugeni, Steven J. Lynden, Toshiyuki Amagasa et al.· International Journal of Dat...· 1 citation
Knowledge graph question answering (KGQA) focuses on answering questions with data retrieved from knowledge graphs (KGs). Although Large Language Models (LLMs) have enabled the development of innovative KGQA systems, serious challenges remain. Approaches that utilize supervised finetuning are accurate and responsive, b...
Sergios-Anestis Kefalidis, Konstantinos Plas, Manolis Koubarakis· Proceedings of the 32nd ACM...· 0 citations
This paper investigates the effectiveness of specializing ultra-compact language models for clinical embedding generation, utilizing the EmbeddingGemma 300M as the base model, and demonstrates the feasibility of performing fine-tuning on entry-level hardware.
Experiments on three different domain tasks show that FKGLM can effectively integrate LLMs and large-scale knowledge graphs, leading to a significant enhancement in the reasoning capabilities of LLMs.
Yulin Zhou, Yongbin Qin, Chuan Lin· Journal of King Saud Univers...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.