Alternatives and similar repositories for fast-approximate-filtering:

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

• rossanoventurini / Variable-BMW
  ☆12Updated 7 years ago
• jermp / autocomplete
  Efficient and effective query auto-completion in C++.
  ☆51Updated last year
• 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
• hpclab / rankeval
  Official repository of RankEval: An Evaluation and Analysis Framework for Learning-to-Rank Solutions.
  ☆88Updated 4 years ago
• simongog / sigir16-topkcomplete
  Example project presented at the Succinct Data Structure Tutorial at SIGIR 2016
  ☆24Updated 6 years ago
• jermp / 2i_bench
  A C++ library to benchmark inverted indexes.
  ☆20Updated 4 years ago
• olivierjeunen / dynamicindex
  C++ source code for the Dynamic Index algorithm proposed in "Efficient Similarity Computation for Collaborative Filtering in Dynamic Envi…
  ☆16Updated 5 years ago
• hpclab / quickrank
  Official repository of QuickRank: A C++ suite of Learning to Rank algorithms.
  ☆131Updated 5 years ago
• hamed-zamani / snrm
  Standalone Neural Ranking Model (SNRM)
  ☆74Updated 6 years ago
• patflick / psac
  Parallel Suffix Array, LCP Array, and Suffix Tree Construction
  ☆48Updated 5 years ago
• xxsds / multi_index
  A C++ template library for compact Hamming distance indexes
  ☆10Updated 7 years ago
• dynatrace-research / set-sketch-paper
  SetSketch: Filling the Gap between MinHash and HyperLogLog
  ☆49Updated 3 years ago
• jjfiv / fastrank
  My most frequently used learning-to-rank algorithms ported to rust for efficiency. Try it: "pip install fastrank".
  ☆51Updated last month
• puffinn / puffinn
  Parameterless and Universal FInding of Nearest Neighbors
  ☆57Updated 8 months ago
• jermp / opt_vbyte
  Optimal partitioning of Variable-Byte codes for better compression and fast decoding.
  ☆17Updated 3 years ago
• lintool / JASS
  Anytime Ranking for Impact-Ordered Indexes
  ☆12Updated 8 years ago
• markovi / LiDR
  Library for Distributed Retrieval
  ☆15Updated 10 years ago
• andrewtrotman / JASSv2
  Experimental search engine in C/C++17 - still in early development.
  ☆26Updated 3 months ago
• gvinciguerra / BlockEpsilonTree
  🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.
  ☆11Updated 2 years ago
• ten-blue-links / fxt
  A large scale feature extraction tool for text-based machine learning
  ☆32Updated 2 years ago
• migumar2 / libCSD
  C++ Library implementing Compressed String Dictionaries
  ☆46Updated 2 years ago
• kampersanda / dyft
  C++17 Implementation of Dynamic Filter Trie
  ☆8Updated 3 years ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆43Updated 4 months ago
• RTBHOUSE / cuda-ffm
  Field-aware Factorization Machines on CUDA
  ☆30Updated 7 years ago
• rmit-ir / LTR_Cascade
  Code repo for the SIGIR '17 paper "Efficient Cost-Aware Cascade Ranking for Multi-Stage Retrieval"
  ☆10Updated last year
• lintool / IR-Reproducibility
  Open-Source Information Retrieval Reproducibility Challenge
  ☆50Updated 9 years ago
• ot / ds2i
  A library of inverted index data structures
  ☆148Updated 2 years ago
• mocobeta / lucene-postings-format
  At-a-glance overview diagrams of Apache Lucene's default PostingsFormat (inverted index binary format).
  ☆79Updated last year
• simongog / surf
  SUccinct Retrieval Framework
  ☆19Updated 9 years ago