Alternatives and similar repositories for tongrams

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

• ot / ds2i
  A library of inverted index data structures
  ☆151Updated 3 years ago
• jermp / tongrams_estimation
  A C++ library implementing fast language models estimation using the 1-Sort algorithm.
  ☆17Updated 2 years ago
• jermp / s_indexes
  Universe-sliced indexes in C++.
  ☆18Updated 3 years ago
• fast-pack / PyFastPFor
  Python bindings for the fast integer compression library FastPFor.
  ☆61Updated 2 years ago
• puffinn / puffinn
  Parameterless and Universal FInding of Nearest Neighbors
  ☆59Updated 10 months ago
• simongog / surf
  SUccinct Retrieval Framework
  ☆21Updated 10 years ago
• jermp / autocomplete
  Efficient and effective query auto-completion in C++.
  ☆57Updated 2 years ago
• migumar2 / uiHRDC
  Suite of universal indexes for Highly Repetitive Document Collections
  ☆24Updated 5 years ago
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆27Updated 6 years ago
• benob / openfst-utils
  Utilities for manipulating finite state transducers with the OpenFst library.
  ☆32Updated 8 years ago
• ekzhu / lshensemble
  LSH index for approximate set containment search
  ☆61Updated 3 years ago
• ot / succinct
  A collection of succinct data structures
  ☆211Updated 2 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆58Updated 3 years ago
• vigna / sux
  Succinct data structures in C/C++
  ☆93Updated last year
• kampersanda / xcdat
  Fast compressed trie dictionary library
  ☆71Updated last year
• fwessels / simdcsv
  ☆37Updated 5 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆55Updated 2 years ago
• migumar2 / libCSD
  C++ Library implementing Compressed String Dictionaries
  ☆46Updated 3 years ago
• KeyviDev / keyvi
  Keyvi - the key value index. It is an in-memory FST-based data structure highly optimized for size and lookup performance.
  ☆257Updated this week
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆36Updated 3 years ago
• phaistos-networks / Trinity
  Trinity IR Infrastructure
  ☆239Updated 6 years ago
• src-d / minhashcuda
  Weighted MinHash implementation on CUDA (multi-gpu).
  ☆121Updated 2 years ago
• seomoz / simhash-cpp
  Simhashing in C++
  ☆136Updated 2 years ago
• andralex / MedianOfNinthers
  ☆50Updated 5 years ago
• gvinciguerra / BlockEpsilonTree
  🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.
  ☆15Updated 3 years ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆66Updated last year
• kampersanda / poplar-trie
  C++17 implementation of memory-efficient dynamic tries
  ☆58Updated 3 years ago
• simongog / sdsl
  Succinct Data Structure Library
  ☆109Updated 12 years ago
• erhanbaris / SymSpellPlusPlus
  SymSpell C++ Ports
  ☆31Updated 7 years ago
• patflick / psac
  Parallel Suffix Array, LCP Array, and Suffix Tree Construction
  ☆51Updated 6 years ago