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.
  ☆88Updated 4 years ago
• jermp / autocomplete
  Efficient and effective query auto-completion in C++.
  ☆55Updated last year
• simongog / sigir16-topkcomplete
  Example project presented at the Succinct Data Structure Tutorial at SIGIR 2016
  ☆25Updated 6 years ago
• rossanoventurini / Variable-BMW
  ☆12Updated 7 years ago
• puffinn / puffinn
  Parameterless and Universal FInding of Nearest Neighbors
  ☆60Updated 4 months ago
• hpclab / quickrank
  Official repository of QuickRank: A C++ suite of Learning to Rank algorithms.
  ☆131Updated 6 years ago
• jjfiv / fastrank
  My most frequently used learning-to-rank algorithms ported to rust for efficiency. Try it: "pip install fastrank".
  ☆52Updated 5 months ago
• hamed-zamani / snrm
  Standalone Neural Ranking Model (SNRM)
  ☆76Updated 6 years ago
• patflick / psac
  Parallel Suffix Array, LCP Array, and Suffix Tree Construction
  ☆49Updated 5 years ago
• lintool / IR-Reproducibility
  Open-Source Information Retrieval Reproducibility Challenge
  ☆50Updated 9 years ago
• andrewtrotman / JASSv2
  Experimental search engine in C/C++17 - still in early development.
  ☆27Updated last week
• hpclab / quickscorer
  Official repository of Quickscorer: a fast algorithm to rank documents with additive ensembles of regression trees.
  ☆18Updated 8 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
• ot / ds2i
  A library of inverted index data structures
  ☆150Updated 2 years ago
• jermp / psds
  Efficient Prefix-Sum data structures in C++.
  ☆26Updated last year
• jermp / 2i_bench
  A C++ library to benchmark inverted indexes.
  ☆20Updated 5 years ago
• jermp / opt_vbyte
  Optimal partitioning of Variable-Byte codes for better compression and fast decoding.
  ☆17Updated 3 years ago
• markovi / LiDR
  Library for Distributed Retrieval
  ☆15Updated 11 years ago
• matsui528 / rii
  Fast and memory-efficient ANN with a subset-search functionality
  ☆154Updated last month
• tudocomp / tudocomp
  TU DOrtmund lossless COMPression framework
  ☆19Updated 11 months ago
• simongog / surf
  SUccinct Retrieval Framework
  ☆20Updated 9 years ago
• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆112Updated last year
• hpclab / efficient-query-expansion
  Official repository of "Efficient and Effective Query Expansion for Web Search", Short Paper @ CIKM 2018
  ☆15Updated 5 years ago
• angeloskath / supervised-lda
  A flexible variational inference LDA library.
  ☆23Updated 6 years ago
• searchivarius / AccurateLuceneBM25
  Improving the effectiveness Lucene's BM25 (and testing it using Yahoo! Answers and Stack Overflow collections)
  ☆16Updated 3 years ago
• kampersanda / dyft
  C++17 Implementation of Dynamic Filter Trie
  ☆8Updated 3 years ago
• chokkan / simstring
  SimString
  ☆113Updated 4 years ago
• s-yata / madoka
  Count-Min sketch-based approximate counting library
  ☆45Updated 2 months ago
• salviati / slash
  A locality-sensitive hashing library
  ☆46Updated 11 years ago
• microsoft / irmetrics-r
  R library for common information retrieval metrics
  ☆13Updated 2 years ago