HomeSort by relevance Sort by last modified time
    Searched refs:fst (Results 26 - 50 of 408) sorted by null

12 3 4 5 6 7 8 91011>>

  /external/openfst/src/include/fst/script/
fstscript-decl.h 17 // Forward declarations for the FST and FST-script classes.
22 #include <fst/fst-decl.h>
24 namespace fst { namespace
33 } // namespace fst;
topsort.h 20 #include <fst/script/arg-packs.h>
21 #include <fst/script/fst-class.h>
22 #include <fst/topsort.h>
24 namespace fst { namespace
31 MutableFst<Arc> *fst = args->args->GetMutableFst<Arc>(); local
32 args->retval = TopSort(fst);
35 bool TopSort(MutableFstClass *fst);
38 } // namespace fst
closure.h 20 #include <fst/script/arg-packs.h>
21 #include <fst/script/fst-class.h>
22 #include <fst/closure.h>
24 namespace fst { namespace
31 MutableFst<Arc> *fst = args->arg1->GetMutableFst<Arc>(); local
33 Closure(fst, args->arg2);
39 } // namespace fst
verify.h 20 #include <fst/script/arg-packs.h>
21 #include <fst/script/fst-class.h>
22 #include <fst/verify.h>
24 namespace fst { namespace
31 const Fst<Arc> *fst = args->args->GetFst<Arc>(); local
32 args->retval = Verify(*fst);
38 } // namespace fst
arcsort.h 20 #include <fst/arcsort.h>
21 #include <fst/script/arg-packs.h>
22 #include <fst/script/fst-class.h>
24 namespace fst { namespace
33 MutableFst<Arc> *fst = args->arg1->GetMutableFst<Arc>(); local
37 ArcSort(fst, icomp);
40 ArcSort(fst, ocomp);
47 } // namespace fst
compile.h 20 #include <fst/script/arg-packs.h>
21 #include <fst/script/fst-class.h>
22 #include <fst/script/compile-impl.h>
24 namespace fst { namespace
32 fst::istream &istrm;
36 const fst::SymbolTable *isyms;
37 const fst::SymbolTable *osyms;
38 const fst::SymbolTable *ssyms;
46 const string &fst_type, const fst::SymbolTable *isyms
69 const Fst<Arc> *fst = &fstcompiler.Fst(); local
    [all...]
project.h 20 #include <fst/script/arg-packs.h>
21 #include <fst/script/fst-class.h>
22 #include <fst/project.h> // for ProjectType
24 namespace fst { namespace
39 } // namespace fst
reweight.h 23 #include <fst/script/arg-packs.h>
24 #include <fst/script/fst-class.h>
25 #include <fst/script/weight-class.h>
26 #include <fst/reweight.h>
28 namespace fst { namespace
36 MutableFst<Arc> *fst = args->arg1->GetMutableFst<Arc>(); local
44 Reweight(fst, potentials, args->arg3);
47 void Reweight(MutableFstClass *fst, const vector<WeightClass> &potential,
51 } // namespace fst
    [all...]
  /external/openfst/src/script/
connect.cc 17 #include <fst/script/fst-class.h>
18 #include <fst/script/script-impl.h>
19 #include <fst/script/connect.h>
21 namespace fst { namespace
24 void Connect(MutableFstClass *fst) {
25 Apply<Operation<MutableFstClass> >("Connect", fst->ArcType(), fst);
33 } // namespace fst
invert.cc 17 #include <fst/script/fst-class.h>
18 #include <fst/script/script-impl.h>
19 #include <fst/script/invert.h>
21 namespace fst { namespace
24 void Invert(MutableFstClass *fst) {
25 Apply<Operation<MutableFstClass> >("Invert", fst->ArcType(), fst);
33 } // namespace fst
topsort.cc 17 #include <fst/script/fst-class.h>
18 #include <fst/script/script-impl.h>
19 #include <fst/script/topsort.h>
21 namespace fst { namespace
24 bool TopSort(MutableFstClass *fst) {
25 TopSortArgs args(fst);
27 Apply<Operation<TopSortArgs> >("TopSort", fst->ArcType(), &args);
37 } // namespace fst
verify.cc 17 #include <fst/script/fst-class.h>
18 #include <fst/script/script-impl.h>
19 #include <fst/script/verify.h>
21 namespace fst { namespace
24 bool Verify(const FstClass &fst) {
25 VerifyArgs args(&fst);
27 Apply<Operation<VerifyArgs> >("Verify", fst.ArcType(), &args);
37 } // namespace fst
arcsort.cc 17 #include <fst/script/fst-class.h>
18 #include <fst/script/arcsort.h>
19 #include <fst/script/script-impl.h>
21 namespace fst { namespace
24 void ArcSort(MutableFstClass *fst, ArcSortType sort_type) {
25 ArcSortArgs args(fst, sort_type);
27 Apply<Operation<ArcSortArgs> >("ArcSort", fst->ArcType(), &args);
35 } // namespace fst
closure.cc 17 #include <fst/script/fst-class.h>
18 #include <fst/script/script-impl.h>
19 #include <fst/script/closure.h>
21 namespace fst { namespace
24 void Closure(MutableFstClass *fst, ClosureType closure_type) {
25 ClosureArgs args(fst, closure_type);
27 Apply<Operation<ClosureArgs> >("Closure", fst->ArcType(), &args);
35 } // namespace fst
reweight.cc 17 #include <fst/script/fst-class.h>
18 #include <fst/script/script-impl.h>
19 #include <fst/script/reweight.h>
21 namespace fst { namespace
24 void Reweight(MutableFstClass *fst, const vector<WeightClass> &potential,
26 ReweightArgs args(fst, potential, reweight_type);
28 Apply<Operation<ReweightArgs> >("Reweight", fst->ArcType(), &args);
36 } // namespace fst
  /external/openfst/src/bin/
fstreweight.cc 20 // Reweights an FST.
23 #include <fst/script/reweight.h>
24 #include <fst/script/text-io.h>
29 namespace s = fst::script;
30 using fst::script::FstClass;
31 using fst::script::MutableFstClass;
33 string usage = "Reweights an FST.\n\n Usage: ";
35 usage += " in.fst potential.txt [out.fst]\n";
48 MutableFstClass *fst = MutableFstClass::Read(in_fname, true) local
    [all...]
fstarcsort.cc 20 // Sorts arcs of an FST.
25 #include <fst/compat.h>
26 #include <fst/script/arcsort.h>
32 using fst::script::FstClass;
33 using fst::script::MutableFstClass;
34 using fst::script::ArcSort;
36 string usage = "Sorts arcs of an FST.\n\n Usage: ";
38 usage += " [in.fst [out.fst]]\n";
51 MutableFstClass *fst = MutableFstClass::Read(in_name, true) local
    [all...]
fstconnect.cc 21 // from an FST.
24 #include <fst/script/connect.h>
27 namespace s = fst::script;
28 using fst::script::FstClass;
29 using fst::script::MutableFstClass;
31 string usage = "Removes useless states and arcs from an FST.\n\n Usage: ";
33 usage += " [in.fst [out.fst]]\n";
45 MutableFstClass *fst = MutableFstClass::Read(in_name, true); local
46 if (!fst) return 1
    [all...]
fstinvert.cc 23 #include <fst/script/invert.h>
26 namespace s = fst::script;
27 using fst::script::FstClass;
28 using fst::script::MutableFstClass;
32 usage += " [in.fst [out.fst]]\n";
44 MutableFstClass *fst = MutableFstClass::Read(in_name, true); local
45 if (!fst) return 1;
47 s::Invert(fst);
48 fst->Write(out_name)
    [all...]
fstclosure.cc 20 // Creates the Kleene closure of an FST.
23 #include <fst/script/closure.h>
29 using fst::script::FstClass;
30 using fst::script::MutableFstClass;
32 string usage = "Creates the Kleene closure of an FST.\n\n Usage: ";
34 usage += " [in.fst [out.fst]]\n";
46 MutableFstClass *fst = MutableFstClass::Read(in_fname, true); local
47 if (!fst) return 1;
49 fst::ClosureType closure_type
    [all...]
fstproject.cc 23 #include <fst/script/project.h>
28 namespace s = fst::script;
29 using fst::script::FstClass;
30 using fst::script::MutableFstClass;
35 usage += " [in.fst [out.fst]]\n";
47 MutableFstClass *fst = MutableFstClass::Read(in_name, true); local
48 if (!fst) return 1;
50 fst::ProjectType project_type = FLAGS_project_output ?
51 fst::PROJECT_OUTPUT : fst::PROJECT_INPUT
    [all...]
  /external/openfst/src/include/fst/extensions/far/
farlib.h 24 #include <fst/extensions/far/far.h>
25 #include <fst/extensions/far/compile-strings.h>
26 #include <fst/extensions/far/create.h>
27 #include <fst/extensions/far/extract.h>
28 #include <fst/extensions/far/info.h>
29 #include <fst/extensions/far/print-strings.h>
  /external/ipsec-tools/src/racoon/missing/crypto/rijndael/
rijndael.h 5 #include <crypto/rijndael/rijndael-api-fst.h>
  /external/openfst/src/include/fst/
closure.h 19 // Functions and classes to compute the concatenative closure of an Fst.
28 #include <fst/mutable-fst.h>
29 #include <fst/rational.h>
32 namespace fst { namespace
35 // MutableFst input. If FST transduces string x to y with weight a,
46 void Closure(MutableFst<Arc> *fst, ClosureType closure_type) {
51 uint64 props = fst->Properties(kFstProperties, false);
52 StateId start = fst->Start();
53 for (StateIterator< MutableFst<Arc> > siter(*fst);
    [all...]
  /external/openfst/src/include/fst/extensions/pdt/
pdtlib.h 18 // encoded as an FST, where some transitions are labeled with open or close
25 #include <fst/extensions/pdt/pdt.h>
26 #include <fst/extensions/pdt/compose.h>
27 #include <fst/extensions/pdt/expand.h>
28 #include <fst/extensions/pdt/replace.h>

Completed in 333 milliseconds

12 3 4 5 6 7 8 91011>>