jermp / tongramsLinks
A C++ library providing fast language model queries in compressed space.
☆132Updated 2 years ago
Alternatives and similar repositories for tongrams
Users that are interested in tongrams are comparing it to the libraries listed below
Sorting:
- A library of inverted index data structures☆150Updated 2 years ago
- A C++ library implementing fast language models estimation using the 1-Sort algorithm.☆17Updated 2 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago
- Suite of universal indexes for Highly Repetitive Document Collections☆20Updated 5 years ago
- SUccinct Retrieval Framework☆21Updated 9 years ago
- Fast implementations of the scancount algorithm: C++ header-only library☆27Updated 6 years ago
- Universe-sliced indexes in C++.☆18Updated 2 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Updated last year
- Succinct data structures in C/C++☆88Updated last year
- Fast compressed trie dictionary library☆70Updated last year
- Python bindings for the fast integer compression library FastPFor.☆61Updated last year
- Efficient and effective query auto-completion in C++.☆55Updated 2 years ago
- ☆36Updated 4 years ago
- A collection of succinct data structures☆209Updated last year
- Trinity IR Infrastructure☆238Updated 5 years ago
- Parameterless and Universal FInding of Nearest Neighbors☆59Updated 6 months ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago
- Weighted MinHash implementation on CUDA (multi-gpu).☆119Updated last year
- Succinct Data Structure Library☆107Updated 12 years ago
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆11Updated 3 years ago
- ☆50Updated 5 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- Partial Java port of the C++ OpenFST library☆37Updated 3 years ago
- An Efficient Language Model Using Double-Array Structures☆17Updated 5 years ago
- LSH index for approximate set containment search☆59Updated 3 years ago
- Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"☆40Updated 10 years ago
- Feed-forward Bloom filters☆53Updated 14 years ago
- Example project presented at the Succinct Data Structure Tutorial at SIGIR 2016☆26Updated 6 years ago
- C++11 library for fast fuzzy searching☆14Updated 10 years ago
- SymSpell C++ Ports☆31Updated 6 years ago