A ranking function used by search engines to estimate the relevance of documents to a given search query.
BM25 is a probabilistic retrieval model that ranks documents based on the frequency of query terms in each document, adjusted by document length and term saturation.
BM25 is part of the family of scoring functions based on the probabilistic retrieval framework. It uses parameters like k1 and b to adjust term frequency saturation and document length normalization.
Connect a bucket and Mixpeek runs the whole multimodal search pipeline for you: extraction, indexing, and search over your own objects. No models to wire up, nothing to host.
Start with ManagedKeep your embeddings on your own cloud and run dense, sparse, and BM25 search directly on object storage. First 1M vectors free.
Start with MVS