Alternatives and similar repositories for fast-approximate-filtering

Users that are interested in fast-approximate-filtering are comparing it to the libraries listed below

• hpclab / rankeval
  Official repository of RankEval: An Evaluation and Analysis Framework for Learning-to-Rank Solutions.
  ☆89Updated 4 years ago
• rossanoventurini / Variable-BMW
  ☆12Updated 7 years ago
• mpetri / recursive_graph_bisection
  This program implements the following graph reordering technique: Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Serg…
  ☆10Updated 6 years ago
• simongog / sigir16-topkcomplete
  Example project presented at the Succinct Data Structure Tutorial at SIGIR 2016
  ☆25Updated 6 years ago
• jermp / autocomplete
  Efficient and effective query auto-completion in C++.
  ☆55Updated last year
• markovi / LiDR
  Library for Distributed Retrieval
  ☆15Updated 11 years ago
• hpclab / quickscorer
  Official repository of Quickscorer: a fast algorithm to rank documents with additive ensembles of regression trees.
  ☆18Updated 8 years ago
• andrewtrotman / JASSv2
  Experimental search engine in C/C++17 - still in early development.
  ☆27Updated 9 months ago
• ot / ds2i
  A library of inverted index data structures
  ☆150Updated 2 years ago
• hpclab / quickrank
  Official repository of QuickRank: A C++ suite of Learning to Rank algorithms.
  ☆131Updated 6 years ago
• puffinn / puffinn
  Parameterless and Universal FInding of Nearest Neighbors
  ☆60Updated 4 months ago
• patflick / psac
  Parallel Suffix Array, LCP Array, and Suffix Tree Construction
  ☆49Updated 5 years ago
• jjfiv / fastrank
  My most frequently used learning-to-rank algorithms ported to rust for efficiency. Try it: "pip install fastrank".
  ☆52Updated 4 months ago
• jermp / opt_vbyte
  Optimal partitioning of Variable-Byte codes for better compression and fast decoding.
  ☆17Updated 3 years ago
• lijinf2 / losha
  Distributed similarity search
  ☆9Updated 5 years ago
• stanford-futuredata / wmsketch
  Sketching linear classifiers over data streams with the Weight-Median Sketch (SIGMOD 2018).
  ☆39Updated 6 years ago
• ten-blue-links / fxt
  A large scale feature extraction tool for text-based machine learning
  ☆32Updated 2 years ago
• hamed-zamani / snrm
  Standalone Neural Ranking Model (SNRM)
  ☆76Updated 6 years ago
• matsui528 / rii
  Fast and memory-efficient ANN with a subset-search functionality
  ☆154Updated 2 weeks ago
• lintool / JASS
  Anytime Ranking for Impact-Ordered Indexes
  ☆13Updated 8 years ago
• salviati / slash
  A locality-sensitive hashing library
  ☆46Updated 11 years ago
• rmit-ir / LTR_Cascade
  Code repo for the SIGIR '17 paper "Efficient Cost-Aware Cascade Ranking for Multi-Stage Retrieval"
  ☆10Updated 2 years ago
• jermp / 2i_bench
  A C++ library to benchmark inverted indexes.
  ☆20Updated 4 years ago
• talwagner / quadsketch
  Implementation of QuadSketch algorithm
  ☆11Updated 2 years ago
• chokkan / simstring
  SimString
  ☆113Updated 4 years ago
• lintool / IR-Reproducibility
  Open-Source Information Retrieval Reproducibility Challenge
  ☆50Updated 9 years ago
• dynatrace-research / set-sketch-paper
  SetSketch: Filling the Gap between MinHash and HyperLogLog
  ☆49Updated 3 years ago
• simongog / surf
  SUccinct Retrieval Framework
  ☆20Updated 9 years ago
• aboffa / CoCo-trie
  COllapsed and COmpressed trie: a data-aware compressed string dictionary
  ☆35Updated 5 months ago
• koeppl / separate_chaining
  Hash table with separate chaining layout
  ☆9Updated 3 years ago