Faster Learned Sparse Retrieval with Block-Max Pruning. ACM SIGIR 2024.
☆35Jan 14, 2026Updated 2 months ago
Alternatives and similar repositories for BMP
Users that are interested in BMP are comparing it to the libraries listed below
Sorting:
- Rank-Biased Precision, Overlap, Recall, and Alignment☆12Feb 18, 2025Updated last year
- Official software repository of S. Bruch, F. M. Nardini, C. Rulli, and R. Venturini. "Efficient Inverted Indexes for Approximate Retrieva…☆105Jan 27, 2026Updated last month
- Experimental search engine in C/C++17 - still in early development.☆27Sep 5, 2025Updated 6 months ago
- A Python interface to PISA☆37Sep 23, 2025Updated 5 months ago
- An evaluation script based on the C/W/L framework that is TREC Compatible and provides a replacement for TREC_EVAL and independent script…☆15May 1, 2023Updated 2 years ago
- A missing piece of the Python multitask (both threads and processes) API: An extension that supports stateful worker pools & size-aware i…☆29Mar 8, 2026Updated last week
- ☆14Feb 20, 2025Updated last year
- A list of multi-vector retrieval resources☆18May 29, 2024Updated last year
- Tool for comparing two ranked lists (TREC run files)☆20Nov 9, 2022Updated 3 years ago
- ↕️ Intuitive axiomatic retrieval experimentation.☆31Updated this week
- This program implements the following graph reordering technique: Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Serg…☆10Sep 13, 2018Updated 7 years ago
- Code for the ECIR'22 paper "Evaluating the Robustness of Retrieval Pipelines with Query Variation Generators"☆17Feb 2, 2022Updated 4 years ago
- Segmented Code Adjustment Quantization (SAQ)☆18Sep 22, 2025Updated 5 months ago
- GitHub as a SNS☆10Jan 11, 2023Updated 3 years ago
- Experimental Code for "Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search"☆28Nov 4, 2024Updated last year
- Cloud Native Distributed Nearest Neighbour Search☆15Jun 9, 2020Updated 5 years ago
- Code of fine-tuning neural sparse models and training from scratch. #SIGIR2025☆24Mar 11, 2026Updated last week
- A Benchmark Workflow and Dataset Collection for Query Refinement☆25Jun 12, 2023Updated 2 years ago
- Repository related to the Dynamic Exploration Graph and its previous iterations.☆29Feb 13, 2026Updated last month
- Trully flash implementation of DeBERTa disentangled attention mechanism.☆81Feb 10, 2026Updated last month
- Joint Optimization of Cascade Ranking Models (WSDM 19)☆13Jun 21, 2022Updated 3 years ago
- provides a common interface to many IR measure tools☆97Feb 17, 2026Updated last month
- A fast header-only graph-based index for approximate nearest neighbor search (ANNS). https://flatnav.net☆46Mar 8, 2026Updated last week
- Source code for the paper: "Accelerating Graph Indexing for ANNS on Modern CPUs"☆34Nov 9, 2025Updated 4 months ago
- Reproducible IR experiments with Apache Lucene☆17Dec 25, 2023Updated 2 years ago
- Vector Index Benchmark for Embeddings (VIBE) is an extensible benchmark for approximate nearest neighbor search methods, or vector index…☆36Mar 4, 2026Updated 2 weeks ago
- ☆21Updated this week
- Suite of universal indexes for Highly Repetitive Document Collections☆24May 14, 2020Updated 5 years ago
- ☆24Apr 4, 2024Updated last year
- ⚡ PDX: A Library for Fast Vector Search and Indexing on CPUs (x86, ARM) — for Python and C++. Index millions of vectors in seconds. Searc…☆83Mar 6, 2026Updated 2 weeks ago
- ☆211Updated this week
- Open-Source Information Retrieval Reproducibility Challenge☆51Jan 11, 2016Updated 10 years ago
- Neural Solr = Solr 9 + Mighty Inference + Node☆18Jun 9, 2022Updated 3 years ago
- ☆15Dec 10, 2025Updated 3 months ago
- Baguetter is a flexible, efficient, and hackable search engine library implemented in Python. It's designed for quickly benchmarking, imp…☆209Aug 31, 2024Updated last year
- The inverted index exchange format as defined as part of the Open-Source IR Replicability Challenge (OSIRRC) initiative☆11Aug 6, 2025Updated 7 months ago
- ☆15Apr 14, 2023Updated 2 years ago
- ☆18Aug 21, 2025Updated 6 months ago
- ☆20Jun 1, 2025Updated 9 months ago