/**
* dawg_permute_and_select
*
* Recursively explore all the possible character combinations in
* the given char_choices. Use go_deeper_dawg_fxn() to search all the
* dawgs in the dawgs_ vector in parallel and discard invalid words.
*
* Allocate and return a WERD_CHOICE with the best valid word found.
*/
WERD_CHOICE *Dict::dawg_permute_and_select(
const BLOB_CHOICE_LIST_VECTOR &char_choices, float rating_limit) {
WERD_CHOICE *best_choice = new WERD_CHOICE();
best_choice->make_bad();
best_choice->set_rating(rating_limit);
if (char_choices.length() == 0) return best_choice;
DawgInfoVector *active_dawgs = new DawgInfoVector[char_choices.length() + 1];
DawgInfoVector *constraints = new DawgInfoVector[char_choices.length() + 1];
init_active_dawgs(&(active_dawgs[0]));
init_constraints(&(constraints[0]));
DawgArgs dawg_args(&(active_dawgs[0]), &(constraints[0]),
&(active_dawgs[1]), &(constraints[1]),
(segment_penalty_dict_case_bad /
segment_penalty_dict_case_ok));
WERD_CHOICE word(MAX_WERD_LENGTH);
copy_hyphen_info(&word);
// Discard rating and certainty of the hyphen base (if any).
word.set_rating(0.0);
word.set_certainty(0.0);
if (word.length() + char_choices.length() > MAX_WERD_LENGTH) {
delete[] active_dawgs;
delete[] constraints;
return best_choice; // the word is too long to permute
}
float certainties[MAX_WERD_LENGTH];
this->go_deeper_fxn_ = &tesseract::Dict::go_deeper_dawg_fxn;
permute_choices(segment_dawg_debug ? "segment_dawg_debug" : NULL,
char_choices, 0, NULL, &word, certainties,
&rating_limit, best_choice, &dawg_args);
delete[] active_dawgs;
delete[] constraints;
return best_choice;
}
/**
* dawg_permute_and_select
*
* Recursively explore all the possible character combinations in
* the given char_choices. Use go_deeper_dawg_fxn() to search all the
* dawgs in the dawgs_ vector in parallel and discard invalid words.
*
* Allocate and return a WERD_CHOICE with the best valid word found.
*/
WERD_CHOICE *Dict::dawg_permute_and_select(
const BLOB_CHOICE_LIST_VECTOR &char_choices, float rating_limit) {
WERD_CHOICE *best_choice = new WERD_CHOICE(&getUnicharset());
best_choice->make_bad();
best_choice->set_rating(rating_limit);
if (char_choices.length() == 0 || char_choices.length() > MAX_WERD_LENGTH)
return best_choice;
DawgPositionVector *active_dawgs =
new DawgPositionVector[char_choices.length() + 1];
init_active_dawgs(&(active_dawgs[0]), true);
DawgArgs dawg_args(&(active_dawgs[0]), &(active_dawgs[1]), NO_PERM);
WERD_CHOICE word(&getUnicharset(), MAX_WERD_LENGTH);
float certainties[MAX_WERD_LENGTH];
this->go_deeper_fxn_ = &tesseract::Dict::go_deeper_dawg_fxn;
int attempts_left = max_permuter_attempts;
permute_choices((dawg_debug_level) ? "permute_dawg_debug" : nullptr,
char_choices, 0, nullptr, &word, certainties, &rating_limit, best_choice,
&attempts_left, &dawg_args);
delete[] active_dawgs;
return best_choice;
}