jermp / tongrams

Related projects ⓘ

Alternatives and complementary repositories for tongrams

• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆25Updated 5 years ago
• ot / ds2i
  A library of inverted index data structures
  ☆145Updated last year
• searchivarius / PyFastPFor
  Python bindings for the fast integer compression library FastPFor.
  ☆57Updated last year
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated last year
• kampersanda / xcdat
  Fast compressed trie dictionary library
  ☆64Updated last month
• fabiocannizzo / FastBinarySearch
  Fast and vectorizable algorithms for searching in a vector of sorted floating point numbers
  ☆119Updated last year
• puffinn / puffinn
  Parameterless and Universal FInding of Nearest Neighbors
  ☆56Updated 6 months ago
• jermp / autocomplete
  Efficient and effective query auto-completion in C++.
  ☆51Updated last year
• mjansche / opengrm-ngram
  Read-only unofficial mirror of the OpenGrm NGram Library
  ☆8Updated 5 years ago
• jermp / s_indexes
  Universe-sliced indexes in C++.
  ☆17Updated last year
• yandex / fastops
  This small library enables acceleration of bulk calls of certain math functions on AVX and AVX2 hardware. Currently supported operations …
  ☆88Updated 2 years ago
• fwessels / simdcsv
  ☆35Updated 4 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆52Updated 10 months ago
• kpu / preprocess
  Corpus preprocessing
  ☆95Updated 7 months ago
• ot / partitioned_elias_fano
  Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"
  ☆37Updated 9 years ago
• vigna / sux
  Succinct data structures in C/C++
  ☆82Updated last month
• gvinciguerra / BlockEpsilonTree
  🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.
  ☆11Updated 2 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆55Updated last year
• jermp / tongrams_estimation
  A C++ library implementing fast language models estimation using the 1-Sort algorithm.
  ☆17Updated last year
• benob / openfst-utils
  Utilities for manipulating finite state transducers with the OpenFst library.
  ☆30Updated 7 years ago
• migumar2 / uiHRDC
  Suite of universal indexes for Highly Repetitive Document Collections
  ☆20Updated 4 years ago
• osirrc / ciff
  Common Index File Format to to support interoperability between open-source IR engines
  ☆31Updated last month
• vteromero / VTEnc
  VTEnc C library
  ☆36Updated last year
• kampersanda / poplar-trie
  C++17 implementation of memory-efficient dynamic tries
  ☆57Updated 2 years ago
• efficient / fast-succinct-trie
  ☆25Updated 7 years ago
• migumar2 / libCSD
  C++ Library implementing Compressed String Dictionaries
  ☆45Updated 2 years ago
• WojciechMula / simd-search
  Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)
  ☆51Updated 7 years ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆43Updated 2 months ago
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆28Updated last year