class LMInteriorLevelWordList

Public Methods

LMInteriorLevelWordEntry* findWord( int word )

Internal function

Public Members

Creates the list.

levels in the tree-like n-gram data structures.

Adds a language model probability.

Adds a language model backoff weight.

of the entry that is being added, and 'words' contains the

vocabulary indices of the words in the n-gram.

of 'words' should be eg.

Calculates a language model probability for a particular word

sequence with backoff.

in the word sequence, and 'words' contains the vocabulary

indices of the words.

eg.

"most-recent" word.

indicating that the value of prob contains only an

accumulated backoff weight.

Documentation

Creates the list.

Creates the list. Instances of this object are used at different

levels in the tree-like n-gram data structures.

levels in the tree-like n-gram data structures.

Adds a language model probability.

Adds a language model probability. 'order' denotes the order

Adds a language model backoff weight.

Adds a language model backoff weight. 'order' denotes the order

of the entry that is being added, and 'words' contains the

of the entry that is being added, and 'words' contains theof the entry that is being added, and 'words' contains the

vocabulary indices of the words in the n-gram.

vocabulary indices of the words in the n-gram. The orderingvocabulary indices of the words in the n-gram. The ordering

of 'words' should be eg.

of 'words' should be eg. W4,W3,W2,W1 when 'order' is 4 andof 'words' should be eg. W3,W2,W1,W4 when 'order' is 4 and

Calculates a language model probability for a particular word

Calculates a language model probability for a particular word

sequence with backoff.

sequence with backoff. 'order' denotes the number of words

in the word sequence, and 'words' contains the vocabulary

in the word sequence, and 'words' contains the vocabulary

indices of the words.

indices of the words. The ordering of 'words' should be

eg.

eg. W3,W2,W1,W4 when 'order' is 4 and where W4 is the

"most-recent" word.

"most-recent" word. Returns false if no entry was found,

indicating that the value of prob contains only an

indicating that the value of prob contains only an

accumulated backoff weight.

accumulated backoff weight. Returns true if a valid

LMInteriorLevelWordEntry* findWord( int word )

Internal function

This class has no child classes.

Alphabetic index HTML hierarchy of classes or Java