Bi-encoder candidates
| Rank | Document | Category | Cosine score |
|---|
A two-stage Transformer ranking system using a MiniLM bi-encoder for semantic candidate retrieval and an MS MARCO MiniLM cross-encoder for query-document reranking.
| Rank | Document | Category | Cosine score |
|---|
| Final | Move | Document | Cross score |
|---|
The bi-encoder embeds documents once and embeds each query independently. This makes candidate search efficient and reusable.
The cross-encoder reads the query and document together, enabling richer token-level interaction and more precise relevance scoring.
The slower model evaluates only the top candidate set, preserving interactive latency while improving the final order.
Live values for the currently selected query are displayed in the results section above. The cards below explain each measure, while the verified BEIR section reports aggregate performance across hundreds of held-out benchmark queries.
Measures whether known relevant documents entered the candidate set. A reranker cannot recover a document that was never retrieved.
Rewards systems that place the first relevant result as early as possible in the first ten positions.
Uses graded relevance and penalizes useful documents that appear lower in the ranked list.
Separates model loading, document indexing, query embedding, retrieval, reranking, and total search time.
These fixed values were generated offline with the Python evaluation pipeline. They are separate from the live query-specific metrics shown above.
This project is an educational portfolio demonstration. Rankings may be incomplete, biased, irrelevant, or misleading. Cross-encoder outputs are relevance estimates—not factual guarantees or calibrated probabilities.
Do not upload confidential, proprietary, copyrighted, sensitive, or personally identifiable content. Do not use this demo as the sole basis for hiring, rejection, compensation, promotion, immigration, legal, or employment decisions.