Coordinate Hash Trie: A Trie Variant Balancing between Time, Space, and Simplicity

Generic prefix tree for golang

Missing Trie implementation for Go

A hash array mapped trie implementation in c.

Trie base class and derived classes (TStringHashTrie, TIntegerHashTrie). A high performance and low memory footprint Dictionary set of classes

Efficient, immutable and stack safe implementation of a Trie data structure in dart: autocomplete, text search, spell checking, strings and prefixes

A small data structures library for JavaScript

A desktop scrabble app featuring an AI player which always plays the highest possible scoring word each turn.

low-level, primitive autocomplete using trie data structure

A Mini Search Engine in C++, using an inverted index and a trie.

extensible, high-performance configuration management library, optimized for hierarchical data

A Trie and DAFSA visualizer

A real-time suggestion service, which enable users to search for known and frequently searched terms.

Efficient typo-tolerant search in 76 lines of code, with no dependencies.

autocomplete text app with cpp GUI QT

Coursera course: Algorithms on Strings

Given replace map, we can replace all the correspond words in input file without wrong twice replace.

Implementation of the Autosuggest feature using Trie Data structure

Fast Succinct Trie for Go. Support Marshalling

DataBase Management Project based on Näive & Advanced Searching Techniques