Stores the first layer, i.e., the entry points in the trie
Stores the first layer, i.e., the entry points in the trie
Returns the length of the matched span, which may be 0.
Returns the length of the matched span, which may be 0. When multiple paths are found, the longest one is kept Text must be normalized (i.e., case folding) BEFORE this call, if necessary!
A more efficient trie implementation, where the first layer is stored as a hash map for efficiency (the rest are the usual trees) The find* methods are thread safe User: mihais Date: 5/12/15