DAWG String Dictionary in C#

A Trie implementation in Go meant for auto-completion use cases. Supports Levenshtein distance search.

Succinct Data Structure of Trie, written in Go

Restful Autocomplete service with Neo4j graph backend. Returns top suggestions.

Auto Complete / Suggestion feature using Trie data structure

Trie data structure implementation in Golang 🌳

autocomplete function used search engines, spell-checking, text-messengers, etc. Includes a bloom filter that provides memory efficient check of whether an item has been inserted before through the use of hashing algorithms (FNV1AHash, CRCHash, and SBDMHash).

low-level, primitive autocomplete using trie data structure

A simple implementation of a Trie data structure to auto-complete words.

Implementation of word autocomplete using trie

Trie Data Structure Implementation for Autocomplete, Dictionary Search

An implementation of a trie-like data structure using Azure Table Storage to enable type-ahead style searching

This Gradle based project written in Java demonstrate implementation of autocomplete suggestions feature (library) similar to as given by Google

Auto Complete / Suggestion feature using Trie data structure

Projects and Essays from Algorithm Implementation (CS 1501) at University of Pittsburgh

An example program of how to implement a Trie class.

Generating auto-correction suggestions using keyboard user-input by traversing the suffix trie based on the user input data so far and offering the most-likely string outcome based on a simplistic counter mechanism to track the user’s most used paths taken based on that scenario (similarly to a fusion tree)

Implementation of Code Auto-Completion and Spell-Checking using Tries and Ternary Tries.

Implementation of a simple trie data structure, capable of storing strings of lowercase characters.

Auto-Suggest and Auto-Complete feature build using Trie Data Structure