Lines Matching full:word
27 #include "grph.h" // The word graph object and interface
123 // Create the container for the word graph.
439 // Create a Word Graph node for each rule node
496 std::string word; // Words are whitespace separated
506 //search beginning of the first word
509 //while beginning of a word found
511 //search end of the actual word
514 //end of word is end of line
517 word.clear();
518 // word.assign(cdata,begIdx,endIdx);
519 word.append (cdata, begIdx, endIdx - begIdx);
520 if ( !word.empty() )
523 std::cout << " -->" << word << "<--\n";
527 if ( IsSlot( word ) ) {
533 word = (std::string)xmlBasename + "." + ruleName + "@" + word;
534 addLabelToList( word );
535 findLabelIndex( word, index );
537 addLabelToList( word );
538 findLabelIndex( word, index );
599 // Extend word FST node with an entire FST subgraph.
