Dict-parser: Elm package to create a fast parser to match dictionary keys

The time complexity of + + is of O(n * l), where l is the length of the word being matched and n is the total number of words. The time complexity of using a Trie and matching the possible characters sequentially at each level is of O(n + l). The time complexity is of this package’s implementation is of O(l * log2(n / l)).

Source: github.com