bm25
technique judged 99% likely a named technique or architecture
See how it has spread across media tiers
Mentions over time
Table view
| Week | Articles | Sources |
|---|---|---|
| 2024-W11 | 1 | 1 |
| 2024-W26 | 1 | 1 |
| 2024-W33 | 1 | 1 |
| 2024-W38 | 1 | 1 |
| 2024-W41 | 1 | 1 |
| 2025-W47 | 1 | 1 |
| 2026-W09 | 1 | 1 |
| 2026-W11 | 6 | 1 |
| 2026-W15 | 1 | 1 |
| 2026-W18 | 1 | 1 |
| 2026-W20 | 1 | 1 |
| 2026-W22 | 1 | 1 |
| 2026-W24 | 3 | 2 |
| 2026-W25 | 1 | 1 |
| 2026-W31 | 1 | 1 |
| 2026-W32 | 2 | 2 |
| 2026-W35 | 1 | 1 |
| 2026-W36 | 1 | 1 |
| 2026-W38 | 1 | 1 |
| 2026-W40 | 5 | 3 |
| 2026-W41 | 1 | 1 |
In their words
score } for r in results ] def hybrid_search ( self , query_vector : List [ float ], query_text : str , limit : int = 10 , sparse_weight : float = 0.3 ) -> List [ dict ]: """ Combine dense + sparse (BM25) search.
Go hybrid: Combine dense vector search with keyword search (BM25).
The fix is dense neural embeddings combined with traditional keyword search (BM25) in a hybrid approach, fused using Reciprocal Rank Fusion(RRF) rather than an arbitrary weighted average.
toolsets: - type: mcp ref: docker:duckduckgodocker agent run agent.yaml - Multi-agent architecture — Create teams of specialized agents that delegate tasks automatically - Rich tool ecosystem — Built-in tools + any MCP server (local, remote, or Docker-based) - AI provider agnostic — OpenAI, Anthropic, Gemini, AWS Bedrock, Mistral, xAI, Docker Model Runner, and more - YAML configuration — Declarati
Elasticsearch BM25, vector, and hybrid retrieval in an established search platform Strong when the team already operates Elastic and needs lexical controls; cluster and relevance work are not removed.
Detail a dynamic strategy: if a query fails, your architecture decreases the vector search similarity threshold (e.g., moving cosine similarity from 0.85 to 0.70) or switches from a dense vector search to a keyword BM25 search.
vector , bm25 and hybrid all are for search: you give them a query, they score every memory against it, and you get the best ones back in ranked order.
In two-stage retrieval, a bi-encoder (an embedding model like text-embedding-3-large or Voyage-3) or BM25 fetches the top 100–200 candidates using a single dot-product per document.