Trie

A pure Python implementation of the trie data structure.

treg utilizes trie structured regex patterns to search texts for a potientially large number of words and phrases.

Fast and flexible search in a dictionary using Levenshtein distance

A simlpe Merkle Patricia Trie implementation

Autocomplete with a trie structure

corpus-level trie to store corpus efficiently and speed up sentence search

Transform trie to regular expression

Split German text to sentence! Uses TRIE-Regex to filter ordinal numbers (23.04., 2.5. ...), roman numbers, (II., XI. ...) 15,000 abbreviations (z.B., Abk. ...) , about 7,500 second-level domains (.com.br, ac.at ...), 1500 file name extensions (hallo.docx, tabelle.xlsx ...)

elzzur solves a Ruzzle board, listing all the valid words with their scores.

An unofficial project that provides Python bindings for the MARISA Trie, which is implemented in C++ using SWIG.

CIDR-Bottle is yet another Patricia Trie implementation, however this one is specifically designed for parsing and validating CIDRS in routing tables and ROAs.

Trie for slingshot takehome.

Collection of various string algorithms, including KMP, Aho-Corasick, Trie, SuffixArrays