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 5 years ago
• rossanoventurini / Variable-BMW
  ☆13Updated 8 years ago
• simongog / sigir16-topkcomplete
  Example project presented at the Succinct Data Structure Tutorial at SIGIR 2016
  ☆26Updated 7 years ago
• hpclab / quickrank
  Official repository of QuickRank: A C++ suite of Learning to Rank algorithms.
  ☆131Updated 6 years ago
• jermp / autocomplete
  Efficient and effective query auto-completion in C++.
  ☆56Updated 2 years ago
• jjfiv / fastrank
  My most frequently used learning-to-rank algorithms ported to rust for efficiency. Try it: "pip install fastrank".
  ☆52Updated 8 months ago
• ot / ds2i
  A library of inverted index data structures
  ☆151Updated 2 years ago
• simongog / surf
  SUccinct Retrieval Framework
  ☆21Updated 9 years ago
• hamed-zamani / snrm
  Standalone Neural Ranking Model (SNRM)
  ☆76Updated 6 years ago
• markovi / LiDR
  Library for Distributed Retrieval
  ☆15Updated 11 years ago
• olivierjeunen / dynamicindex
  C++ source code for the Dynamic Index algorithm proposed in "Efficient Similarity Computation for Collaborative Filtering in Dynamic Envi…
  ☆16Updated 6 years ago
• mpetri / recursive_graph_bisection
  This program implements the following graph reordering technique: Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Serg…
  ☆10Updated 7 years ago
• puffinn / puffinn
  Parameterless and Universal FInding of Nearest Neighbors
  ☆59Updated 8 months ago
• hpclab / quickscorer
  Official repository of Quickscorer: a fast algorithm to rank documents with additive ensembles of regression trees.
  ☆18Updated 9 years ago
• matsui528 / rii
  Fast and memory-efficient ANN with a subset-search functionality
  ☆154Updated 4 months ago
• patflick / psac
  Parallel Suffix Array, LCP Array, and Suffix Tree Construction
  ☆51Updated 6 years ago
• chokkan / simstring
  SimString
  ☆113Updated 4 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 2 months ago
• ibayer / fastFM-core
  A short paper describing the library is available on arXiv.
  ☆65Updated 7 years ago
• leifos / simiir
  A toolkit for simulating interactive information retrieval
  ☆21Updated 7 years ago
• jermp / psds
  Efficient Prefix-Sum data structures in C++.
  ☆25Updated 2 years ago
• jermp / opt_vbyte
  Optimal partitioning of Variable-Byte codes for better compression and fast decoding.
  ☆17Updated 4 years ago
• searchivarius / AccurateLuceneBM25
  Improving the effectiveness Lucene's BM25 (and testing it using Yahoo! Answers and Stack Overflow collections)
  ☆16Updated 3 years ago
• jermp / 2i_bench
  A C++ library to benchmark inverted indexes.
  ☆21Updated 5 years ago
• aboffa / CoCo-trie
  COllapsed and COmpressed trie: a data-aware compressed string dictionary
  ☆36Updated 9 months ago
• HarrieO / OnlineLearningToRank
  ☆63Updated 5 years ago
• jermp / tongrams
  A C++ library providing fast language model queries in compressed space.
  ☆132Updated 2 years ago
• migumar2 / libCSD
  C++ Library implementing Compressed String Dictionaries
  ☆46Updated 3 years ago
• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆112Updated last year