Semantic search finds content by meaning instead of exact words: the query and the documents are converted into embeddings, and the closest matches are returned even when no keyword overlaps.
No jargon, no math
Classic search compares strings: it only finds the words you type. Semantic search compares meanings. Here is the flow: you index the corpus once, converting every document into an embedding stored in a vector database. At each question, the query is turned into the same format and measured against all the vectors; the closest ones come back on top, with a similarity score. Matches below a threshold are cut, so the system can say “I found nothing” instead of passing off a near miss as the answer. In production it is often combined with a keyword pass: the hybrid covers jargon and abbreviations that embeddings alone can misread. The limit: if the right document is not in the corpus, no search magic brings it back.
Embedding. Your query is turned into a vector of numbers.
Index check. If the corpus is not embedded yet, that happens first, once.
Comparison. The query vector is measured against every document vector.
Ranking. Matches come back ordered by similarity score.
Threshold. Weak matches are cut, so nothing is forced.
An embedding is a list of numbers that captures the meaning of a piece of text, image or audio, so that content with similar meaning gets similar numbers and the computer can measure closeness with plain arithmetic.
ReadA vector database is a database built to store numeric fingerprints of content (embeddings) and find the closest ones to any query in milliseconds, powering semantic search, recommendations and AI retrieval.
ReadReranking is a second, slower pass over search results: a cross-encoder model reads each candidate together with the query and rescores it for true relevance, so the top results are the actually-right ones, not just the roughly-similar ones.
Read§ 04
We design and ship AI systems with permissions, logs and human approval. It starts with a 30-minute scoping call.