用时空图结构处理古典小说问答,让答案可追溯、可验证。
NS-ST-GraphRAG: Neuro-Symbolic Spatio-Temporal GraphRAG for Literary Knowledge Processing

- 结合本体提取与时空约束,动态选择相关图状态
- 在120题测试集上机械答案准确率达0.733,优于基线
- 专为中文古典文学设计,适合需要可解释性的研究者
长篇文学叙事对检索增强生成提出独特挑战:相关证据分散在各章节,关系随时间演变,正确答案常需同时满足时间、空间与关系约束。我们提出NS-ST-GraphRAG,一种神经符号式时空图RAG框架,整合本体引导抽取、确定性约束检查、双时间坐标、空间场景属性及动态子图检索。不从单一全库图中检索,而是根据查询的时空范围选择有效图状态,并将生成答案锚定在可追溯证据上。我们进一步构建了红尘问答(Red-Chamber-QA),据知是首个面向古典中文文学的开放多跳问答基准,包含时间、空间与一般问题类别,每部分提供证据跨度,并设确定性捷径控制。在120题保留测试集上,NS-ST-GraphRAG的机械答案重现率达0.733,优于冻结窗口基线的0.675和闭卷模型的0.083(McNemar精确p=0.092,方向有利但不显著);语义判断准确率为0.866,高于基线的0.850。预设约束类别条件H2未被实验支持。结果表明,时空图表示、约束抽取与可审计评估可集成于统一框架,实现长篇叙事的可验证知识处理。
原文摘要 · Abstract (English)
Long-form literary narratives pose a distinctive information-processing challenge for retrieval-augmented generation: relevant evidence is distributed across chapters, relations evolve over narrative time, and correct answers may depend jointly on temporal, spatial, and relational constraints. We propose NS-ST-GraphRAG, a neuro-symbolic spatio-temporal GraphRAG framework that integrates ontology-guided extraction, deterministic constraint checking, dual temporal coordinates, spatial scene attributes, and dynamic sub-graph retrieval. Instead of retrieving from a single corpus-level graph, the framework selects the graph state valid for the temporal and spatial scope of a query and grounds generated answers in traceable evidence. We further introduce Red-Chamber-QA, to our knowledge the first open multi-hop question-answering benchmark for classical Chinese literature, with time-, space-, and general-question categories, per-part evidence spans, and deterministic shortcut controls. On a 120-question held-out split, NS-ST-GraphRAG achieves mechanical answer reproduction of 0.733 versus 0.675 for the frozen window baseline and 0.083 for a closed-book model (McNemar exact p = 0.092, directionally favorable but not significant); semantic-judge accuracy is 0.866 versus 0.850. The pre-specified constrained-category condition of H2 is not supported by the delivered comparison. These results show how temporal graph representation, constrained extraction, and auditable evaluation integrate into a unified framework for verifiable knowledge processing over long-form narrative.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。