/external/openfst/src/script/ |
H A D | shortest-distance.cc | 25 void ShortestDistance(const FstClass &fst, vector<WeightClass> *distance, function in namespace:fst::script 29 Apply<Operation<ShortestDistanceArgs1> >("ShortestDistance", fst.ArcType(), 34 void ShortestDistance(const FstClass &ifst, vector<WeightClass> *distance, function in namespace:fst::script 38 Apply<Operation<ShortestDistanceArgs2> >("ShortestDistance", ifst.ArcType(), 43 WeightClass ShortestDistance(const FstClass &ifst) { function in namespace:fst::script 46 Apply<Operation<ShortestDistanceArgs3> >("ShortestDistance", ifst.ArcType(), 52 REGISTER_FST_OPERATION(ShortestDistance, StdArc, ShortestDistanceArgs1); 53 REGISTER_FST_OPERATION(ShortestDistance, LogArc, ShortestDistanceArgs1); 54 REGISTER_FST_OPERATION(ShortestDistance, Log64Arc, ShortestDistanceArgs1); 56 REGISTER_FST_OPERATION(ShortestDistance, StdAr [all...] |
/external/openfst/src/include/fst/script/ |
H A D | shortest-distance.h | 115 ShortestDistance(fst, &weights, sdopts); 126 ShortestDistance(fst, &weights, sdopts); 137 ShortestDistance(fst, &weights, sdopts); 149 ShortestDistance(fst, &weights, sdopts); 163 void ShortestDistance(ShortestDistanceArgs1 *args) { function in namespace:fst::script 205 void ShortestDistance(ShortestDistanceArgs2 *args) { function in namespace:fst::script 209 ShortestDistance(fst, &distance, args->arg3, args->arg4); 225 void ShortestDistance(ShortestDistanceArgs3 *args) { function in namespace:fst::script 228 args->retval = WeightClass(ShortestDistance(fst)); 233 void ShortestDistance(cons [all...] |
H A D | fstscript.h | 136 REGISTER_FST_OPERATION(ShortestDistance, Arc, ShortestDistanceArgs1); 137 REGISTER_FST_OPERATION(ShortestDistance, Arc, ShortestDistanceArgs2); 138 REGISTER_FST_OPERATION(ShortestDistance, Arc, ShortestDistanceArgs3);
|
/external/openfst/src/include/fst/ |
H A D | shortest-distance.h | 65 // ShortestDistance(source) when 'retain' is true for improved 91 void ShortestDistance(StateId source); 116 void ShortestDistanceState<Arc, Queue, ArcFilter>::ShortestDistance( function in class:fst::ShortestDistanceState 124 FSTERROR() << "ShortestDistance: Weight needs to be right distributive: " 131 FSTERROR() << "ShortestDistance: first_path option disallowed when " 244 void ShortestDistance( function in namespace:fst 251 sd_state.ShortestDistance(opts.source); 281 void ShortestDistance(const Fst<Arc> &fst, function in namespace:fst 294 ShortestDistance(fst, distance, opts); 307 ShortestDistance(rfs 323 typename Arc::Weight ShortestDistance(const Fst<Arc> &fst, float delta = kDelta) { function in namespace:fst [all...] |
H A D | randequivalent.h | 89 Weight sum1 = ShortestDistance(pfst1); 99 Weight sum2 = ShortestDistance(pfst2);
|
H A D | push.h | 40 // the output of ShortestDistance. 'distance' is the shortest distance from the 103 ShortestDistance(*fst, &distance, type == REWEIGHT_TO_INITIAL, delta); 140 ShortestDistance(gfst, &gdistance, rtype == REWEIGHT_TO_INITIAL, delta); 146 ShortestDistance(guwfst, &gdistance, rtype == REWEIGHT_TO_INITIAL, delta);
|
H A D | prune.h | 119 ShortestDistance(*fst, &tmp, true, opts.delta); 243 ShortestDistance(ifst, &tmp, true, opts.delta);
|
H A D | rmepsilon.h | 163 sd_state_.ShortestDistance(source);
|
H A D | shortest-path.h | 434 ShortestDistance(ifst, distance, opts);
|
H A D | determinize.h | 996 ShortestDistance(ifst, &idistance, true);
|
/external/openfst/src/bin/ |
H A D | fstshortestdistance.cc | 83 s::ShortestDistance(*ifst, &distance, FLAGS_reverse, FLAGS_delta); 87 s::ShortestDistance(*ifst, &distance, opts);
|
/external/openfst/src/include/fst/extensions/far/ |
H A D | print-strings.h | 103 cout << FLAGS_far_field_separator[0] << ShortestDistance(fst);
|
/external/openfst/src/test/ |
H A D | algo_test.h | 623 ShortestDistance(U, &d, true); 627 ShortestDistance(U1, &d, true); 631 ShortestDistance(U2, &d, true); 747 VLOG(1) << "Check: ShortestDistance(T- prune(T))" 748 << " > ShortestDistance(T) times Thresold"; 757 Weight sum1 = Times(ShortestDistance(A), thresold); 758 Weight sum2 = ShortestDistance(C); 780 Weight tsum = ShortestDistance(T); 781 Weight psum = ShortestDistance(path); 794 ShortestDistance(path [all...] |