| /external/openfst/src/include/fst/ |
| statesort.h | 19 // Function to sort states of an Fst.
28 #include <fst/mutable-fst.h>
31 namespace fst { namespace
33 // Sorts the input states of an FST, modifying it. ORDER[i] gives the
35 // sorting. ORDER must be a permutation of FST's states ID sequence:
36 // (0, 1, 2, ..., fst->NumStates() - 1).
38 void StateSort(MutableFst<Arc> *fst,
43 if (order.size() != fst->NumStates()) {
45 fst->SetProperties(kError, kError)
[all...] |
| rmfinalepsilon.h | 30 #include <fst/connect.h>
31 #include <fst/mutable-fst.h>
34 namespace fst { namespace
37 void RmFinalEpsilon(MutableFst<A>* fst) {
46 DfsVisit(*fst, &scc_visitor);
52 for (StateIterator<Fst<A> > siter(*fst); !siter.Done(); siter.Next()) {
54 if (fst->Final(s) != Weight::Zero()) {
56 for (ArcIterator<Fst<A> > aiter(*fst, s); !aiter.Done(); aiter.Next())
[all...] |
| expanded-fst.h | 1 // expanded-fst.h
19 // Generic FST augmented with state count - interface class definition.
28 #include <fst/fst.h>
31 namespace fst { namespace
33 // A generic FST plus state count.
35 class ExpandedFst : public Fst<A> {
42 // Get a copy of this ExpandedFst. See Fst<>::Copy() for further doc.
64 LOG(ERROR) << "ExpandedFst::Read: Unknown FST type \"" << hdr.FstType()
69 Fst<A> *fst = reader(strm, ropts) local
[all...] |
| topsort.h | 29 #include <fst/dfs-visit.h>
30 #include <fst/fst.h>
31 #include <fst/statesort.h>
34 namespace fst { namespace
44 // otherwise unchanged. ACYCLIC will be true iff the FST has
49 void InitVisit(const Fst<A> &fst) {
91 bool TopSort(MutableFst<Arc> *fst) {
98 DfsVisit(*fst, &top_order_visitor)
[all...] |
| /external/openfst/src/test/ |
| algo_test.cc | 19 // Regression test for various FST algorithms.
39 using fst::StdArc;
40 using fst::TropicalWeightGenerator;
42 using fst::LogArc;
43 using fst::LogWeightGenerator;
45 using fst::MinMaxArc;
46 using fst::MinMaxWeightGenerator;
48 using fst::StringArc;
49 using fst::StringWeightGenerator;
50 using fst::STRING_LEFT
[all...] |
| fst_test.h | 19 // Regression test for FST classes.
24 #include <fst/equal.h>
25 #include <fst/matcher.h>
26 #include <fst/vector-fst.h>
27 #include <fst/verify.h>
31 namespace fst { namespace
33 // This tests an Fst F that is assumed to have a copy method from an
34 // arbitrary Fst. Some test functions make further assumptions mostly
36 // functions that take a test fst as its argument so that differen
[all...] |
| weight_test.cc | 19 // Regression test for Fst weights.
24 #include <fst/expectation-weight.h>
25 #include <fst/float-weight.h>
26 #include <fst/random-weight.h>
32 using fst::TropicalWeight;
33 using fst::TropicalWeightGenerator;
34 using fst::TropicalWeightTpl;
35 using fst::TropicalWeightGenerator_;
37 using fst::LogWeight;
38 using fst::LogWeightGenerator
[all...] |
| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| reweight.h | 18 // Function to reweight an FST.
23 #include "fst/lib/mutable-fst.h"
25 namespace fst { namespace
29 // Reweight FST according to the potentials defined by the POTENTIAL
39 void Reweight(MutableFst<Arc> *fst, vector<typename Arc::Weight> potential,
43 if (!fst->NumStates())
45 while ( (int64)potential.size() < (int64)fst->NumStates())
58 for (StateIterator< MutableFst<Arc> > sit(*fst);
62 for (MutableArcIterator< MutableFst<Arc> > ait(fst, state)
[all...] |
| project.h | 17 // Functions and classes to project an Fst on to its domain or range.
22 #include "fst/lib/map.h"
23 #include "fst/lib/mutable-fst.h"
25 namespace fst { namespace
54 // Projects an FST onto its domain or range by either copying each arcs'
63 void Project(MutableFst<Arc> *fst, ProjectType project_type) {
64 Map(fst, ProjectMapper<Arc>(project_type));
68 // Projects an FST onto its domain or range by either copying each arc's
70 // Fst
[all...] |
| /external/openfst/src/bin/ |
| fstreverse.cc | 20 // Reverses the paths in an FST.
25 #include <fst/script/reverse.h>
26 #include <fst/script/fst-class.h>
32 using fst::script::FstClass;
33 using fst::script::VectorFstClass;
34 using fst::script::Reverse;
36 string usage = "Reverses the paths in an FST.\n\n Usage: ";
38 usage += " [in.fst [out.fst]]\n"
[all...] |
| fstdraw.cc | 22 #include <fst/script/draw.h>
46 namespace s = fst::script;
47 using fst::ostream;
48 using fst::SymbolTable;
52 usage += " [binary.fst [text.dot]]\n";
63 s::FstClass *fst = s::FstClass::Read(in_name); local
64 if (!fst) return 1;
70 ostrm = new fst::ofstream(argv[2]);
80 fst::SymbolTableTextOptions opts;
99 isyms = fst->InputSymbols()
[all...] |
| fstprint.cc | 23 #include <fst/script/print.h>
38 namespace s = fst::script;
39 using fst::ostream;
40 using fst::SymbolTable;
44 usage += " [binary.fst [text.fst]]\n";
56 s::FstClass *fst = s::FstClass::Read(in_name); local
57 if (!fst) return 1;
63 ostrm = new fst::ofstream(argv[2]);
73 fst::SymbolTableTextOptions opts
[all...] |
| fstdeterminize.cc | 20 // Determinizes an FST.
23 #include <fst/script/determinize.h>
25 DEFINE_double(delta, fst::kDelta, "Comparison/quantization delta");
26 DEFINE_int64(nstate, fst::kNoStateId, "State number threshold");
33 namespace s = fst::script;
34 using fst::script::FstClass;
35 using fst::script::MutableFstClass;
36 using fst::script::VectorFstClass;
37 using fst::script::WeightClass;
39 string usage = "Determinizes an FST.\n\n Usage: "
[all...] |
| /external/openfst/src/include/fst/script/ |
| convert.h | 22 #include <fst/script/arg-packs.h>
23 #include <fst/script/fst-class.h>
25 namespace fst { namespace
33 const Fst<Arc> &fst = *(args->args.arg1.GetFst<Arc>()); local
36 Fst<Arc> *result = Convert(fst, new_type);
47 } // namespace fst
|
| encode.h | 22 #include <fst/script/arg-packs.h>
23 #include <fst/script/fst-class.h>
24 #include <fst/encode.h>
26 namespace fst { namespace
50 void Encode(MutableFstClass *fst, uint32 flags, bool reuse_encoder,
54 } // namespace fst
|
| map.h | 20 #include <fst/script/arg-packs.h>
21 #include <fst/script/fst-class.h>
22 #include <fst/script/weight-class.h>
23 #include <fst/arc-map.h>
24 #include <fst/state-map.h>
26 namespace fst { namespace
30 Fst<typename M::ToArc> *ArcMap(const Fst<typename M::FromArc> &fst,
62 Fst<Arc> *fst = NULL; local
[all...] |
| push.h | 20 #include <fst/script/arg-packs.h>
21 #include <fst/script/fst-class.h>
22 #include <fst/push.h>
24 namespace fst { namespace
35 fst::Push(ofst, REWEIGHT_TO_FINAL, args->arg3, args->arg4);
37 fst::Push(ofst, REWEIGHT_TO_INITIAL, args->arg3, args->arg4);
47 const Fst<Arc> &ifst = *(args->arg1.GetFst<Arc>());
51 fst::Push<Arc, REWEIGHT_TO_FINAL>(ifst, ofst, args->arg3, args->arg5);
53 fst::Push<Arc, REWEIGHT_TO_INITIAL>(ifst, ofst, args->arg3, args->arg5)
[all...] |
| rmepsilon.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/script/shortest-distance.h> // for ShortestDistanceOptions
27 #include <fst/rmepsilon.h>
28 #include <fst/queue.h>
33 %include "nlp/fst/script/shortest-distance.h"
37 namespace fst { namespace
44 struct RmEpsilonOptions : public fst::script::ShortestDistanceOptions
159 MutableFst<Arc> *fst = args->arg1->GetMutableFst<Arc>(); local
171 MutableFst<Arc> *fst = args->arg1->GetMutableFst<Arc>(); local
[all...] |
| shortest-distance.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/script/prune.h> // for ArcFilterType
27 #include <fst/queue.h> // for QueueType
28 #include <fst/shortest-distance.h>
30 namespace fst { namespace
36 // See nlp/fst/lib/shortest-distance.h for the template options class
60 static Queue *Construct(const Fst<Arc> &
103 const Fst<Arc> &fst = *(args->arg1.GetFst<Arc>()); local
206 const Fst<Arc> &fst = *(args->arg1.GetFst<Arc>()); local
226 const Fst<Arc> &fst = *(args->args.GetFst<Arc>()); local
[all...] |
| /external/openfst/src/extensions/far/ |
| farcompilestrings.cc | 24 #include <fst/extensions/far/farscript.h>
25 #include <fst/extensions/far/main.h>
35 "FAR file format type: one of: \"default\", \"fst\", "
41 "\"file\" (one FST per file), \"line\" (one FST per line)");
42 DEFINE_string(fst_type, "vector", "Output FST type");
53 " Fst in archive.");
56 namespace s = fst::script;
75 fst::FarEntryType fet = fst::StringToFarEntryType(FLAGS_entry_type)
[all...] |
| stlist.cc | 17 #include <fst/extensions/far/stlist.h>
19 namespace fst { namespace
31 } // namespace fst
|
| strings.cc | 17 #include <fst/extensions/far/compile-strings.h>
25 namespace fst { namespace
40 } // namespace fst
|
| sttable.cc | 17 #include <fst/extensions/far/sttable.h>
19 namespace fst { namespace
31 } // namespace fst
|
| /external/openfst/src/extensions/pdt/ |
| pdtshortestpath.cc | 23 #include <fst/extensions/pdt/pdtscript.h>
24 #include <fst/util.h>
34 namespace s = fst::script;
38 usage += " in.pdt [out.fst]\n";
59 fst::ReadLabelPairs(FLAGS_pdt_parentheses, &parens, false);
63 fst::QueueType qt;
66 qt = fst::FIFO_QUEUE;
68 qt = fst::LIFO_QUEUE;
70 qt = fst::STATE_ORDER_QUEUE;
|
| /external/openfst/src/include/fst/extensions/far/ |
| main.h | 25 #include <fst/extensions/far/far.h>
27 namespace fst { namespace
41 } // namespace fst
|
