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.
Building similarity graph...
Analyzing shared references across papers
Loading...
Tianrui Li
Hongyu Yuan
Electronics
Henan University of Engineering
Building similarity graph...
Analyzing shared references across papers
Loading...
Li et al. (Sat,) studied this question.
www.synapsesocial.com/papers/69f2a47b8c0f03fd67763744 — DOI: https://doi.org/10.3390/electronics15091827
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: