Tesseract  3.02
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
tesseract::Dawg Class Referenceabstract

#include <dawg.h>

Inheritance diagram for tesseract::Dawg:
tesseract::SquishedDawg tesseract::Trie

Public Member Functions

DawgType type () const
 
const STRINGlang () const
 
PermuterType permuter () const
 
virtual ~Dawg ()
 
bool word_in_dawg (const WERD_CHOICE &word) const
 Returns true if the given word is in the Dawg. More...
 
int check_for_words (const char *filename, const UNICHARSET &unicharset, bool enable_wildcard) const
 
void iterate_words (const UNICHARSET &unicharset, TessCallback1< const char * > *cb) const
 
virtual EDGE_REF edge_char_of (NODE_REF node, UNICHAR_ID unichar_id, bool word_end) const =0
 Returns the edge that corresponds to the letter out of this node. More...
 
virtual void unichar_ids_of (NODE_REF node, NodeChildVector *vec) const =0
 
virtual NODE_REF next_node (EDGE_REF edge_ref) const =0
 
virtual bool end_of_word (EDGE_REF edge_ref) const =0
 
virtual UNICHAR_ID edge_letter (EDGE_REF edge_ref) const =0
 Returns UNICHAR_ID stored in the edge indicated by the given EDGE_REF. More...
 
virtual void print_node (NODE_REF node, int max_num_edges) const =0
 
virtual void unichar_id_to_patterns (UNICHAR_ID unichar_id, const UNICHARSET &unicharset, GenericVector< UNICHAR_ID > *vec) const
 
virtual EDGE_REF pattern_loop_edge (EDGE_REF edge_ref, UNICHAR_ID unichar_id, bool word_end) const
 

Static Public Attributes

static const inT16 kDawgMagicNumber = 42
 Magic number to determine endianness when reading the Dawg from file. More...
 
static const UNICHAR_ID kPatternUnicharID = 0
 

Protected Member Functions

 Dawg ()
 
NODE_REF next_node_from_edge_rec (const EDGE_RECORD &edge_rec) const
 Returns the next node visited by following this edge. More...
 
bool marker_flag_from_edge_rec (const EDGE_RECORD &edge_rec) const
 Returns the marker flag of this edge. More...
 
int direction_from_edge_rec (const EDGE_RECORD &edge_rec) const
 Returns the direction flag of this edge. More...
 
bool end_of_word_from_edge_rec (const EDGE_RECORD &edge_rec) const
 Returns true if this edge marks the end of a word. More...
 
UNICHAR_ID unichar_id_from_edge_rec (const EDGE_RECORD &edge_rec) const
 Returns UNICHAR_ID recorded in this edge. More...
 
void set_next_node_in_edge_rec (EDGE_RECORD *edge_rec, EDGE_REF value)
 Sets the next node link for this edge in the Dawg. More...
 
void set_marker_flag_in_edge_rec (EDGE_RECORD *edge_rec)
 Sets this edge record to be the last one in a sequence of edges. More...
 
int given_greater_than_edge_rec (NODE_REF next_node, bool word_end, UNICHAR_ID unichar_id, const EDGE_RECORD &edge_rec) const
 
bool edge_rec_match (NODE_REF next_node, bool word_end, UNICHAR_ID unichar_id, NODE_REF other_next_node, bool other_word_end, UNICHAR_ID other_unichar_id) const
 
void init (DawgType type, const STRING &lang, PermuterType perm, int unicharset_size, int debug_level)
 
bool match_words (WERD_CHOICE *word, inT32 index, NODE_REF node, UNICHAR_ID wildcard) const
 
void iterate_words_rec (const WERD_CHOICE &word_so_far, NODE_REF to_explore, TessCallback1< const char * > *cb) const
 

Protected Attributes

DawgType type_
 
STRING lang_
 
PermuterType perm_
 Permuter code that should be used if the word is found in this Dawg. More...
 
int unicharset_size_
 
int flag_start_bit_
 
int next_node_start_bit_
 
uinT64 next_node_mask_
 
uinT64 flags_mask_
 
uinT64 letter_mask_
 
int debug_level_
 

Detailed Description

Abstract class (an interface) that declares methods needed by the various tesseract classes to operate on SquishedDawg and Trie objects.

This class initializes all the edge masks (since their usage by SquishedDawg and Trie is identical) and implements simple accessors for each of the fields encoded in an EDGE_RECORD. This class also implements word_in_dawg() and check_for_words() (since they use only the public methods of SquishedDawg and Trie classes that are inherited from the Dawg base class).

Definition at line 122 of file dawg.h.

Constructor & Destructor Documentation

virtual tesseract::Dawg::~Dawg ( )
inlinevirtual

Definition at line 135 of file dawg.h.

135 {};
tesseract::Dawg::Dawg ( )
inlineprotected

Definition at line 191 of file dawg.h.

191 {}

Member Function Documentation

int tesseract::Dawg::check_for_words ( const char *  filename,
const UNICHARSET unicharset,
bool  enable_wildcard 
) const

Checks the Dawg for the words that are listed in the requested file. Returns the number of words in the given file missing from the Dawg.

Definition at line 69 of file dawg.cpp.

71  {
72  if (filename == NULL) return 0;
73 
74  FILE *word_file;
75  char string [CHARS_PER_LINE];
76  int misses = 0;
77  UNICHAR_ID wildcard = unicharset.unichar_to_id(kWildcard);
78 
79  word_file = open_file (filename, "r");
80 
81  while (fgets (string, CHARS_PER_LINE, word_file) != NULL) {
82  chomp_string(string); // remove newline
83  WERD_CHOICE word(string, unicharset);
84  if (word.length() > 0 &&
85  !word.contains_unichar_id(INVALID_UNICHAR_ID)) {
86  if (!match_words(&word, 0, 0,
87  enable_wildcard ? wildcard : INVALID_UNICHAR_ID)) {
88  tprintf("Missing word: %s\n", string);
89  ++misses;
90  }
91  } else {
92  tprintf("Failed to create a valid word from %s\n", string);
93  }
94  }
95  fclose (word_file);
96  // Make sure the user sees this with fprintf instead of tprintf.
97  if (debug_level_) tprintf("Number of lost words=%d\n", misses);
98  return misses;
99 }
int UNICHAR_ID
Definition: unichar.h:31
const UNICHAR_ID unichar_to_id(const char *const unichar_repr) const
Definition: unicharset.cpp:176
FILE * open_file(const char *filename, const char *mode)
Definition: cutil.cpp:82
#define NULL
Definition: host.h:144
#define CHARS_PER_LINE
Definition: cutil.h:57
bool match_words(WERD_CHOICE *word, inT32 index, NODE_REF node, UNICHAR_ID wildcard) const
Definition: dawg.cpp:127
void chomp_string(char *str)
Definition: helpers.h:32
int debug_level_
Definition: dawg.h:298
DLLSYM void tprintf(const char *format,...)
Definition: tprintf.cpp:41
int tesseract::Dawg::direction_from_edge_rec ( const EDGE_RECORD edge_rec) const
inlineprotected

Returns the direction flag of this edge.

Definition at line 202 of file dawg.h.

202  {
203  return ((edge_rec & (DIRECTION_FLAG << flag_start_bit_))) ?
205  }
#define BACKWARD_EDGE
Definition: dawg.h:85
int flag_start_bit_
Definition: dawg.h:292
#define DIRECTION_FLAG
Definition: dawg.h:88
#define FORWARD_EDGE
Definition: dawg.h:84
virtual EDGE_REF tesseract::Dawg::edge_char_of ( NODE_REF  node,
UNICHAR_ID  unichar_id,
bool  word_end 
) const
pure virtual

Returns the edge that corresponds to the letter out of this node.

Implemented in tesseract::SquishedDawg, and tesseract::Trie.

virtual UNICHAR_ID tesseract::Dawg::edge_letter ( EDGE_REF  edge_ref) const
pure virtual

Returns UNICHAR_ID stored in the edge indicated by the given EDGE_REF.

Implemented in tesseract::SquishedDawg, and tesseract::Trie.

bool tesseract::Dawg::edge_rec_match ( NODE_REF  next_node,
bool  word_end,
UNICHAR_ID  unichar_id,
NODE_REF  other_next_node,
bool  other_word_end,
UNICHAR_ID  other_unichar_id 
) const
inlineprotected

Returns true if all the values are equal (any value matches next_node if next_node == NO_EDGE, any value matches word_end if word_end is false).

Definition at line 253 of file dawg.h.

258  {
259  return ((unichar_id == other_unichar_id) &&
260  (next_node == NO_EDGE || next_node == other_next_node) &&
261  (!word_end || (word_end == other_word_end)));
262  }
virtual NODE_REF next_node(EDGE_REF edge_ref) const =0
virtual bool tesseract::Dawg::end_of_word ( EDGE_REF  edge_ref) const
pure virtual

Returns true if the edge indicated by the given EDGE_REF marks the end of a word.

Implemented in tesseract::SquishedDawg, and tesseract::Trie.

bool tesseract::Dawg::end_of_word_from_edge_rec ( const EDGE_RECORD edge_rec) const
inlineprotected

Returns true if this edge marks the end of a word.

Definition at line 207 of file dawg.h.

207  {
208  return (edge_rec & (WERD_END_FLAG << flag_start_bit_)) != 0;
209  }
#define WERD_END_FLAG
Definition: dawg.h:89
int flag_start_bit_
Definition: dawg.h:292
int tesseract::Dawg::given_greater_than_edge_rec ( NODE_REF  next_node,
bool  word_end,
UNICHAR_ID  unichar_id,
const EDGE_RECORD edge_rec 
) const
inlineprotected

Sequentially compares the given values of unichar ID, next node and word end marker with the values in the given EDGE_RECORD. Returns: 1 if at any step the given input value exceeds that of edge_rec (and all the values already checked are the same) 0 if edge_rec_match() returns true -1 otherwise

Definition at line 232 of file dawg.h.

235  {
236  UNICHAR_ID curr_unichar_id = unichar_id_from_edge_rec(edge_rec);
237  NODE_REF curr_next_node = next_node_from_edge_rec(edge_rec);
238  bool curr_word_end = end_of_word_from_edge_rec(edge_rec);
239  if (edge_rec_match(next_node, word_end, unichar_id, curr_next_node,
240  curr_word_end, curr_unichar_id)) return 0;
241  if (unichar_id > curr_unichar_id) return 1;
242  if (unichar_id == curr_unichar_id) {
243  if (next_node > curr_next_node) return 1;
244  if (next_node == curr_next_node) {
245  if (word_end > curr_word_end) return 1;
246  }
247  }
248  return -1;
249  }
virtual NODE_REF next_node(EDGE_REF edge_ref) const =0
int UNICHAR_ID
Definition: unichar.h:31
NODE_REF next_node_from_edge_rec(const EDGE_RECORD &edge_rec) const
Returns the next node visited by following this edge.
Definition: dawg.h:194
bool edge_rec_match(NODE_REF next_node, bool word_end, UNICHAR_ID unichar_id, NODE_REF other_next_node, bool other_word_end, UNICHAR_ID other_unichar_id) const
Definition: dawg.h:253
inT64 NODE_REF
Definition: dawg.h:55
UNICHAR_ID unichar_id_from_edge_rec(const EDGE_RECORD &edge_rec) const
Returns UNICHAR_ID recorded in this edge.
Definition: dawg.h:211
bool end_of_word_from_edge_rec(const EDGE_RECORD &edge_rec) const
Returns true if this edge marks the end of a word.
Definition: dawg.h:207
void tesseract::Dawg::init ( DawgType  type,
const STRING lang,
PermuterType  perm,
int  unicharset_size,
int  debug_level 
)
protected

Sets type_, lang_, perm_, unicharset_size_. Initializes the values of various masks from unicharset_size_.

Definition at line 159 of file dawg.cpp.

160  {
161  type_ = type;
162  lang_ = lang;
163  perm_ = perm;
164  ASSERT_HOST(unicharset_size > 0);
165  unicharset_size_ = unicharset_size;
166  // Set bit masks.
167  flag_start_bit_ = ceil(log(static_cast<double>(unicharset_size_)) / log(2.0));
169  letter_mask_ = ~(~0 << flag_start_bit_);
172 
173  debug_level_ = debug_level;
174 }
PermuterType perm_
Permuter code that should be used if the word is found in this Dawg.
Definition: dawg.h:286
uinT64 letter_mask_
Definition: dawg.h:296
DawgType type() const
Definition: dawg.h:131
int flag_start_bit_
Definition: dawg.h:292
const STRING & lang() const
Definition: dawg.h:132
int debug_level_
Definition: dawg.h:298
DawgType type_
Definition: dawg.h:283
STRING lang_
Definition: dawg.h:284
uinT64 next_node_mask_
Definition: dawg.h:294
#define NUM_FLAG_BITS
Definition: dawg.h:91
int next_node_start_bit_
Definition: dawg.h:293
uinT64 flags_mask_
Definition: dawg.h:295
#define ASSERT_HOST(x)
Definition: errcode.h:84
int unicharset_size_
Definition: dawg.h:291
void tesseract::Dawg::iterate_words ( const UNICHARSET unicharset,
TessCallback1< const char * > *  cb 
) const

Definition at line 101 of file dawg.cpp.

102  {
103  WERD_CHOICE word(&unicharset);
104  iterate_words_rec(word, 0, cb);
105 }
void iterate_words_rec(const WERD_CHOICE &word_so_far, NODE_REF to_explore, TessCallback1< const char * > *cb) const
Definition: dawg.cpp:107
void tesseract::Dawg::iterate_words_rec ( const WERD_CHOICE word_so_far,
NODE_REF  to_explore,
TessCallback1< const char * > *  cb 
) const
protected

Definition at line 107 of file dawg.cpp.

109  {
110  NodeChildVector children;
111  this->unichar_ids_of(to_explore, &children);
112  for (int i = 0; i < children.size(); i++) {
113  WERD_CHOICE next_word(word_so_far);
114  next_word.append_unichar_id(children[i].unichar_id, 1, 0.0, 0.0);
115  if (this->end_of_word(children[i].edge_ref)) {
116  STRING s;
117  next_word.string_and_lengths(&s, NULL);
118  cb->Run(s.string());
119  }
120  NODE_REF next = next_node(children[i].edge_ref);
121  if (next != 0) {
122  iterate_words_rec(next_word, next, cb);
123  }
124  }
125 }
GenericVector< NodeChild > NodeChildVector
Definition: dawg.h:67
virtual NODE_REF next_node(EDGE_REF edge_ref) const =0
void iterate_words_rec(const WERD_CHOICE &word_so_far, NODE_REF to_explore, TessCallback1< const char * > *cb) const
Definition: dawg.cpp:107
#define NULL
Definition: host.h:144
const char * string() const
Definition: strngs.cpp:156
virtual bool end_of_word(EDGE_REF edge_ref) const =0
inT64 NODE_REF
Definition: dawg.h:55
virtual void Run(A1)=0
Definition: strngs.h:40
virtual void unichar_ids_of(NODE_REF node, NodeChildVector *vec) const =0
const STRING& tesseract::Dawg::lang ( ) const
inline

Definition at line 132 of file dawg.h.

132 { return lang_; }
STRING lang_
Definition: dawg.h:284
bool tesseract::Dawg::marker_flag_from_edge_rec ( const EDGE_RECORD edge_rec) const
inlineprotected

Returns the marker flag of this edge.

Definition at line 198 of file dawg.h.

198  {
199  return (edge_rec & (MARKER_FLAG << flag_start_bit_)) != 0;
200  }
int flag_start_bit_
Definition: dawg.h:292
#define MARKER_FLAG
Definition: dawg.h:87
bool tesseract::Dawg::match_words ( WERD_CHOICE word,
inT32  index,
NODE_REF  node,
UNICHAR_ID  wildcard 
) const
protected

Matches all of the words that are represented by this string. If wilcard is set to something other than INVALID_UNICHAR_ID, the *'s in this string are interpreted as wildcards. WERD_CHOICE param is not passed by const so that wildcard searches can modify it and work without having to copy WERD_CHOICEs.

Definition at line 127 of file dawg.cpp.

128  {
129  EDGE_REF edge;
130  inT32 word_end;
131 
132  if (wildcard != INVALID_UNICHAR_ID && word->unichar_id(index) == wildcard) {
133  bool any_matched = false;
134  NodeChildVector vec;
135  this->unichar_ids_of(node, &vec);
136  for (int i = 0; i < vec.size(); ++i) {
137  word->set_unichar_id(vec[i].unichar_id, index);
138  if (match_words(word, index, node, wildcard))
139  any_matched = true;
140  }
141  word->set_unichar_id(wildcard, index);
142  return any_matched;
143  } else {
144  word_end = index == word->length() - 1;
145  edge = edge_char_of(node, word->unichar_id(index), word_end);
146  if (edge != NO_EDGE) { // normal edge in DAWG
147  node = next_node(edge);
148  if (word_end) {
149  if (debug_level_ > 1) word->print("match_words() found: ");
150  return true;
151  } else if (node != 0) {
152  return match_words(word, index+1, node, wildcard);
153  }
154  }
155  }
156  return false;
157 }
int length() const
Definition: ratngs.h:214
GenericVector< NodeChild > NodeChildVector
Definition: dawg.h:67
virtual NODE_REF next_node(EDGE_REF edge_ref) const =0
inT64 EDGE_REF
Definition: dawg.h:54
int inT32
Definition: host.h:102
virtual EDGE_REF edge_char_of(NODE_REF node, UNICHAR_ID unichar_id, bool word_end) const =0
Returns the edge that corresponds to the letter out of this node.
bool match_words(WERD_CHOICE *word, inT32 index, NODE_REF node, UNICHAR_ID wildcard) const
Definition: dawg.cpp:127
const void print() const
Definition: ratngs.h:406
int debug_level_
Definition: dawg.h:298
void set_unichar_id(UNICHAR_ID unichar_id, int index)
Definition: ratngs.h:247
virtual void unichar_ids_of(NODE_REF node, NodeChildVector *vec) const =0
const UNICHAR_ID unichar_id(int index) const
Definition: ratngs.h:220
virtual NODE_REF tesseract::Dawg::next_node ( EDGE_REF  edge_ref) const
pure virtual

Returns the next node visited by following the edge indicated by the given EDGE_REF.

Implemented in tesseract::SquishedDawg, and tesseract::Trie.

NODE_REF tesseract::Dawg::next_node_from_edge_rec ( const EDGE_RECORD edge_rec) const
inlineprotected

Returns the next node visited by following this edge.

Definition at line 194 of file dawg.h.

194  {
195  return ((edge_rec & next_node_mask_) >> next_node_start_bit_);
196  }
uinT64 next_node_mask_
Definition: dawg.h:294
int next_node_start_bit_
Definition: dawg.h:293
virtual EDGE_REF tesseract::Dawg::pattern_loop_edge ( EDGE_REF  edge_ref,
UNICHAR_ID  unichar_id,
bool  word_end 
) const
inlinevirtual

Returns the given EDGE_REF if the EDGE_RECORD that it points to has a self loop and the given unichar_id matches the unichar_id stored in the EDGE_RECORD, returns NO_EDGE otherwise.

Reimplemented in tesseract::Trie.

Definition at line 185 of file dawg.h.

186  {
187  return false;
188  }
PermuterType tesseract::Dawg::permuter ( ) const
inline

Definition at line 133 of file dawg.h.

133 { return perm_; }
PermuterType perm_
Permuter code that should be used if the word is found in this Dawg.
Definition: dawg.h:286
virtual void tesseract::Dawg::print_node ( NODE_REF  node,
int  max_num_edges 
) const
pure virtual

Prints the contents of the node indicated by the given NODE_REF. At most max_num_edges will be printed.

Implemented in tesseract::SquishedDawg, and tesseract::Trie.

void tesseract::Dawg::set_marker_flag_in_edge_rec ( EDGE_RECORD edge_rec)
inlineprotected

Sets this edge record to be the last one in a sequence of edges.

Definition at line 222 of file dawg.h.

222  {
223  *edge_rec |= (MARKER_FLAG << flag_start_bit_);
224  }
int flag_start_bit_
Definition: dawg.h:292
#define MARKER_FLAG
Definition: dawg.h:87
void tesseract::Dawg::set_next_node_in_edge_rec ( EDGE_RECORD edge_rec,
EDGE_REF  value 
)
inlineprotected

Sets the next node link for this edge in the Dawg.

Definition at line 216 of file dawg.h.

217  {
218  *edge_rec &= (~next_node_mask_);
219  *edge_rec |= ((value << next_node_start_bit_) & next_node_mask_);
220  }
uinT64 next_node_mask_
Definition: dawg.h:294
int next_node_start_bit_
Definition: dawg.h:293
DawgType tesseract::Dawg::type ( ) const
inline

Definition at line 131 of file dawg.h.

131 { return type_; }
DawgType type_
Definition: dawg.h:283
UNICHAR_ID tesseract::Dawg::unichar_id_from_edge_rec ( const EDGE_RECORD edge_rec) const
inlineprotected

Returns UNICHAR_ID recorded in this edge.

Definition at line 211 of file dawg.h.

212  {
213  return ((edge_rec & letter_mask_) >> LETTER_START_BIT);
214  }
uinT64 letter_mask_
Definition: dawg.h:296
#define LETTER_START_BIT
Definition: dawg.h:90
virtual void tesseract::Dawg::unichar_id_to_patterns ( UNICHAR_ID  unichar_id,
const UNICHARSET unicharset,
GenericVector< UNICHAR_ID > *  vec 
) const
inlinevirtual

Fills vec with unichar ids that represent the character classes of the given unichar_id.

Reimplemented in tesseract::Trie.

Definition at line 178 of file dawg.h.

180  {};
virtual void tesseract::Dawg::unichar_ids_of ( NODE_REF  node,
NodeChildVector vec 
) const
pure virtual

Fills the given NodeChildVector with all the unichar ids (and the corresponding EDGE_REFs) for which there is an edge out of this node.

Implemented in tesseract::SquishedDawg, and tesseract::Trie.

bool tesseract::Dawg::word_in_dawg ( const WERD_CHOICE word) const

Returns true if the given word is in the Dawg.

Definition at line 48 of file dawg.cpp.

48  {
49  if (word.length() == 0) return false;
50  NODE_REF node = 0;
51  int end_index = word.length() - 1;
52  for (int i = 0; i <= end_index; i++) {
53  if (debug_level_ > 1) {
54  tprintf("word_in_dawg: exploring node " REFFORMAT ":\n", node);
56  tprintf("\n");
57  }
58  EDGE_REF edge = edge_char_of(node, word.unichar_id(i), i == end_index);
59  if (edge != NO_EDGE) {
60  node = next_node(edge);
61  if (node == 0) node = NO_EDGE;
62  } else {
63  return false;
64  }
65  }
66  return true;
67 }
int length() const
Definition: ratngs.h:214
virtual NODE_REF next_node(EDGE_REF edge_ref) const =0
#define REFFORMAT
Definition: dawg.h:92
inT64 EDGE_REF
Definition: dawg.h:54
virtual EDGE_REF edge_char_of(NODE_REF node, UNICHAR_ID unichar_id, bool word_end) const =0
Returns the edge that corresponds to the letter out of this node.
int debug_level_
Definition: dawg.h:298
#define MAX_NODE_EDGES_DISPLAY
Definition: dawg.h:86
DLLSYM void tprintf(const char *format,...)
Definition: tprintf.cpp:41
virtual void print_node(NODE_REF node, int max_num_edges) const =0
inT64 NODE_REF
Definition: dawg.h:55
const UNICHAR_ID unichar_id(int index) const
Definition: ratngs.h:220

Member Data Documentation

int tesseract::Dawg::debug_level_
protected

Definition at line 298 of file dawg.h.

int tesseract::Dawg::flag_start_bit_
protected

Definition at line 292 of file dawg.h.

uinT64 tesseract::Dawg::flags_mask_
protected

Definition at line 295 of file dawg.h.

const inT16 tesseract::Dawg::kDawgMagicNumber = 42
static

Magic number to determine endianness when reading the Dawg from file.

Definition at line 125 of file dawg.h.

const UNICHAR_ID tesseract::Dawg::kPatternUnicharID = 0
static

A special unichar id that indicates that any appropriate pattern (e.g.dicitonary word, 0-9 digit, etc) can be inserted instead Used for expressing patterns in punctuation and number Dawgs.

Definition at line 129 of file dawg.h.

STRING tesseract::Dawg::lang_
protected

Definition at line 284 of file dawg.h.

uinT64 tesseract::Dawg::letter_mask_
protected

Definition at line 296 of file dawg.h.

uinT64 tesseract::Dawg::next_node_mask_
protected

Definition at line 294 of file dawg.h.

int tesseract::Dawg::next_node_start_bit_
protected

Definition at line 293 of file dawg.h.

PermuterType tesseract::Dawg::perm_
protected

Permuter code that should be used if the word is found in this Dawg.

Definition at line 286 of file dawg.h.

DawgType tesseract::Dawg::type_
protected

Definition at line 283 of file dawg.h.

int tesseract::Dawg::unicharset_size_
protected

Definition at line 291 of file dawg.h.


The documentation for this class was generated from the following files: