A three-stage, chunk-side-only semantic chunking pipeline---header-split, semantic merge, and title-chain prefixing---that costs zero additional LLM calls is presented, where the title chain reuses the document's own header hierarchy instead of a generated summary.
Abstract
Chunking is the first and most consequential step in retrieval-augmented generation (RAG): every downstream retrieval decision inherits the chunk boundaries. We present a three-stage, chunk-side-only semantic chunking pipeline---header-split, semantic merge, and title-chain prefixing---that costs zero additional LLM calls: the title chain reuses the document's own header hierarchy instead of a generated summary. On a 1600-query stratified evaluation over a production Markdown knowledge base, the pipeline improves MRR@5 from 0.374 to 0.463 (+23.8%) on the full set and from 0.828 to 0.925 (+11.7%) on the answerable subset (n=563), with dual-annotator Cohen's kappa 0.45 (unweighted, 16,000 score pairs). We then report what we tried and what failed: three query-side or architecture-level follow-ups are design dead ends (unevaluated---no comparable run artifacts), one measured failure (prefix weight decay), and one protocol-level failure that is the paper's central methodological finding. In a same-pool prefix on/off ablation, dual-annotator agreement collapsed from kappa 0.45 to 0.04 under identical prompts---stripping the title-chain context strips the disambiguation signal annotators need to agree on relevance. This measurement trap invalidates a common evaluation practice in chunking research and motivates retrieval-time per-candidate prefix evaluation, the direction we recommend from all our evidence.
We present ChunkRank, an open-source Python library that derives chunk boundaries from a target model's tokenizer and context window, and selects an answer among candidates produced independently per chunk. It ships a validated registry of 90 models across 15 providers and six answer-selection methods, and needs only t...
Amit Nautiyal, Ayush Bhatt, Gaurav Nautiyal· 0 citations
Semantic Compression Trees is introduced, a hierarchical index in which each node stores only its semantic residual -- the information it adds beyond its parent -- and retrieval proceeds by progressive descent from the root, so that per-query cost is governed by tree depth rather than collection size.
MGDR-SDR is proposed, a training-free approach that applies constituency parsing to derive three complementary representations of the utterance that drive a multi-granular retrieval procedure that aggregates evidence across dense and sparse channels, yielding broader and more precise demonstration coverage.
Tong Li, Zhi-Peng Du, Xinyu Hu et al.· Machine Learning and Knowled...· 0 citations
This paper presents a Hybrid Retrieval-Augmented Generation (RAG) framework for question answering on long-form policy documents. Dense-only retrieval, a common baseline in RAG pipelines, may struggle with exact lexical matching for structured information such as technical terminology, acronyms, and domain-specific ent...
Nur Fatini Abdul Ghani, Maizura Ibrahim, Mohamad Safuan B. Sulaiman et al.· 2026 7th International Confe...· 0 citations
Correct page selection, rather than semantic retrieval in isolation, is identified as the main opportunity for improvement in this setting of retrieval-augmented generation, with higher latency and more detected output artifacts.
Abdelhak Kelious· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.