What Are Reranker Models?
5 entriesA reranker takes a query and a set of candidate documents from a first-stage search and reorders them by relevance, so only the best evidence reaches the LLM. Cross-encoders and LLM-based rerankers score each query and document pair together, which is slower but usually more precise than comparing stored embeddings. Details below come from each provider's documentation or model card; descriptions are not rankings, so test candidates on your own data.
Hosted Reranking APIs
9 entriesManaged rerankers, described from each provider's own documentation.
Open-Weight Rerankers
5 entriesModels whose weights can be downloaded. Licences are from each Hugging Face model card; read the licence before commercial use.
Rerankers With Restricted Licences
2 entriesModels whose licences limit commercial use or use a custom licence. Check the terms before building a product on them.
Libraries & Late-Interaction Tools
7 entriesLibraries for running rerankers and related retrieval methods. Release dates are from PyPI.
Frequently Asked Questions
What is a reranker model?
A model that scores how relevant each candidate document is to a query and reorders the candidates. It usually runs after a fast first-stage search, such as vector or keyword search, and passes only the top results to the LLM.
How is a reranker different from an embedding model?
An embedding model encodes the query and each document separately, so documents can be indexed ahead of time. A cross-encoder reranker reads the query and a document together and scores them jointly, which is slower but is usually more precise, so it is applied to a short candidate list.
Do I need a reranker for RAG?
Not always. Rerankers help most when first-stage retrieval returns many near-matches and the LLM context is limited. They add latency and cost, so measure retrieval quality with and without one on your own questions.
How many documents should I rerank?
Rerank enough candidates to cover the relevant ones, then keep a small top set for the LLM. Provider limits differ; for example, Pinecone documents 100 to 250 documents per request depending on the model. Test the candidate count against your latency budget.
What are late-interaction models such as ColBERT?
They keep a vector per token and score a query against a document by matching tokens, which sits between single-vector embeddings and full cross-encoders. Tools such as ColBERT and RAGatouille support this approach.
Are open-weight rerankers free for commercial use?
Not always. Qwen3-Reranker, BGE Reranker v2-M3 and mxbai-rerank list Apache-2.0, while Jina Reranker v3.5 lists CC BY-NC 4.0 and NVIDIA's Nemotron reranker uses a custom licence. Read each model card.
How current is this page?
Links and model details were checked on 31 October 2026 against provider documentation and Hugging Face model cards. Provider descriptions follow their own wording and are not rankings, and benchmark scores are not reported because they change.