Grid Search over Knowledge-Base Chunk Boundaries: Overlap Ratios and the Hybrid Weighting of Vector and Term-Frequency Retrieval: chapter answers

Building a knowledge base means fixing three numbers: chunk length, overlap between neighbouring chunks, and the blend weight between vector and term-frequency retrieval. Against the folk wisdom that smaller is more precise and one blend suffices, the commissioning claim says recall traces an inverted U against chunk length, overlap has diminishing returns, and the best blend depends on the query type. Implementing BM25 and a concept-level bag-of-words cosine in standard-library programs on fixed-seed synthetic corpora, the book corrects the blueprint in three places. The cited 2009 survey by…

DOI pending · monograph page goes live after publication · 5DL-B-261 · 中文版

Illustrative model calculation, not a live quote