Skip to content
ReviewRamble

The weekly brief

AI, reviewed, in your inbox.

  • New reviews of tools, models, MCP servers and repos, with the verdict up front
  • Re-checked prices and ratings when something changes
  • New analysis pieces as they are published

Models, agents, MCP servers and the tools actually worth your time.

One email a week. Unsubscribe with the link in any brief. How we use your email

Storage and retrieval

Embeddings, vector search and the other parts that let a model find the right facts.

Agentic RAG
Agentic RAG is retrieval-augmented generation run by an AI agent that decides when to search, what to search for and which source to use, and can search again if the first results fall short.
Approximate nearest neighbor search
Approximate nearest neighbor (ANN) search finds vectors close to a query without checking every stored vector. It gives up a guarantee of the exact best match in exchange for much faster search on large collections.
BM25
BM25 is a ranking formula for keyword search. It scores each document by how often the query's words appear in it, giving more weight to rare words and less credit to long documents and repeated terms.
Cosine similarity
Cosine similarity measures how alike two vectors are by the angle between them. It ranges from -1 to 1, ignores vector length, and is the most common way to compare embeddings in search.
Cross-encoder
A cross-encoder is a model that reads a query and a document together in one pass and outputs a relevance score. It is more accurate than comparing separate embeddings, but too slow to run over a whole collection.
Embedding
An embedding is a list of numbers (a vector) that represents a piece of text, an image or other data, produced so that items with similar meaning end up with vectors close together.
Embedding dimension
Embedding dimension is the number of values in each vector an embedding model outputs. More dimensions can hold more detail, but every extra value adds storage, memory and search cost per item.
GraphRAG
GraphRAG is a retrieval approach where an LLM first builds a knowledge graph from a document collection and writes summaries of related groups of entities, then answers questions using those summaries and graph links.
HNSW
HNSW (hierarchical navigable small world) is a graph-based index for approximate nearest neighbor search. It links vectors to their neighbors across several layers, so a search can hop quickly toward the closest matches.
Hybrid search
Hybrid search runs a keyword search and a vector search on the same query and merges the two ranked lists, so results can match on exact words as well as on meaning.
Knowledge base (AI)
In AI apps, a knowledge base is the collection of documents and data that an assistant or agent searches to answer questions, such as help articles, policies or product docs, kept separate from the model itself.
Knowledge graph
A knowledge graph stores information as entities (people, products, places, concepts) connected by named relationships, so software can follow links between facts instead of searching through loose text.
Late interaction (ColBERT)
Late interaction is a retrieval method, introduced by ColBERT, that encodes the query and each document separately into one vector per token, then scores a match by comparing those token vectors in a cheap final step.
Matryoshka embeddings
Matryoshka embeddings are vectors trained so that their first values carry the most information. You can cut them to a shorter length and still get useful search results, which saves storage and speeds up search.
Metadata filtering
Metadata filtering limits a search to items whose stored attributes, such as date, author, language or access group, match given conditions, alongside or before ranking them by vector similarity.
Query rewriting
Query rewriting changes a user's question before search, for example by clarifying it, splitting it or adding related terms, so the retriever is more likely to find the passages that answer it.
Reranking
Reranking is a second search step that takes a short list of candidate documents and reorders them by relevance to the query, using a more accurate but slower model than the first search.
Retrieval metrics (recall@k, nDCG, MRR)
Retrieval metrics score how well a search system returns relevant documents. Recall@k checks how many relevant items appear in the top k, nDCG rewards ranking them high, and MRR measures how early the first correct one appears.
Retrieval-augmented generation
Retrieval-augmented generation (RAG) is a pattern where a system first searches a collection of documents for passages relevant to a question, then gives those passages to a language model so its answer draws on them.
Sparse retrieval
Sparse retrieval represents queries and documents as vectors over a vocabulary where most entries are zero and each non-zero entry is a word weight, so search can use fast inverted indexes like keyword search.
Vector database
A vector database stores embeddings alongside their source records and finds the stored vectors closest to a query vector, usually with an approximate index so search stays fast across millions of items.
Vector search
Vector search finds items by comparing their embeddings to the embedding of a query and returning the closest ones, so results match on meaning rather than on shared keywords.