{"categories":[{"label":"Text Processing","url":"https://skillfed.io/packages/category/text-processing"}],"enrichment":{"capability":"BM25S implements the BM25 ranking algorithm in pure Python with Numpy, enabling fast document retrieval and ranking based on text queries.","skillfed_tags":["information-retrieval","search-ranking","sparse-matrices"],"use_cases":["Build a search engine over a local document collection (CSV, JSON, JSONL, or text files) without external infrastructure","Rank documents by relevance to user queries in a Python application or web service","Prototype information retrieval systems before scaling to Elasticsearch or similar production systems","Index and search large corpora (millions of documents) with fast query-time performance","Combine BM25 ranking with other retrieval methods in a hybrid search pipeline"],"what_it_does":"BM25S is a pure-Python implementation of the BM25 ranking algorithm, a widely-used text retrieval function that scores how relevant documents are to a query. It uses sparse matrices to precompute and store token scores, enabling very fast retrieval at query time. The package is designed for simplicity\u2014it requires only Numpy and can be installed and used within minutes, with no Java or PyTorch dependencies.\n\nYou tokenize a corpus of documents, index them with the BM25 model, then query against the index to retrieve ranked results. The library supports optional stemming via PyStemmer and optional JIT compilation via Numba for additional speedup on larger datasets. It also provides a command-line interface for indexing and searching without writing Python code, and a high-level API for quick file-based indexing.","worth_installing":"Yes. BM25S is actively maintained, has no security vulnerabilities, installs with minimal friction, and is licensed permissively. It solves a real problem\u2014fast lexical search\u2014with a simple, dependency-light design. Install it if you need to rank documents by text relevance in Python without external services."},"id":"bm25s","links":{"html":"https://skillfed.io/packages/bm25s","md":"https://skillfed.io/packages/bm25s.md","pypi":"https://pypi.org/project/bm25s/"},"maintenance":{"status":"active"},"meta":{"latest_release":"2026-07-22","license_spdx":null,"license_treatment":"permissive","name":"bm25s","python_support":"supports_current","summary":"An ultra-fast implementation of BM25 based on sparse matrices."},"popularity":{"monthly_downloads":1923766,"position":3428,"tier":"top_5000"},"security":{"n_vulnerabilities":0},"version":"0.3.10"}