jermp / tongramsLinks
A C++ library providing fast language model queries in compressed space.
☆129Updated 2 years ago
Alternatives and similar repositories for tongrams
Users that are interested in tongrams are comparing it to the libraries listed below
Sorting:
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- ☆36Updated 4 years ago
- Parameterless and Universal FInding of Nearest Neighbors☆60Updated 2 months ago
- A library of inverted index data structures☆148Updated 2 years ago
- Succinct data structures in C/C++☆88Updated 7 months ago
- Fast implementations of the scancount algorithm: C++ header-only library☆26Updated 5 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆56Updated 2 years ago
- Fast compressed trie dictionary library☆69Updated 8 months ago
- VTEnc C library☆37Updated 2 years ago
- This small library enables acceleration of bulk calls of certain math functions on AVX and AVX2 hardware. Currently supported operations …☆88Updated 3 years ago
- Universe-sliced indexes in C++.☆18Updated 2 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- Suite of universal indexes for Highly Repetitive Document Collections☆20Updated 5 years ago
- Read-only unofficial mirror of the OpenGrm NGram Library☆8Updated 6 years ago
- A C++ library implementing fast language models estimation using the 1-Sort algorithm.☆17Updated 2 years ago
- C++17 implementation of memory-efficient dynamic tries☆58Updated 3 years ago
- Example project presented at the Succinct Data Structure Tutorial at SIGIR 2016☆25Updated 6 years ago
- A single file C++17 header-only Minimal Acyclic Subsequential Transducers, or Finite State Transducers☆56Updated 2 years ago
- Python bindings for the fast integer compression library FastPFor.☆58Updated last year
- Utilities for manipulating finite state transducers with the OpenFst library.☆31Updated 7 years ago
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆11Updated 2 years ago
- Efficient and effective query auto-completion in C++.☆54Updated last year
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆29Updated 2 years ago
- ☆26Updated 8 years ago
- SymSpell C++ Ports☆31Updated 6 years ago
- Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…☆50Updated last year
- A C++ template library for compact Hamming distance indexes☆10Updated 8 years ago
- A collection of succinct data structures☆202Updated last year
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆63Updated last year
- Pruning elements in SIMD vectors (i.e., packing left elements)☆65Updated last year