Trie Packages

compress and decode large dictionaries

https://en.wikipedia.org/wiki/Trie

Dynamic word set with accelerated exact and fuzzy search based on trie data structure.

Immutable, structure sharing collections, including B-trees and S-trees (sequence trees)

Trie file format - use as a trie, save to disk. Tool for manipulating .trieff files.

Yet Another Trie Implementation

Online trie system

Dictionary trie finder with add on functionality with files and manipulations

JS implementation of persistent bit-partitioned vector trie a.k.a vector data structure in Clojure

The derived algorithm from Radix trie with up-and-down relationship.

Cedar trie

Unicode line-breaking algorithm from UAX #14

Quick fork of unicode-trie for modernity

Simple pathname router that makes zero assumptions about the server

Search hotwords by building a trie-like structure.

Tiny search module based on trie and aho-corasick using TypeScript

A Command Line Interface made with Node which can interact with a Trie hosted globally live on a Google Cloud server

Create and modify trie prefix structures, extract word lists including anagrams and sub-anagrams

Create and modify trie prefix structures, extract word lists including anagrams and sub-anagrams

Create and modify trie prefix structures, extract word lists including anagrams and sub-anagrams