Retrieval-Augmented Generation RAG π Look up relevant information first, paste it into the prompt, then let the model answer from it.
Grounding Making sure the answer is based on real source material rather than the model's impression of the world.
Hallucination confabulation π« The model states something false with complete confidence, because plausible text is all it was ever optimised for.
Embeddings π’ Turning text into a list of numbers positioned so that similar meanings land near each other.
Vector Space latent space Β· embedding space The imaginary landscape where similar ideas sit close together and unrelated ones sit far apart.
Cosine Similarity A way of measuring how close two pieces of meaning are, ignoring how long the text was.
Semantic Search π Searching by what you meant rather than the exact words you typed.
Chunking βοΈ Cutting long documents into pieces small enough to search and to fit in a prompt.
Chunk Overlap βοΈ Letting each piece share a little text with its neighbours so sentences aren't cut in half.
Document Loading π Getting text out of whatever format it was trapped in.
Vector Store vector database π A database built for finding the nearest meanings fast, even across millions of pieces.
Approximate Nearest Neighbour ANN Β· HNSW Finding almost-certainly the closest matches, very fast, instead of definitely the closest, slowly.
Indexing π The one-off job of preparing your documents so they can be searched quickly later.
Retrieval π The step that actually goes and fetches the passages most likely to answer the question.
Top-k π How many pieces of information you hand the model.
Recall & Precision Recall: did you find everything relevant? Precision: was everything you found relevant?
Reranking π₯ Taking the passages search found and reading each one properly against the question to reorder them.
Cross-Encoder π₯ A model that reads the question and the passage together, which is slower but much more accurate.
Bi-Encoder π’ A model that encodes questions and documents separately, so documents can be indexed ahead of time.
Hybrid Search π§² Running keyword search and meaning search together and merging the results.
BM25 keyword search Β· sparse retrieval π§² Classic keyword search: rank documents by which rare query words they contain.
Reciprocal Rank Fusion RRF π§² Merging two ranked lists by position rather than by score, since the two scores aren't comparable.
Query Rewriting βοΈ Turning what the user actually typed into something a search engine can work with.
HyDE hypothetical document embeddings βοΈ Have the model write a fake ideal answer, then search using that instead of the question.
Query Expansion βοΈ Adding synonyms and related terms to the search so you catch documents that used different words.
Multi-Hop Retrieval Questions that need two lookups β find A, then use A to find B.
Agentic RAG π€ Letting the model decide when to search again, what to search for, and when it has enough.
Citations attribution π Saying which source each claim came from, so a reader can check it.
Attribution π Tracing a statement back to the exact sentence that supports it.
Knowledge Graph GraphRAG Storing facts as things and the relationships between them, rather than as paragraphs.
Contextual Retrieval βοΈ Adding a sentence of surrounding context to each chunk before storing it, so isolated fragments still make sense.