Context-Aware Semantic Retrieval for Ancient Texts: A Native Reasoning Approach Based on In-Memory Knowledge Graph

This paper presents a lightweight semantic retrieval framework driven by an in-memory knowledge graph (IMKG) to overcome the limitations of traditional keyword matching and the prohibitive hardware costs of deep learning models in digitizing ancient Chinese literature. By extracting structured metadata from canonical texts, we construct a dense, bidirectional graph schema. Diverging from resource-intensive neural architectures, our system abandons heavyweight vector embeddings in favor of a highly optimized, template-based heuristic matching engine natively implemented in Java. This purely symbolic approach ensures deterministic execution, zero-dependency deployment, and seamless operation on standard CPU-only servers. To handle complex historical inquiries, the framework integrates a context-aware dialogue manager for multi-turn anaphora and ellipsis resolution, alongside a synergistic tiered caching mechanism. Extensive evaluations on a benchmark of 13,652 annotated queries demonstrate that the system achieves an exceptional intent recognition accuracy of 97.14%, robust context retention, and ultra-low response latency (≤17 ms). Ultimately, this architecture provides a sustainable, highly reproducible, and cost-effective paradigm for the semantic exploration of classical textual heritage, exceptionally suited for small-to-medium cultural institutions.

Authors

Institutions

Publication Details

Journal
Electronics
Published
2026-04-25
DOI
https://doi.org/10.3390/electronics15091827
Primary Topic
Topic Modeling
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Context-Aware Semantic Retrieval for Ancient Texts: A Native Reasoning Approach Based on In-Memory Knowledge Graph

Hongyu Yuan, Tianrui Li
Electronics
Topic Modeling
article

Context-Aware Semantic Retrieval for Ancient Texts: A Native Reasoning Approach Based on In-Memory Knowledge Graph

Hongyu Yuan, Tianrui Li
article en

Abstract

This paper presents a lightweight semantic retrieval framework driven by an in-memory knowledge graph (IMKG) to overcome the limitations of traditional keyword matching and the prohibitive hardware costs of deep learning models in digitizing ancient Chinese literature. By extracting structured metadata from canonical texts, we construct a dense, bidirectional graph schema. Diverging from resource-intensive neural architectures, our system abandons heavyweight vector embeddings in favor of a highly optimized, template-based heuristic matching engine natively implemented in Java. This purely symbolic approach ensures deterministic execution, zero-dependency deployment, and seamless operation on standard CPU-only servers. To handle complex historical inquiries, the framework integrates a context-aware dialogue manager for multi-turn anaphora and ellipsis resolution, alongside a synergistic tiered caching mechanism. Extensive evaluations on a benchmark of 13,652 annotated queries demonstrate that the system achieves an exceptional intent recognition accuracy of 97.14%, robust context retention, and ultra-low response latency (≤17 ms). Ultimately, this architecture provides a sustainable, highly reproducible, and cost-effective paradigm for the semantic exploration of classical textual heritage, exceptionally suited for small-to-medium cultural institutions.

ElectronicsVol. 15(9)
Henan University of Engineering (CN)
Natural Science Foundation of Henan Province
Openalex Percentile: Top 5%
Topic Modeling
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.