A fast, accurate and multilingual fuzzy search library for the frontend.

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

🏃 🏃 🏃Somewhat fast, somewhat optimal Prefix Search in Go

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.

Typo-tolerant, in-memory autocomplete for .NET

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.

Modular full-text search engine in Go with pluggable indexes, filters, and customizable text processing pipelines. You can instantly index your docs (radix, HAMT), apply probabilistic filters, and experimenting with search performance via interactive CUI.

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

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.

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

This is a high-performance implementation of a Prefix Trie to perform efficient fuzzy string matches.

a fast and light-weighted key-value store library

Fast offline CLI tool for instant English word-prefix search. Optimized with binary-search indexing, configurable UI, and perfect for word games like Last Letter, puzzles, or linguistic tooling.