Skip to content
BENIBIX Learn

Retrieval & Search

RAG, embeddings and AI search · 37 terms

Sort
Compare

Embeddings

8

How text becomes a list of numbers, and how to tell which lists are close.

A list of numbers that stands for what a piece of text means.

A model that reads text and gives back a list of numbers.

How many numbers each embedding holds. More can mean finer meaning, but more cost.

A list of numbers with a value in each slot. It holds meaning, not exact words.

A long list of numbers, mostly zeros. Each slot stands for one word.

A score that says how alike two vectors are, by their angle.

Finding the stored vectors closest to the one you ask with.

A fast search for close vectors that may miss a few of the very best.

Vector Databases

10

Where the number lists are kept, and how they are found again fast.

A place to keep embeddings and find the closest ones fast.

A vector database you rent online. There is nothing to set up or run.

A free add-on for Postgres. It lets the database store and search vectors.

A free vector database that anyone can use. You can start in minutes.

A free vector database. It is built for fast search with filters.

A free vector database. It mixes search by meaning and by words.

A map that finds close vectors fast, so you do not look at all of them.

A fast vector index made of layers of linked points.

A free code tool for fast vector search. It goes inside your own program.

A search that only looks at rows with the right tags, like a date.

RAG Systems

11

How a model is handed the right text before it answers, so it can stick to the facts.

First find the right pages, then let the model answer from them.

Tying a model's answer to trusted sources, so each claim can be checked.

Retrieval Pipeline

6

The steps from a pile of files to the few chunks a model reads: parse, chunk, search and pick.

The set of files an AI looks through. Then it gives its answer.

Turning PDFs, slides and pages into clean text before they are chunked.

Cutting a long file into small bits. Then search can find the right bit.

The part of a RAG system that finds the best chunks for a question.

A vague question is made clear first. Then the search runs.

Returning only the k best matches from a search. You choose the k.

Retrieval Patterns

3

Ways to make retrieval smarter than one plain search, from notes on each chunk to graphs and agents.

Each chunk gets a short note that says where it came from.

RAG where the model does its own search, a few times, then answers.

RAG that makes a map of facts from your files. Then it searches that map too.