/external/srec/tools/thirdparty/OpenFst/fst/lib/ |
H A D | determinize.h | 710 void Determinize(const Fst<Arc> &ifst, MutableFst<Arc> *ofst, argument 715 *ofst = DeterminizeFst<Arc>(ifst, nopts);
|
H A D | epsnormalize.h | 48 void EpsNormalize(const Fst<Arc> &ifst, MutableFst<Arc> *ofst, argument 52 Map(ifst, &gfst, ToGallicMapper<Arc, STRING_RIGHT_RESTRICT>()); 54 Map(InvertFst<Arc>(ifst), &gfst,
|
H A D | map.h | 158 void Map(const Fst<A> &ifst, MutableFst<B> *ofst, C* mapper) { argument 163 ofst->SetInputSymbols(ifst.InputSymbols()); 164 ofst->SetOutputSymbols(ifst.OutputSymbols()); 166 if (ifst.Start() == kNoStateId) 170 for (StateIterator< Fst<A> > siter(ifst); !siter.Done(); siter.Next()) 179 for (StateIterator< Fst<A> > siter(ifst); !siter.Done(); siter.Next()) { 181 if (s == ifst.Start()) 184 for (ArcIterator< Fst<A> > aiter(ifst, s); !aiter.Done(); aiter.Next()) 190 B final_arc = (*mapper)(A(0, 0, ifst.Final(s), kNoStateId)); 196 B final_arc = (*mapper)(A(0, 0, ifst 231 Map(const Fst<A> &ifst, MutableFst<B> *ofst, C mapper) argument [all...] |
H A D | prune.h | 137 // 'ifst' whose weight is no more than 'opts.threshold' Times() the 141 void Prune(const Fst<Arc> &ifst, argument 155 if (ifst.Start() == kNoStateId) 163 ShortestDistance(ifst, idistance, false); 168 ShortestDistance(ifst, fdistance, true); 173 while (fdistance->size() <= ifst.Start()) 175 Weight ceiling = Times((*fdistance)[ifst.Start()], opts.threshold); 177 for (StateIterator< Fst<Arc> > sit(ifst); 193 if (!less(ceiling, Times((*idistance)[state], ifst.Final(state)))) 194 ofst->SetFinal(copy[state], ifst 238 Prune(const Fst<Arc> &ifst, MutableFst<Arc> *ofst, typename Arc::Weight threshold) argument [all...] |
H A D | push.h | 57 void Push(const Fst<Arc> &ifst, MutableFst<Arc> *ofst, uint32 ptype) { argument 60 *ofst = ifst; 68 Map(ifst, &gfst, ToGallicMapper<Arc, stype>()); 73 uwfst(ifst, RmWeightMapper<Arc>()); 83 *ofst = ifst;
|
H A D | randgen.h | 105 int64 source; // 'ifst' state to expand 117 void RandGen(const Fst<Arc> &ifst, MutableFst<Arc> *ofst, argument 121 if (opts.npath == 0 || opts.max_length == 0 || ifst.Start() == kNoStateId) 126 ofst->SetInputSymbols(ifst.InputSymbols()); 127 ofst->SetOutputSymbols(ifst.OutputSymbols()); 130 nopts.source = ifst.Start(); 133 RandGen(ifst, ofst, nopts); 135 if (ifst.NumArcs(opts.source) == 0 && 136 ifst.Final(opts.source) == Weight::Zero()) // Non-coaccessible 139 size_t n = opts.arc_selector(ifst, opt 161 RandGen(const Fst<Arc> &ifst, MutableFst<Arc> *ofst) argument [all...] |
H A D | reverse.h | 36 void Reverse(const Fst<Arc> &ifst, MutableFst<RevArc> *ofst) { argument 42 ofst->SetInputSymbols(ifst.InputSymbols()); 43 ofst->SetOutputSymbols(ifst.OutputSymbols()); 44 StateId istart = ifst.Start(); 48 for (StateIterator< Fst<Arc> > siter(ifst); 58 Weight final = ifst.Final(is); 64 for (ArcIterator< Fst<Arc> > aiter(ifst, is); 75 uint64 iprops = ifst.Properties(kCopyProperties, false);
|
H A D | shortest-path.h | 51 // 'ifst'. 'distance' returns the shortest distances from the source 52 // state to each state in 'ifst'. 'opts' is used to specify options 61 void SingleShortestPath(const Fst<Arc> &ifst, argument 69 ofst->SetInputSymbols(ifst.InputSymbols()); 70 ofst->SetOutputSymbols(ifst.OutputSymbols()); 72 if (ifst.Start() == kNoStateId) 81 StateId source = opts.source == kNoStateId ? ifst.Start() : opts.source; 112 for (ArcIterator< Fst<Arc> > aiter(ifst, s); 137 if (ifst.Final(s) != Weight::Zero()) { 138 Weight w = Times(sd, ifst 228 ShortestPath(const Fst<Arc> &ifst, MutableFst<Arc> *ofst, vector<typename Arc::Weight> *distance, ShortestPathOptions<Arc, Queue, ArcFilter> &opts) argument 351 ShortestPath(const Fst<Arc> &ifst, MutableFst<Arc> *ofst, size_t n = 1, bool unique = false) argument [all...] |
H A D | synchronize.h | 451 void Synchronize(const Fst<Arc> &ifst, MutableFst<Arc> *ofst) { argument 454 *ofst = SynchronizeFst<Arc>(ifst, opts);
|
/external/openfst/src/bin/ |
H A D | fstconvert.cc | 45 FstClass *ifst = FstClass::Read(in_name); local 46 if (!ifst) return 1; 48 FstClass *ofst = ifst; 52 ofst = s::Convert(*ifst, FLAGS_fst_type);
|
H A D | fstdeterminize.cc | 53 FstClass *ifst = FstClass::Read(in_name); local 54 if (!ifst) return 1; 56 VectorFstClass ofst(ifst->ArcType()); 60 WeightClass::Zero() : WeightClass(ifst->WeightType(), FLAGS_weight), 63 s::Determinize(*ifst, &ofst, opts);
|
H A D | fstepsnormalize.cc | 47 FstClass *ifst = FstClass::Read(in_name); local 48 if (!ifst) return 1; 53 VectorFstClass ofst(ifst->ArcType()); 54 s::EpsNormalize(*ifst, &ofst, eps_norm_type);
|
H A D | fstinfo.cc | 52 FstClass *ifst = FstClass::Read(in_name); local 53 if (!ifst) return 1; 55 s::PrintFstInfo(*ifst, FLAGS_test_properties, FLAGS_arc_filter,
|
H A D | fstmap.cc | 55 FstClass *ifst = FstClass::Read(in_name); local 56 if (!ifst) return 1; 59 s::WeightClass(ifst->WeightType(), FLAGS_weight) : 92 FstClass *ofst = s::Map(*ifst, mt, FLAGS_delta, w);
|
H A D | fstpush.cc | 53 FstClass *ifst = FstClass::Read(in_name); local 54 if (!ifst) return 1; 66 VectorFstClass ofst(ifst->ArcType()); 69 s::Push(*ifst, &ofst, flags, fst::REWEIGHT_TO_FINAL, FLAGS_delta); 71 s::Push(*ifst, &ofst, flags, fst::REWEIGHT_TO_INITIAL, FLAGS_delta);
|
H A D | fstrandgen.cc | 56 FstClass *ifst = FstClass::Read(in_name); local 57 if (!ifst) return 1; 59 VectorFstClass ofst(ifst->ArcType()); 75 s::RandGen(*ifst, &ofst, FLAGS_seed,
|
H A D | fstreplace.cc | 43 FstClass *ifst = FstClass::Read(in_fname); local 44 if (!ifst) return 1; 50 fst_tuples.push_back(make_pair(root, ifst)); 53 ifst = s::FstClass::Read(argv[i]); 54 if (!ifst) return 1; 56 fst_tuples.push_back(make_pair(lab, ifst)); 59 VectorFstClass ofst(ifst->ArcType());
|
H A D | fstreverse.cc | 50 FstClass *ifst = FstClass::Read(in_name); local 51 if (!ifst) return 1; 53 VectorFstClass *out = new VectorFstClass(ifst->ArcType()); 55 Reverse(*ifst, out);
|
H A D | fstrmepsilon.cc | 54 FstClass *ifst = FstClass::Read(in_fname); local 55 if (!ifst) return 1; 59 WeightClass(ifst->WeightType(), FLAGS_weight); 83 MutableFstClass *ofst = new VectorFstClass(ifst->ArcType()); 84 s::RmEpsilon(*ifst, ofst, FLAGS_reverse, opts);
|
H A D | fstshortestdistance.cc | 53 FstClass *ifst = FstClass::Read(in_fname); local 54 if (!ifst) return 1; 83 s::ShortestDistance(*ifst, &distance, FLAGS_reverse, FLAGS_delta); 87 s::ShortestDistance(*ifst, &distance, opts);
|
H A D | fstshortestpath.cc | 54 FstClass *ifst = FstClass::Read(in_fname); local 55 if (!ifst) return 1; 59 WeightClass(ifst->WeightType(), FLAGS_weight); 61 VectorFstClass ofst(ifst->ArcType()); 87 s::ShortestPath(*ifst, &ofst, &distance, opts);
|
H A D | fstsynchronize.cc | 44 FstClass *ifst = FstClass::Read(in_name); local 45 if (!ifst) return 1; 47 VectorFstClass ofst(ifst->ArcType()); 49 s::Synchronize(*ifst, &ofst);
|
/external/openfst/src/extensions/pdt/ |
H A D | pdtexpand.cc | 49 s::FstClass *ifst = s::FstClass::Read(in_name); local 50 if (!ifst) return 1; 62 s::WeightClass(ifst->WeightType(), FLAGS_weight); 64 s::VectorFstClass ofst(ifst->ArcType()); 65 s::PdtExpand(*ifst, parens, &ofst, s::PdtExpandOptions(
|
H A D | pdtinfo.cc | 45 s::FstClass *ifst = s::FstClass::Read(in_name); local 46 if (!ifst) return 1; 56 s::PrintPdtInfo(*ifst, parens);
|
H A D | pdtreplace.cc | 49 s::FstClass *ifst = s::FstClass::Read(in_fname); local 50 if (!ifst) return 1; 56 fst_tuples.push_back(make_pair(root, ifst)); 59 ifst = s::FstClass::Read(argv[i]); 60 if (!ifst) return 1; 62 fst_tuples.push_back(make_pair(lab, ifst)); 65 s::VectorFstClass ofst(ifst->ArcType());
|