daac-tools / daachorse
🐎 A fast implementation of the Aho-Corasick algorithm using the compact double-array data structure in Rust.
☆211Updated 2 months ago
Alternatives and similar repositories for daachorse:
Users that are interested in daachorse are comparing it to the libraries listed below
- Yada is a yet another double-array trie library aiming for fast search and compact data representation.☆35Updated last year
- A Japanese tokenizer for Tantivy, based on TinySegmenter.☆14Updated 4 years ago
- 🦞 Rust library of natural language dictionaries using character-wise double-array tries.☆30Updated 2 months ago
- A multilingual morphological analysis library.☆441Updated last week
- 🎤 vibrato: Viterbi-based accelerated tokenizer☆353Updated last week
- Fast match expression optimized for string comparison☆38Updated last year
- Japanese tokenizer for rust☆35Updated 5 years ago
- WIP: Full text search engine library written in Go with 1.18+ Generics, heavily inspired by Tantivy☆15Updated last year
- Fast lexer code generator for Rust☆140Updated 2 weeks ago
- Lindera tokenizer for Tantivy.☆57Updated 3 months ago
- Tool to assist you with cool naming of your methods and software☆125Updated 2 years ago
- Rust binding of primitiv☆20Updated 6 years ago
- a crate to swap values between possibly-overlapping references☆23Updated 2 years ago
- Safe Rust bindings for mecab a part-of-speech and morphological analyzer library☆62Updated last year
- 🛥 Vaporetto: Very accelerated pointwise prediction based tokenizer☆235Updated last week
- Collection of succinct data structures in Rust☆95Updated 3 weeks ago
- Rust library providing fast language model queries in compressed space☆24Updated 2 years ago
- Rust implementation of SIF and uSIF: Simple and fast sentence embedding☆19Updated 2 months ago
- Efficiently-updatable double-array trie in Rust (ported from cedar)☆100Updated 2 years ago
- A Rust macro for writing regex pattern matching.☆49Updated 3 years ago
- Small ONNX inference runtime written in Rust☆96Updated 3 weeks ago
- Double Array Trie in Rust☆52Updated 5 years ago
- 🐎 A fast implementation of the Aho-Corasick algorithm using the compact double-array data structure. (Python wrapper for daachorse)☆16Updated last week
- LightGBM Rust binding☆76Updated last year
- Easy scraping library☆194Updated 4 years ago
- ☆130Updated 8 months ago
- Memory efficient trie (prefix tree) library based on LOUDS☆111Updated last week
- optpy is a transpiler to generate a Rust file from a Python file☆27Updated 2 years ago
- ☆64Updated 4 years ago
- Library for competitive programming in Rust.☆16Updated 3 years ago