#include <mootSuffixTrie.h>
Inheritance diagram for moot::SuffixTrie:
|
Typedef for a tag-id |
|
Typedef for tag-id lookup table |
|
Underlying trie template type |
|
Default constructor |
|
Destructor |
|
Low-level compilation utilitiy: assign count data to all trie nodes |
|
Low-level compilation utilitiy: compute MLE probabilities P(tag|suffix) |
|
Low-level compilation utilitiy: compute smoothing constants |
|
Low-level compilation utilitiy: enqueue pending suffix arcs |
|
Low-level compilation utilitiy: Bayesian inversion: compute P(suffix|t) = P(t|suffix)*P(suffix)/P(t) |
|
Construct a suffix trie from a mootLexfreqs object and a mootEnum object for tagids |
|
Get first real ancestor (or self) with non-empty data, or end() on failure (read-only) |
|
Get first ancestor (or self) with non-empty data, or end() on failure (read/write) |
|
Get reverse-longest match iterator with actual data, read-only |
|
Get reverse-longest match iterator with actual data, read/write |
|
Get (log-) probability table tagid=>log(P(tokstr|tagid)) based on longest matched suffix |
|
|
|
|
|
|
|
|