Alternatives and similar repositories for autocomplete:

Users that are interested in autocomplete are comparing it to the libraries listed below

• jermp / tongrams_estimation
  A C++ library implementing fast language models estimation using the 1-Sort algorithm.
  ☆17Updated last year
• gvinciguerra / BlockEpsilonTree
  🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.
  ☆11Updated 2 years ago
• hpclab / fast-approximate-filtering
  Official repository of the ACM SIGIR 2019 paper: "Fast Approximate Filtering of Search Results Sorted by Attribute" by Franco Maria Nardi…
  ☆14Updated 5 years ago
• jermp / psds
  Efficient Prefix-Sum data structures in C++.
  ☆25Updated last year
• salesforce / QueryBlazer
  Official source code repository for QueryBlazer: Efficient Query Autocompletion Framework
  ☆19Updated 3 years ago
• jermp / opt_vbyte
  Optimal partitioning of Variable-Byte codes for better compression and fast decoding.
  ☆17Updated 3 years ago
• osirrc / ciff
  Common Index File Format to to support interoperability between open-source IR engines
  ☆32Updated 7 months ago
• jermp / 2i_bench
  A C++ library to benchmark inverted indexes.
  ☆20Updated 4 years ago
• kampersanda / xcdat
  Fast compressed trie dictionary library
  ☆68Updated 7 months ago
• JoshEngels / FLINNG
  A fast high dimensional near neighbor search algorithm based on group testing and locality sensitive hashing
  ☆22Updated last year
• andrewtrotman / JASSv2
  Experimental search engine in C/C++17 - still in early development.
  ☆27Updated 6 months ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• jjfiv / fastrank
  My most frequently used learning-to-rank algorithms ported to rust for efficiency. Try it: "pip install fastrank".
  ☆52Updated last month
• jermp / tongrams
  A C++ library providing fast language model queries in compressed space.
  ☆129Updated 2 years ago
• jermp / essentials
  Essential C++ utilities.
  ☆15Updated 3 weeks ago
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆29Updated 2 years ago
• vearch / gamma
  Real time vector search engine
  ☆137Updated 2 years ago
• BlaiseMuhirwa / flatnav
  A fast header-only graph-based index for approximate nearest neighbor search (ANNS). https://flatnav.net
  ☆19Updated 2 weeks ago
• nlescoua / faiss-quickeradc
  QuickerADC is an implementation of highly-efficient product quantizers leveraging SIMD shuffle instructions integrated into FAISS
  ☆16Updated 5 years ago
• patflick / psac
  Parallel Suffix Array, LCP Array, and Suffix Tree Construction
  ☆49Updated 5 years ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆43Updated 7 months 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
• technicolor-research / quick-adc
  Quick ADC
  ☆25Updated 5 years ago
• hpclab / quickscorer
  Official repository of Quickscorer: a fast algorithm to rank documents with additive ensembles of regression trees.
  ☆18Updated 8 years ago
• dmllr / fast-lopq
  Fast C++ implementation of https://github.com/yahoo/lopq: Locally Optimized Product Quantization (LOPQ) model and searcher for approximat…
  ☆34Updated 4 years ago
• rossanoventurini / Variable-BMW
  ☆12Updated 7 years ago
• puffinn / puffinn
  Parameterless and Universal FInding of Nearest Neighbors
  ☆59Updated last month
• simongog / surf
  SUccinct Retrieval Framework
  ☆20Updated 9 years ago
• jermp / clustered_elias_fano_indexes
  Clustered Elias-Fano inverted indexes.
  ☆15Updated 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 6 years ago