| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| arcfilter.h | 17 // Function objects to restrict which arcs are traversed in an FST.
22 namespace fst { namespace
41 } // namespace fst
|
| fst.cpp | 0 // fst.cc
17 // FST definitions.
19 #include "fst/lib/fst.h"
22 #include "fst/lib/const-fst.h"
23 #include "fst/lib/vector-fst.h"
25 // FST flag definitions
28 "Verify fst properties queried by TestProperties")
39 namespace fst { namespace
[all...] |
| epsnormalize.h | 28 #include "fst/lib/factor-weight.h"
29 #include "fst/lib/invert.h"
30 #include "fst/lib/map.h"
31 #include "fst/lib/rmepsilon.h"
33 namespace fst { namespace
37 // Returns an equivalent FST that is epsilon-normalized. An acceptor is
43 // The input FST needs to be functional.
50 void EpsNormalize(const Fst<Arc> &ifst, MutableFst<Arc> *ofst,
68 } // namespace fst
|
| util.h | 17 // FST utility inline definitions.
24 namespace fst { namespace
67 } // namespace fst;
|
| push.h | 18 // Class to reweight/push an FST.
23 #include "fst/lib/factor-weight.h"
24 #include "fst/lib/fst.h"
25 #include "fst/lib/map.h"
26 #include "fst/lib/reweight.h"
27 #include "fst/lib/shortest-distance.h"
29 namespace fst { namespace
31 // Pushes the weights in FST in the direction defined by TYPE. If
41 void Push(MutableFst<Arc> *fst, ReweightType type)
[all...] |
| 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...] |
| arcsum.h | 17 // Functions to sum arcs (sum weights) in an fst.
22 #include "fst/lib/mutable-fst.h"
23 #include "fst/lib/weight.h"
25 namespace fst { namespace
57 void ArcSum(MutableFst<A>* fst) {
61 for (StateIterator<Fst<A> > siter(*fst); !siter.Done(); siter.Next()) {
63 if (fst->NumArcs(s) == 0) continue;
67 arcs.reserve(fst->NumArcs(s))
[all...] |
| equal.h | 22 #include "fst/lib/fst.h"
24 namespace fst { namespace
28 bool Equal(const Fst<Arc> &fst1, const Fst<Arc> &fst2) {
37 StateIterator< Fst<Arc> > siter1(fst1);
38 StateIterator< Fst<Arc> > siter2(fst2);
62 ArcIterator< Fst<Arc> > aiter1(fst1, s1);
63 ArcIterator< Fst<Arc> > aiter2(fst2, s2);
116 } // namespace fst
[all...] |
| expanded-fst.h | 1 // expanded-fst.h
17 // Generic FST augmented with state count - interface class definition.
22 #include "fst/lib/fst.h"
24 namespace fst { namespace
26 // A generic FST plus state count.
28 class ExpandedFst : public Fst<A> {
56 LOG(ERROR) << "ExpandedFst::Read: Unknown FST type \"" << hdr.FstType()
61 Fst<A> *fst = reader(strm, ropts) local
[all...] |
| invert.h | 17 // Functions and classes to invert an Fst.
22 #include "fst/lib/map.h"
23 #include "fst/lib/mutable-fst.h"
25 namespace fst { namespace
41 // Inverts the transduction corresponding to an FST by exchanging the
42 // FST's input and output labels. This version modifies its input.
49 void Invert(MutableFst<Arc> *fst) { Map(fst, InvertMapper<Arc>()); }
52 // Inverts the transduction corresponding to an FST by exchanging th
[all...] |
| reverse.h | 17 // Functions and classes to sort arcs in an FST.
22 #include "fst/lib/cache.h"
24 namespace fst { namespace
26 // Reverses an FST. The reversed result is written to an output
36 void Reverse(const Fst<Arc> &ifst, MutableFst<RevArc> *ofst) {
48 for (StateIterator< Fst<Arc> > siter(ifst);
64 for (ArcIterator< Fst<Arc> > aiter(ifst, is);
80 } // namespace fst
|
| rmfinalepsilon.h | 25 #include "fst/lib/connect.h"
26 #include "fst/lib/mutable-fst.h"
28 namespace fst { namespace
31 void RmFinalEpsilon(MutableFst<A>* fst) {
40 DfsVisit(*fst, &scc_visitor);
46 for (StateIterator<Fst<A> > siter(*fst); !siter.Done(); siter.Next()) {
48 if (fst->Final(s) != Weight::Zero()) {
50 for (ArcIterator<Fst<A> > aiter(*fst, s); !aiter.Done(); aiter.Next())
[all...] |
| statesort.h | 17 // Function to sort states of an Fst.
24 #include "fst/lib/mutable-fst.h"
26 namespace fst { namespace
28 // Sorts the input states of an FST, modifying it. ORDER[i] gives the
30 // sorting. ORDER must be a permutation of FST's states ID sequence:
31 // (1, 2, ..., fst->NumStates() - 1).
33 void StateSort(MutableFst<Arc> *fst,
38 CHECK_EQ(order.size(), fst->NumStates());
40 if (fst->Start() == kNoStateId
[all...] |
| union-find.h | 26 namespace fst { namespace
|
| verify.h | 22 #include "fst/lib/fst.h"
23 #include "fst/lib/test-properties.h"
25 namespace fst { namespace
27 // Verifies that an Fst's contents are sane.
29 bool Verify(const Fst<Arc> &fst) {
34 StateId start = fst.Start();
35 const SymbolTable *isyms = fst.InputSymbols();
36 const SymbolTable *osyms = fst.OutputSymbols()
[all...] |
| arc.h | 17 // Commonly used Fst arc types.
22 #include "fst/lib/float-weight.h"
23 #include "fst/lib/product-weight.h"
24 #include "fst/lib/string-weight.h"
26 namespace fst { namespace
163 } // namespace fst;
|
| closure.h | 17 // Functions and classes to compute the concatenative closure of an Fst.
22 #include "fst/lib/mutable-fst.h"
23 #include "fst/lib/rational.h"
25 namespace fst { namespace
28 // MutableFst input. If FST transduces string x to y with weight a,
39 void Closure(MutableFst<Arc> *fst, ClosureType closure_type) {
44 uint64 props = fst->Properties(kFstProperties, false);
45 StateId start = fst->Start();
46 for (StateIterator< MutableFst<Arc> > siter(*fst);
[all...] |
| difference.h | 22 #include "fst/lib/compose.h"
23 #include "fst/lib/complement.h"
25 namespace fst { namespace
33 // Fst. Only strings that are in the first automaton but not in second
53 DifferenceFst(const Fst<A> &fst1, const Fst<A> &fst2)
66 DifferenceFst(const Fst<A> &fst1, const Fst<A> &fst2,
79 DifferenceFst(const DifferenceFst<A> &fst)
80 : ComposeFst<A>(fst) {}
[all...] |
| fst-decl.h | 0 // fst-decl.h
22 namespace fst { namespace
35 template <class A> class Fst;
59 typedef Fst<StdArc> StdFst;
|
| intersect.h | 22 #include "fst/lib/compose.h"
24 namespace fst { namespace
31 // version is a delayed Fst. Only strings that are in both automata
49 IntersectFst(const Fst<A> &fst1, const Fst<A> &fst2)
60 IntersectFst(const Fst<A> &fst1, const Fst<A> &fst2,
71 IntersectFst(const IntersectFst<A> &fst) : ComposeFst<A>(fst) {}
84 explicit StateIterator(const IntersectFst<A> &fst)
[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...] |
| prune.h | 23 #include "fst/lib/arcfilter.h"
24 #include "fst/lib/shortest-distance.h"
26 namespace fst { namespace
51 // options class as an argment. Delete states and arcs in 'fst' that
56 void Prune(MutableFst<Arc> *fst,
67 StateId ns = fst->NumStates();
75 ShortestDistance(*fst, idistance, false);
82 ShortestDistance(*fst, fdistance, true);
88 dead.push_back(fst->AddState());
90 Weight ceiling = Times((*fdistance)[fst->Start()], opts.threshold)
[all...] |
| topsort.h | 25 #include "fst/lib/dfs-visit.h"
26 #include "fst/lib/fst.h"
27 #include "fst/lib/statesort.h"
29 namespace fst { namespace
39 // otherwise unchanged. ACYCLIC will be true iff the FST has
44 void InitVisit(const Fst<A> &fst) {
86 bool TopSort(MutableFst<Arc> *fst) {
93 DfsVisit(*fst, &top_order_visitor)
[all...] |
| weight.h | 73 #include "fst/lib/compat.h"
75 #include "fst/lib/util.h"
77 namespace fst { namespace
137 } // namespace fst;
|
| concat.h | 24 #include "fst/lib/mutable-fst.h"
25 #include "fst/lib/rational.h"
27 namespace fst { namespace
37 // where Vi = # of states and Ei = # of arcs of the ith FST.
39 void Concat(MutableFst<Arc> *fst1, const Fst<Arc> &fst2) {
53 for (StateIterator< Fst<Arc> > siter2(fst2);
59 for (ArcIterator< Fst<Arc> > aiter(fst2, s2);
85 void Concat(RationalFst<Arc> *fst1, const Fst<Arc> &fst2) {
94 // delayed Fst. If FST1 transduces string x to y with weight a and FST
[all...] |
