LegközelebbKövetkező útmutató
Retrieval Metrics: Recall@K, MRR and nDCG
Műszaki
Műszaki ÚTMUTATÓ
Parent document retrieval, also called small-to-big retrieval, searches over small, precise text chunks but hands the language model the larger section or document each chunk came from.
Hallgassa meg ezt az útmutatótAI-narrált · ~3 min
It matters because it removes the usual chunking trade-off: small chunks match queries accurately, and the larger parent gives the model enough context to answer correctly.
Fixed-size chunking forces a trade-off. Small chunks, say a few sentences, produce sharp embeddings: the vector represents one idea, so a query about that idea matches it closely. But a two-sentence chunk rarely contains enough context for the model to answer well; it may omit the definition three paragraphs earlier or the exception in the next sentence. Large chunks carry that context, but their embeddings blur several ideas together, so retrieval gets less precise and the relevant passage can be outscored by a chunk that is merely on-topic. Small-to-big retrieval splits the two jobs. The system indexes small child chunks for search, and each child keeps a pointer to a larger parent: a section, a page, or the whole document. At query time it finds the best children, then looks up and returns their parents. If several children share one parent, the parent is sent once, which also removes duplicates. LangChain's ParentDocumentRetriever implements this with a vector store for children and a separate document store for parents. LlamaIndex offers related patterns: sentence-window retrieval, which returns a matched sentence plus a fixed number of neighboring sentences, and auto-merging retrieval, which replaces many retrieved leaf chunks with their shared parent node when enough of them match. The approach tends to beat fixed-size chunking on structured documents such as manuals, contracts, policies and textbooks, where meaning depends on the surrounding section. It helps less when documents are already short, or when parents are so large that a few of them overflow the context window or bury the answer in irrelevant text. A common misconception is that this is just using bigger chunks. It is not: the retrieval unit and the generation unit are deliberately different sizes, so you keep precise matching without starving the model of context.
An internal IT help bot indexes each troubleshooting step as a separate child chunk, but when a step matches it returns the whole procedure, so the model does not tell users to do step 4 without steps 1 to 3.
A legal research tool matches a single clause about termination notice periods, then passes the model the full contract section, including the definitions and exceptions that change what the clause means.
A university course assistant searches sentence-level chunks from lecture notes and returns the surrounding page, so answers about a formula also include the conditions under which it applies.
An insurance claims assistant retrieves several small matches from one policy document, groups them by parent, and sends that policy section once instead of five overlapping fragments.
Small-to-big is becoming a default rather than a trick, and major frameworks already expose hierarchical or windowed retrieval as configuration options. Larger context windows reduce the penalty of sending bigger parents, which makes the pattern cheaper to adopt. Open questions remain about choosing parent boundaries automatically, for example using document layout analysis or learned segmentation instead of relying on headings. It is increasingly combined with rerankers and with contextual-embedding approaches that try to give small chunks awareness of their surroundings at indexing time. Testing on your own documents, rather than general benchmarks, remains the reliable way to pick child and parent sizes.
Ingyenes hírlevél
Minden hétköznap reggel három ellenőrzött AI történet, egyszerű angol nyelven. Örökké ingyen, hirdetések nélkül.
Minden hétköznap egy e-mail. Egy kattintással lemondhat. Soha nem értékesítjük vagy osztjuk meg az Ön címét.
Teszteld magad
Azonnali visszajelzés minden válaszra, és megosztható tanúsítvány egy ellenőrizhető azonosítóval, miután sikeresen teljesít egy kurzust.
Támogassa az ingyenes AI oktatást. AI Understanding egy 501(c)(3) nonprofit – nincs hirdetés, nincs fizetőfal, soha. Tegyen adományt
Parent document retrieval, also called small-to-big retrieval, searches over small, precise text chunks but hands the language model the larger section or document each chunk came from. It matters because it removes the usual chunking trade-off: small chunks match queries accurately, and the larger parent gives the model enough context to answer correctly.
Small chunks give focused embeddings but too little context; large chunks give context but blurry embeddings. Small-to-big searches small and returns big to get both.
Children are indexed for precise matching; parents are only looked up after a child matches.
Grouping by parent means the section is included once, which saves tokens and removes duplicate fragments.
Children are embedded in a vector store for search, while full parents sit in a document store and are fetched by ID.
Sentence-window retrieval matches at sentence level and then expands to a window of surrounding sentences to supply context.
Tanulj tovább
További útmutatók készültek ehhez a témához
LegközelebbKövetkező útmutató
Retrieval Metrics: Recall@K, MRR and nDCG
Műszaki