Alternatives and similar repositories for tongrams

Users that are interested in tongrams 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 2 years ago
• ot / ds2i
  A library of inverted index data structures
  ☆150Updated 2 years ago
• simongog / surf
  SUccinct Retrieval Framework
  ☆20Updated 9 years ago
• gvinciguerra / BlockEpsilonTree
  🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.
  ☆11Updated 3 years ago
• jermp / s_indexes
  Universe-sliced indexes in C++.
  ☆18Updated 2 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆54Updated last year
• kampersanda / xcdat
  Fast compressed trie dictionary library
  ☆70Updated 10 months ago
• puffinn / puffinn
  Parameterless and Universal FInding of Nearest Neighbors
  ☆60Updated 4 months ago
• jermp / autocomplete
  Efficient and effective query auto-completion in C++.
  ☆55Updated last year
• mjansche / opengrm-ngram
  Read-only unofficial mirror of the OpenGrm NGram Library
  ☆8Updated 6 years ago
• fast-pack / PyFastPFor
  Python bindings for the fast integer compression library FastPFor.
  ☆60Updated last year
• ot / succinct
  A collection of succinct data structures
  ☆206Updated last year
• benob / openfst-utils
  Utilities for manipulating finite state transducers with the OpenFst library.
  ☆31Updated 7 years ago
• migumar2 / uiHRDC
  Suite of universal indexes for Highly Repetitive Document Collections
  ☆20Updated 5 years ago
• 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 5 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• vigna / sux
  Succinct data structures in C/C++
  ☆89Updated 9 months ago
• fwessels / simdcsv
  ☆36Updated 4 years ago
• efficient / fast-succinct-trie
  ☆26Updated 8 years ago
• phaistos-networks / Trinity
  Trinity IR Infrastructure
  ☆238Updated 5 years ago
• steveash / jopenfst
  Partial Java port of the C++ OpenFST library
  ☆37Updated 3 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.
  ☆249Updated this week
• migumar2 / libCSD
  C++ Library implementing Compressed String Dictionaries
  ☆46Updated 3 years ago
• yhirose / cpp-fstlib
  A single file C++17 header-only Minimal Acyclic Subsequential Transducers, or Finite State Transducers
  ☆57Updated 2 years ago
• simongog / sdsl
  Succinct Data Structure Library
  ☆106Updated 11 years ago
• ekzhu / lshensemble
  LSH index for approximate set containment search
  ☆58Updated 3 years ago
• AtheS21 / SymspellCPP
  ☆31Updated 2 years ago
• xhochy / libfuzzymatch
  C++11 library for fast fuzzy searching
  ☆14Updated 10 years ago