s-yata / marisa-trieView external linksLinks
MARISA: Matching Algorithm with Recursively Implemented StorAge
☆594Updated this week
Alternatives and similar repositories for marisa-trie
Users that are interested in marisa-trie are comparing it to the libraries listed below
Sorting:
- Static memory-efficient Trie-like structures for Python based on marisa-trie C++ library.☆1,123Dec 12, 2025Updated 2 months ago
- A clone of Darts (Double-ARray Trie System)☆160May 14, 2025Updated 9 months ago
- Fast compressed trie dictionary library☆71Sep 20, 2024Updated last year
- C++ implementation of a fast and memory efficient HAT-trie☆860Nov 11, 2025Updated 3 months ago
- String map implementation through Fast Succinct Trie☆21Jul 9, 2021Updated 4 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Aug 7, 2018Updated 7 years ago
- LOUDS-trie implementation example (C++)☆14Nov 27, 2019Updated 6 years ago
- DAFSA-based dictionary-like read-only objects for Python. Based on `dawgdic` C++ library.☆305Jun 11, 2024Updated last year
- A C++ library providing fast language model queries in compressed space.☆132Feb 25, 2023Updated 2 years ago
- HAT-Trie for Python☆87Feb 8, 2016Updated 10 years ago
- Yada is a yet another double-array trie library aiming for fast search and compact data representation.☆44Feb 25, 2024Updated last year
- C++17 implementation of memory-efficient dynamic tries☆58Feb 15, 2022Updated 4 years ago
- ☆54Nov 23, 2024Updated last year
- Succinct Data Structure Library 2.0☆2,294Jun 2, 2023Updated 2 years ago
- Count-Min sketch-based approximate counting library☆47May 13, 2025Updated 9 months ago
- Succinct Data Structure Library 3.0☆102Dec 15, 2025Updated 2 months ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆36Jan 8, 2023Updated 3 years ago
- 🦞 Rust library of natural language dictionaries using character-wise double-array tries.☆36Jan 13, 2025Updated last year
- Automatically exported from code.google.com/p/tx-trie☆29Jun 23, 2015Updated 10 years ago
- Counting the collisions with perl hash tables per function☆12Jun 5, 2019Updated 6 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆66May 29, 2024Updated last year
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Jan 3, 2024Updated 2 years ago
- Bloom-filter based minimal perfect hash function library☆274Jul 16, 2025Updated 7 months ago
- A simple C library for compressing lists of integers using binary packing☆515Aug 18, 2023Updated 2 years ago
- A C++ library implementing fast language models estimation using the 1-Sort algorithm.☆17May 18, 2023Updated 2 years ago
- ☆12Jun 10, 2021Updated 4 years ago
- Symmetrized word alignment models, based on mgizapp and GIZA++☆14Jun 23, 2014Updated 11 years ago
- Roaring bitmaps in C (and C++), with SIMD (AVX2, AVX-512 and NEON) optimizations: used by Apache Doris, ClickHouse, Alibaba Tair, Redpand…☆1,780Feb 1, 2026Updated 2 weeks ago
- A library of inverted index data structures☆151Dec 15, 2022Updated 3 years ago
- BitMagic Library☆442Aug 26, 2025Updated 5 months ago
- A lightweight suffix-sorting library☆401Mar 25, 2020Updated 5 years ago
- Succinct data structures in C/C++☆93Oct 7, 2024Updated last year
- Dynamic succinct/compressed data structures☆115Dec 17, 2025Updated last month
- FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…☆109Jan 22, 2015Updated 11 years ago
- A data structure and algorithm library built for TerarkDB☆67Apr 6, 2022Updated 3 years ago
- Sux4J is an effort to bring succinct data structures to Java.☆171Jun 22, 2025Updated 7 months ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆36Feb 15, 2025Updated last year
- A multi-language segmenter using high-order CRF.☆17Feb 27, 2020Updated 5 years ago
- C++ Ternary Search Tree implementation with Python bindings☆43Nov 25, 2017Updated 8 years ago