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 2 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 2 years ago
• fast-pack / PyFastPFor
  Python bindings for the fast integer compression library FastPFor.
  ☆61Updated 2 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆55Updated last year
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆57Updated 2 years ago
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆27Updated 6 years ago
• jermp / autocomplete
  Efficient and effective query auto-completion in C++.
  ☆57Updated 2 years ago
• ot / succinct
  A collection of succinct data structures
  ☆211Updated last year
• migumar2 / uiHRDC
  Suite of universal indexes for Highly Repetitive Document Collections
  ☆22Updated 5 years ago
• simongog / surf
  SUccinct Retrieval Framework
  ☆21Updated 9 years ago
• kampersanda / xcdat
  Fast compressed trie dictionary library
  ☆71Updated last year
• puffinn / puffinn
  Parameterless and Universal FInding of Nearest Neighbors
  ☆59Updated 8 months ago
• fwessels / simdcsv
  ☆37Updated 5 years ago
• src-d / minhashcuda
  Weighted MinHash implementation on CUDA (multi-gpu).
  ☆121Updated 2 years ago
• simongog / sdsl
  Succinct Data Structure Library
  ☆108Updated 12 years ago
• ot / partitioned_elias_fano
  Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"
  ☆40Updated 10 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.
  ☆254Updated last week
• andralex / MedianOfNinthers
  ☆50Updated 5 years ago
• mpetri / FM-Index
  FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…
  ☆107Updated 10 years ago
• gvinciguerra / BlockEpsilonTree
  🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.
  ☆15Updated 3 years ago
• erhanbaris / SymSpellPlusPlus
  SymSpell C++ Ports
  ☆31Updated 7 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• simongog / sigir16-topkcomplete
  Example project presented at the Succinct Data Structure Tutorial at SIGIR 2016
  ☆27Updated 7 years ago
• phaistos-networks / Trinity
  Trinity IR Infrastructure
  ☆239Updated 6 years ago
• vigna / sux
  Succinct data structures in C/C++
  ☆92Updated last year
• steveash / jopenfst
  Partial Java port of the C++ OpenFST library
  ☆37Updated 3 years ago
• efficient / fast-succinct-trie
  ☆27Updated 8 years ago
• yandex / fastops
  This small library enables acceleration of bulk calls of certain math functions on AVX and AVX2 hardware. Currently supported operations …
  ☆87Updated 4 years ago
• seomoz / simhash-cpp
  Simhashing in C++
  ☆135Updated 2 years ago