| /external/srec/tools/test_g2g/ |
| test_g2g.c | 252 ilabels_following[0] = arc->ilabel;
266 if(arc->ilabel == WORD_BOUNDARY) break;
267 ilabels_preceding[num_ilabels_preceding++] = arc->ilabel;
282 ilabels_following[num_ilabels_following++] = arc->ilabel;
283 if(arc->ilabel == WORD_BOUNDARY) break;
|
| /external/srec/tools/grxmlcompile/ |
| sub_base.cpp | 71 NUANArc *SubGraph::CreateArc (int iLabel, int oLabel, int from, int to)
73 assert (!(iLabel == NONE_LABEL && from == to));
75 NUANArc *arc_one= new NUANArc (iLabel, oLabel, from, to);
|
| sub_grph.h | 209 NUANArc *CreateArc (int iLabel, int oLabel, int from, int to);
|
| /external/srec/srec/crec/ |
| srec.c | 386 hmm_info = &rec->context->hmm_info_for_ilabel[fsm_arc->ilabel];
414 if (fsm_arc->ilabel != MAXlabelID)
416 hmm_info = &rec->context->hmm_info_for_ilabel[fsm_arc->ilabel];
894 if (fsm_arc->ilabel >= EPSILON_OFFSET)
912 if (fsm_arc->ilabel == WORD_BOUNDARY && cost_with_wtw >= current_word_threshold) {
930 if (fsm_arc->ilabel == WORD_BOUNDARY) {
1268 labelID ilabel; local
1569 labelID ilabel; local
[all...] |
| text_parser.c | 98 if (tmp->ilabel == MAXwordID) whether_final_atok = 1;
|
| srec_tokens.c | 97 token->num_hmm_states = rec->context->hmm_info_for_ilabel[arc->ilabel].num_states;
|
| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| project.h | 39 ? arc.ilabel : arc.olabel;
|
| rmfinalepsilon.h | 75 if (arc.ilabel == 0 && arc.olabel == 0) {
|
| synchronize.h | 216 if (!Empty(e.istring, arc.ilabel) && !Empty(e.ostring, arc.olabel)) {
217 const String *istring = Cdr(e.istring, arc.ilabel);
220 AddArc(s, Arc(Car(e.istring, arc.ilabel),
223 const String *istring = Concat(e.istring, arc.ilabel);
|
| arcsort.h | 282 return arc1.ilabel < arc2.ilabel;
|
| equivalent.h | 197 arc_pairs[arc.ilabel].first = Util::MapState(arc.nextstate, FST1);
209 arc_pairs[arc.ilabel].second = Util::MapState(arc.nextstate, FST2);
|
| replace.h | 323 AddArc(s, A(arc.ilabel, arc.olabel, arc.weight, nextstate));
340 Label ilabel = (opts_.epsilon_on_replace) ? 0 : arc.ilabel; local
341 AddArc(s, A(ilabel, 0, arc.weight, nt_nextstate));
347 AddArc(s, A(arc.ilabel, arc.olabel, arc.weight, nextstate));
|
| properties.h | 54 // ilabel == olabel for each arc
56 // ilabel != olabel for some arc
|
| mutable-fst.h | 134 // arc.ilabel = 7;
|
| randgen.h | 146 Arc oarc(iarc.ilabel, iarc.olabel, Weight::One(), ofst->AddState());
|
| factor-weight.h | 266 AddArc(s, Arc(arc.ilabel, arc.olabel, w, d));
272 AddArc(s, Arc(arc.ilabel, arc.olabel, p.first, d));
|
| complement.h | 238 arc_.ilabel = arc_.olabel = kRhoLabel;
|
| const-fst.h | 151 if (arc.ilabel == 0)
|
| determinize.h | 317 Subset* &dest_subset = (*label_map)[arc.ilabel];
329 arc.ilabel = label;
|
| cache.h | 184 if (arc.ilabel == 0)
|
| fst.h | 524 SymbolTable *isymbols_; // Ilabel symbol table
|
| shortest-path.h | 311 Arc arc(rarc.ilabel, rarc.olabel, rarc.weight.Reverse(), rarc.nextstate);
|
| /external/srec/srec/include/ |
| astar.h | 62 wordID ilabel; /* input label */ member in struct:arc_token_t
|
| search_network.h | 131 labelID ilabel; /* input label */ member in struct:FSMarc_t
|
| /external/srec/srec/clib/ |
| srec_arb.c | 101 larger than what an ilabel can hold, the solution to that is
108 cost is 16bits, ilabel is 16bits
109 on ilabel we encode the a1,(a2-a1)
|
