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.

Sorted Data Structure Server - Treds is a Data Structure Server which returns data in sorted order and is the fastest prefix search server. It also persists data on disk.

a fast and light-weighted key-value store library

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.

🏃 🏃 🏃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.

Radix is an adaptive radix tree for in-memory database indexes.

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++.

Python bindings for NodeTrie, a prefix tree data structure library

Simple Prefix Binary Tree-based string search engine written in Rust.

a fast and light-weighted key-value store library

PHP/MySQL Script that returns Nigerian mobile network name based on the prefix of the mobile phone number.

Algorithm to find the longest matching prefix for a binary string using a binary trie

Implementation of Data Structures and Algorithms

This project implements a 26-way Trie data structure to manipulate and manage strings efficiently.Then inserts all words to the trie from the given txt file.

A fast, dependency-free, self-compressing trie with radix 256 in pure python