NativeScope: Relation-Localized Retrieval over Native Topology with a Correct Anchor
Long Wang
Abstract
Dense retrieval usually ranks text chunks by their semantic similarity to a question. This ignores structure that many data systems already store, including section membership, session boundaries, and native order. We propose NativeScope, a scope-then-rank method for queries with a known anchor and relation. It represents a query as q -> (A, r, B). The anchor A and relation r select native units through belonging, before, or after operators, and the target term B ranks only chunks that overlap the selected scope. An internal variant, NS-FullQ, ranks the same candidates with the full question. We evaluate both methods on 200 controlled document and memory records derived from QASPER and LongMemEval under a 1,024-token budget. NativeScope attains native-unit recall of 89.28 percent for documents and 72.50 percent for memories, improving over instance-wide Dense RAG by 42.75 and 22.00 percentage points. NS-FullQ reaches 87.78 percent and 68.50 percent; its differences from NativeScope are inconclusive, locating the primary gain in relational scoping rather than the shorter ranking query. With automatic Top-1 anchors, memory recall falls to 35.50 percent. NativeScope is therefore effective when anchor coordinates and native relations are reliable, but hard scoping inherits errors from the localization interface.
Create a lesson
Related papers
Tracing and Taming Hallucinated Terms via Subsequence-Association Filtering and Breadth-Aware Selection for LLM Query Expansion
Amit Kumar Jaiswal, Sagar Uprety, Prayag Tiwari
SPARQL-LLM in the TEXT2SPARQL 2026 Challenge
Panayiotis Smeros, Vincent Emonet, Ruijie Wang et al.
NEAR: Neighborhood-Aware Residuals for Memory Retrieval
Han Luo, Zhan Zhuang, Xu He et al.
PRIME: Pre-Retrieval Index Modeling Enhancement for Structured Document Retrieval-Real
Cheuk Hei Chung, Li Liu
Beyond the Final Embedding: Retrieving Memories from Token-Level Evidence
Han Luo, Zhan Zhuang, Xu He et al.
Compact and Efficient Indexes for Learned Sparse Retrieval
Franco Maria Nardini, Luca Rizzo, Cosimo Rulli et al.