Bigram probs and bo-wts, and trigram probs are kept in separate tables rather than within the bigram_t and trigram_t structures. More...
#include <ngram_model_arpa.h>
Data Fields | |
lmprob_t | val |
value being kept in this node | |
uint16 | lower |
index of another entry. | |
uint16 | higher |
index of another entry. |
Bigram probs and bo-wts, and trigram probs are kept in separate tables rather than within the bigram_t and trigram_t structures.
These tables hold unique prob and bo-wt values, and can be < 64K long. The following tree structure is used to construct these tables of unique values. Whenever a new value is read from the LM file, the sorted tree structure is searched to see if the value already exists, and inserted if not found.
Definition at line 80 of file ngram_model_arpa.h.
uint16 sorted_entry_s::higher |
index of another entry.
All descendants down this path have their val > this node's val 0 => no son exists (0 is root index)
Definition at line 85 of file ngram_model_arpa.h.
uint16 sorted_entry_s::lower |
index of another entry.
All descendants down this path have their val < this node's val. 0 => no son exists (0 is root index)
Definition at line 82 of file ngram_model_arpa.h.