25 tprintf(
"%s ViterbiStateEntry", msg);
38 tprintf(
" inconsistent=(punc %d case %d chartype %d script %d font %d)",
40 this->consistency_info.NumInconsistentCase(),
41 this->consistency_info.NumInconsistentChartype(),
42 this->consistency_info.inconsistent_script, this->consistency_info.inconsistent_font);
48 tprintf(
" ngram_cl_cost=%g context=%s ngram pruned=%d",
50 this->ngram_info->pruned);
69 tprintf(
"%s VSEs (max_cost=%g prn_len=%d tot_len=%d):\n", msg,
73 for (vit.mark_cycle_pt(); !vit.cycled_list(); vit.forward()) {
74 vit.data()->Print(
"");
void tprintf(const char *format,...)
int NumInconsistentPunc() const
XHeightConsistencyEnum xht_decision
float ngram_and_classifier_cost
-[ ln(P_classifier(path)) + scale_factor * ln(P_ngram_model(path)) ]
LanguageModelDawgInfo * dawg_info
AssociateStats associate_stats
character widths/gaps/seams
int length
number of characters on the path
void Print(const char *msg) const
LanguageModelNgramInfo * ngram_info
LanguageModelFlagsType top_choice_flags
float ratings_sum
sum of ratings of character on the path
bool updated
set to true if the entry has just been created/updated
LMConsistencyInfo consistency_info
path consistency info
float viterbi_state_entries_prunable_max_cost
void Print(const char *msg)
int viterbi_state_entries_length
Total number of entries in viterbi_state_entries.
int viterbi_state_entries_prunable_length
Number and max cost of prunable paths in viterbi_state_entries.
ViterbiStateEntry_LIST viterbi_state_entries
Storage for the Viterbi state.
void Clear()
Clears the viterbi search state back to its initial conditions.