Cuestionario vinculado a una guía · Medio Nivel
Documento principal y cuestionario de recuperación de pequeños a grandes
Pruebe su comprensión de la recuperación de pequeño a grande: fragmentos secundarios y principales, ventana de oración y recuperación de fusión automática, y cuándo supera los fragmentos fijos.
Pregunta 1 de 8
¿Qué compensación central aborda la recuperación de pequeño a grande?
Vista previa de cada pregunta8 preguntas
Las respuestas y explicaciones aparecen a medida que realiza el cuestionario.
- ¿Qué compensación central aborda la recuperación de pequeño a grande?
- Embedding models are too slow for large documents
- Small chunks match precisely but lack context, while large chunks carry context but match poorly
- Vector databases cannot store documents longer than one page
- Language models can only read one chunk per request
- En un sistema de pequeño a grande, ¿qué se integra y se busca en el momento de la consulta?
- Small child chunks
- Whole parent documents only
- Document titles only
- The model's previous answers
- Si tres fragmentos secundarios recuperados pertenecen a la misma sección principal, ¿qué debería hacer el sistema?
- Send all three children and the parent
- Discard the children because they overlap
- Send the shared parent once
- Send only the lowest-scoring child
- ¿Cómo almacena ParentDocumentRetriever de LangChain los dos niveles de texto?
- Both levels in a single vector index with no links
- Parents in the vector store and children discarded
- Children in a relational table, parents in the model's weights
- Children in a vector store and parents in a separate document store
- ¿Qué devuelve la recuperación de ventana de oración?
- Only the single matched sentence
- The matched sentence plus a fixed number of neighboring sentences
- A random sample of sentences from the document
- The document's title and summary
- What does auto-merging retrieval do when enough leaf chunks from the same parent node are retrieved?
- It deletes the parent node from the index
- It asks the user which leaf to keep
- It replaces the leaf chunks with their shared parent node
- It re-embeds the leaves as one vector
- In which situation does small-to-big retrieval help the least?
- When the documents are already short
- When documents are long manuals with sections
- When meaning depends on surrounding definitions
- When several matches come from one contract section
- Why store a parent_id in each child chunk's metadata?
- So the model can be fine-tuned on parent IDs
- To make embeddings smaller
- To hide parents from the user
- So expanding a child to its parent is a cheap key-value lookup instead of another search