Searched refs:rfst (Results 1 - 6 of 6) sorted by relevance
/external/openfst/src/include/fst/script/ |
H A D | rmepsilon.h | 142 VectorFst<Arc> rfst; local 143 Reverse(ifst, &rfst); 144 RmEpsilonHelper(&rfst, &distance, args->arg4); 145 Reverse(rfst, ofst);
|
/external/srec/tools/thirdparty/OpenFst/fst/lib/ |
H A D | shortest-distance.h | 246 VectorFst<ReverseArc> rfst; local 247 Reverse(fst, &rfst); 249 AutoQueue<StateId> state_queue(rfst, &rdistance, rarc_filter); 253 ShortestDistance(rfst, &rdistance, ropts);
|
H A D | shortest-path.h | 255 // Algorithm works on the reverse of 'fst' : 'rfst' 'distance' is 256 // the distance to the final state in 'rfst' 'ofst' is built as the 257 // reverse of the tree of n-shortest path in 'rfst'. 261 VectorFst<ReverseArc> rfst; local 262 Reverse(ifst, &rfst); 264 while (distance->size() < rfst.NumStates()) 269 // initial state of 'rfst' to a state s in 'rfst', that can be 290 pairs[final] = Pair(rfst.Start(), Weight::One()); 307 for (ArcIterator< Fst<ReverseArc> > aiter(rfst, [all...] |
/external/openfst/src/include/fst/ |
H A D | shortest-distance.h | 299 VectorFst<ReverseArc> rfst; local 300 Reverse(fst, &rfst); 302 AutoQueue<StateId> state_queue(rfst, &rdistance, rarc_filter); 307 ShortestDistance(rfst, &rdistance, ropts);
|
H A D | shortest-path.h | 440 // Algorithm works on the reverse of 'fst' : 'rfst', 'distance' is 441 // the distance to the final state in 'rfst', 'ofst' is built as the 442 // reverse of the tree of n-shortest path in 'rfst'. 443 VectorFst<ReverseArc> rfst; local 444 Reverse(ifst, &rfst); 446 for (ArcIterator< VectorFst<ReverseArc> > aiter(rfst, 0); 456 NShortestPath(rfst, ofst, *distance, n, opts.delta, 461 DeterminizeFst<ReverseArc> dfst(rfst, distance, &ddistance, dopts);
|
H A D | randgen.h | 692 RandFst rfst(ifst, fopts); 694 *ofst = rfst; 697 DfsVisit(rfst, &rand_visitor);
|
Completed in 2109 milliseconds