Embedding Nearest Neighbor Finder (BYO-key)

Find the most similar text from a list using real embeddings.

Ad placeholder (leaderboard)

Test semantic search with real embeddings, no infrastructure

Before you build a vector database, you often just want to know: will embeddings actually rank the right document at the top for my queries? This tool lets you paste a query and a list of candidates, embeds them all with your own OpenAI key in a single batched request, and ranks the candidates by cosine similarity — the same operation a vector store performs, but with zero setup.

How it works

You provide your OpenAI API key, a query, and one candidate per line. The tool sends all the texts to the embeddings endpoint in one request, retrieves the vectors, and computes cosine similarity between the query vector and each candidate vector. Because OpenAI embeddings are normalized, cosine similarity is a clean relevance measure: scores near 1 mean strong semantic overlap. Candidates are sorted highest-first so the best match is at the top.

Tips and notes

Your key never leaves your browser except to call OpenAI directly, and it is not stored. Start with text-embedding-3-small — it is inexpensive and accurate enough to validate most retrieval ideas; move to 3-large only if you need the extra precision. This is a great way to iterate on chunking and query phrasing: if the right candidate is not ranking first, the fix is usually better chunk boundaries or a clearer query, not a bigger model. For production, layer a reranker on top of the top results to push relevance even higher.

Ad placeholder (rectangle)