cs.CLNov 5, 2026

Bridging Structure and Semantics: Knowledge Graph Verification via Triple-to-Text Alignment

Authors: Ziang Cui

Organizations: Southeast University

Abstract

Semantic accuracy is an important dimension of knowledge graph quality. Graph-based scoring methods exploit relational structure, while textual representations allow classifiers to draw on knowledge encoded by pre-trained language models (PLMs). We present GenVer, a generative verifier that scores triples using both their serialized form and generated natural language representations (NLRs). A triple-text alignment procedure selects training pairs for a sequence-to-sequence generator; a BERT-based classifier then combines features from each triple and its generated NLR. On four FactFB variants, constructed from FB15k using perturbed negative triples, GenVer obtains the highest classification accuracy among the evaluated baselines, ranging from 88.56% to 91.52%. The experiments suggest that generated representations can help triple classification, while the case analysis also exposes semantic drift and high-confidence errors.

Figures & tables

Appendix figures & tables3 assets

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

Apr 5, 2026

Schema-Aware Planning and Hybrid Knowledge Toolset for Reliable Knowledge Graph Triple Verification

Knowledge Graphs (KGs) provide a critical foundation for many AI systems, yet their automated construction inevitably introduces noisy triples that undermine data trustworthiness. Reliable KG auditing requires jointly examining internal structural constraints and open-world evidence, whereas existing methods often rely on a single evidence source or static, one-shot inference, limiting adaptive evidence acquisition and auditability. We propose SHARP (Schema-Hybrid Agent for Reliable Prediction), a training-free agent that reformulates triple verification as a dynamic process of strategic planning, active investigation, and evidential reasoning. SHARP uses retrieved historical verification trajectories and entity--relation schema information to construct a task-specific investigation plan. It then iteratively coordinates KG and textual tools to cross-validate structural and semantic evidence, producing a verification verdict with a transparent evidence chain. On independently sampled, balanced test sets constructed from FB15K-237 and Wikidata5M-Ind, SHARP achieves average accuracies of 87.1% and 93.6%, respectively. Controlled comparisons with standard RAG using the same evidence sources, together with ablation studies, further show that the gains arise not merely from external retrieval, but from the combined effects of schema-aware planning, memory augmentation, and iterative hybrid tool use.
Oct 22, 2026

An Empirical Study of Recent Large Language Models for Knowledge Graph to Text Generation on Standard Benchmarks

Knowledge graph-to-text (KG-to-text) generation verbalizes a set of knowledge graph triples into fluent natural language. While fine-tuned encoder-decoder models have long been the standard approach, recent LLMs are becoming increasingly competitive. We benchmark recent LLMs against fine-tuned encoder-decoder models, using reference-based metrics and graph-grounded reference-free LLM-based evaluation validated against human annotations. We observed that recent LLMs substantially narrow, and in several settings close, the gap with fine-tuned models on reference-based metrics, while performing better on graph-grounded metrics. LLM-based evaluation scores show limited correlation with reference-based metrics, suggesting that the two approaches capture different aspects of generation quality. Graph-grounded evaluation reveals that prompted models produce fewer contradictions and triple omissions than fine-tuned models, and these errors increase more rapidly with graph size for fine-tuned models, highlighting differences between the two approaches that reference-based metrics may not fully capture.
Nov 11, 2025

VeriCypher: Named-Entity Verification for GraphRAG via Text-to-Cypher Generation

Knowledge graph question answering has traditionally focused on Resource Description Framework (RDF) graphs, SPARQL queries, and triple-based representations. Labeled Property Graphs (LPGs), however, pose a different challenge for LLM-based query generation: executable Cypher queries must align with schema structure, traversal direction, property keys, and literal entity values. This motivated us to introduce VeriCypher, an LLM-based text-to-Cypher framework for question answering over LPGs. It combines query generation conditioned on Cypher-like graph schema summaries with runtime execution, LLM-based query evaluation, and iterative correction where the central mechanism is named-entity verification: the system extracts node labels, relationship patterns, property keys, and literal values from generated queries, checks them against the target graph and schema, and turns mismatches into correction instructions for the next generation step. We evaluate VeriCypher on the CypherBench benchmark across multiple domains and LLM backbones. Compared with an LLM baseline, this method consistently improves answer correctness and query robustness. Ablation results further show that named-entity verification helps correct hallucinated schema elements and entity values, supporting more reliable LLM-based question answering over heterogeneous property graphs.