This library provides a generic trie implementation for small alphabets, the structure of the leaf nodes can be specified by the user.

Apart from the basic operations, a generator is provided for easy iteration over all words stored in the trie and a number of functions for approximate matching are implemented.

Please see ReadTheDocs for the latest documentation.