There are 1 repository under prefix-search topic.
Connectionist Temporal Classification (CTC) decoding algorithms: best path, beam search, lexicon search, prefix search, and token passing. Implemented in Python.
PruningRadixTrie - 1000x faster Radix trie for prefix search & auto-complete
An efficient implementation of RNN-T Prefix Beam Search in C++/CUDA.
PyPruningRadixTrie - Python version of super fast Radix trie for prefix search & auto-complete
This example project demonstrates a clean way to architect an Android application.
:running: :running: :running:Somewhat fast, somewhat optimal Prefix Search in Go
An implementation of RadixTree data-structure, which is a great tool for indexing a large number of records with string keys.
LexiSearch is an API for retrieving information in given datasets.
Python bindings for NodeTrie, a prefix tree data structure library
Simple Prefix Binary Tree-based string search engine written in Rust.
Build an efficient and customized dictionary using modified TRIE data structure having substring search, sorting and autocomplete features from a file of words in C++.
A fast, dependency-free, self-compressing trie with radix 256 in pure python
Algorithm to find the longest matching prefix for a binary string using a binary trie
An implementation of ternary tree for auto-completion