Main Page | Directories | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | File Members

moot::SuffixTrie Class Reference

Top-level class for suffix tries.

#include <mootSuffixTrie.h>

Inheritance diagram for moot::SuffixTrie:

Inheritance graph
[legend]
Collaboration diagram for moot::SuffixTrie:

Collaboration graph
[legend]
List of all members.

Public Types

Public Member Functions

Constructors etc.
Compilation
Lookup
Debug / Dump

Public Attributes

Static Public Attributes


Member Typedef Documentation

typedef mootEnumID moot::SuffixTrie::TagID
 

Typedef for a tag-id

typedef mootEnum<mootTagString> moot::SuffixTrie::TagIDTable
 

Typedef for tag-id lookup table

typedef TrieVector<SuffixTrieDataT> moot::SuffixTrie::TrieType
 

Underlying trie template type


Constructor & Destructor Documentation

moot::SuffixTrie::SuffixTrie size_t  max_length = SuffixTrieDefaultMaxLen,
bool  use_case = true,
size_t  max_count = 10
[inline]
 

Default constructor

moot::SuffixTrie::~SuffixTrie void   )  [inline]
 

Destructor


Member Function Documentation

bool moot::SuffixTrie::_build_assoc const mootLexfreqs lf,
const TagIDTable tagids
 

Low-level compilation utilitiy: assign count data to all trie nodes

bool moot::SuffixTrie::_build_compute_mles const mootLexfreqs lf,
const mootNgrams ng,
const TagIDTable tagids,
TagID  eos_tagid
 

Low-level compilation utilitiy: compute MLE probabilities P(tag|suffix)

bool moot::SuffixTrie::_build_compute_theta const mootLexfreqs lf,
const mootNgrams ng,
const TagIDTable tagids,
TagID  eos_tagid
 

Low-level compilation utilitiy: compute smoothing constants

bool moot::SuffixTrie::_build_insert const mootLexfreqs lf  ) 
 

Low-level compilation utilitiy: enqueue pending suffix arcs

bool moot::SuffixTrie::_build_invert_mles const mootNgrams ng,
const TagIDTable tagids,
TagID  eos_tagid
 

Low-level compilation utilitiy: Bayesian inversion: compute P(suffix|t) = P(t|suffix)*P(suffix)/P(t)

bool moot::SuffixTrie::build const mootLexfreqs lf,
const mootNgrams ng,
const TagIDTable tagids,
TagID  eos_tagid,
bool  verbose = false
 

Construct a suffix trie from a mootLexfreqs object and a mootEnum object for tagids

const_iterator moot::SuffixTrie::const_find_ancestor_nonempty const_iterator  dtr,
size_t *  matchlen = 0
const [inline]
 

Get first real ancestor (or self) with non-empty data, or end() on failure (read-only)

iterator moot::SuffixTrie::find_ancestor_nonempty iterator  dtr,
size_t *  matchlen = 0
[inline]
 

Get first ancestor (or self) with non-empty data, or end() on failure (read/write)

const_iterator moot::SuffixTrie::rfind_longest_nonempty const mootTokString tokstr,
size_t *  matchlen = 0
const [inline]
 

Get reverse-longest match iterator with actual data, read-only

iterator moot::SuffixTrie::rfind_longest_nonempty const mootTokString tokstr,
size_t *  matchlen = 0
[inline]
 

Get reverse-longest match iterator with actual data, read/write

const SuffixTrieDataT& moot::SuffixTrie::sufprobs const mootTokString tokstr,
size_t *  matchlen = 0
const [inline]
 

Get (log-) probability table tagid=>log(P(tokstr|tagid)) based on longest matched suffix

void moot::SuffixTrie::txtdump FILE *  out,
const TagIDTable tagids
const
 


Member Data Documentation

CountT moot::SuffixTrie::maxcount
 

const size_t moot::SuffixTrie::SuffixTrieDefaultMaxLen = 0 [static]
 

ProbT moot::SuffixTrie::theta
 


The documentation for this class was generated from the following file:
Generated on Mon Jun 27 13:05:28 2005 for libmoot by  doxygen 1.3.8-20040913