| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| 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...] |
| determinize.h | 18 // Functions and classes to determinize an FST.
31 #include "fst/lib/cache.h"
32 #include "fst/lib/factor-weight.h"
33 #include "fst/lib/map.h"
34 #include "fst/lib/test-properties.h"
36 namespace fst { namespace
135 DeterminizeFstImplBase(const Fst<A> &fst, const CacheOptions &opts)
136 : CacheImpl<A>(opts), fst_(fst.Copy()) {
138 uint64 props = fst.Properties(kFstProperties, false)
[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...] |
| map.h | 23 #include "fst/lib/cache.h"
24 #include "fst/lib/mutable-fst.h"
26 namespace fst { namespace
43 // not the empty Fst).
58 // // This specifies the known properties of an Fst mapped by this
59 // // mapper. It takes as argument the input Fst's known properties.
66 // method to set the result Fst properties.
70 // new result Fst, or is an on-the-fly Fst. Another dimension is ho
[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...] |
| test-properties.h | 26 #include "fst/lib/connect.h"
27 #include "fst/lib/dfs-visit.h"
28 #include "fst/lib/mutable-fst.h"
32 namespace fst { namespace
62 // Computes FST property values defined in properties.h. The value of
70 // If 'use_stored' is true, pre-computed FST properties may be used
72 // is used to implement fst.Properties(mask, true).
74 uint64 ComputeProperties(const Fst<Arc> &fst, uint64 mask, uint64 *known
[all...] |
| factor-weight.h | 18 // Classes to factor weights in an FST.
30 #include "fst/lib/cache.h"
31 #include "fst/lib/test-properties.h"
33 namespace fst { namespace
162 FactorWeightFstImpl(const Fst<A> &fst, const FactorWeightOptions &opts)
163 : CacheImpl<A>(opts), fst_(fst.Copy()), delta_(opts.delta),
166 uint64 props = fst.Properties(kFstProperties, false);
169 SetInputSymbols(fst.InputSymbols());
170 SetOutputSymbols(fst.OutputSymbols())
[all...] |
| synchronize.h | 18 // Synchronize an FST with bounded delay.
28 #include "fst/lib/cache.h"
29 #include "fst/lib/test-properties.h"
31 namespace fst { namespace
72 SynchronizeFstImpl(const Fst<A> &fst, const SynchronizeFstOptions &opts)
73 : CacheImpl<A>(opts), fst_(fst.Copy()) {
75 uint64 props = fst.Properties(kFstProperties, false);
78 SetInputSymbols(fst.InputSymbols());
79 SetOutputSymbols(fst.OutputSymbols())
[all...] |
| const-fst.h | 1 // const-fst.h
17 // Simple concrete immutable FST whose states and arcs are each stored
23 #include "fst/lib/expanded-fst.h"
24 #include "fst/lib/test-properties.h"
26 namespace fst { namespace
49 explicit ConstFstImpl(const Fst<A> &fst);
99 // Properties always true of this Fst class
111 size_t narcs_; // Number of arcs (per FST)
[all...] |
| fst.h | 0 // fst.h
17 // Finite-State Transducer (FST) - abstract base class definition,
23 #include "fst/lib/arc.h"
24 #include "fst/lib/compat.h"
25 #include "fst/lib/properties.h"
26 #include "fst/lib/register.h"
27 #include "fst/lib/symbol-table.h"
28 #include "fst/lib/util.h"
30 namespace fst { namespace
38 const FstHeader *header; // Pointer to Fst header (if non-zero
[all...] |
| mutable-fst.h | 1 // mutable-fst.h
17 // Expanded FST augmented with mutators - interface class definition
25 #include "fst/lib/expanded-fst.h"
27 namespace fst { namespace
31 // An expanded FST plus mutators (use MutableArcIterator to modify arcs).
39 virtual MutableFst<A> &operator=(const Fst<A> &fst) = 0;
89 LOG(ERROR) << "MutableFst::Read: Unknown FST type \"" << hdr.FstType()
94 Fst<A> *fst = reader(strm, ropts) local
[all...] |
| rmepsilon.h | 28 #include "fst/lib/arcfilter.h"
29 #include "fst/lib/cache.h"
30 #include "fst/lib/connect.h"
31 #include "fst/lib/factor-weight.h"
32 #include "fst/lib/invert.h"
33 #include "fst/lib/map.h"
34 #include "fst/lib/queue.h"
35 #include "fst/lib/shortest-distance.h"
36 #include "fst/lib/topsort.h"
38 namespace fst { namespace
[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...] |
| 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...] |
| 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...] |
| shortest-path.h | 18 // Functions to find shortest paths in an FST.
25 #include "fst/lib/cache.h"
26 #include "fst/lib/queue.h"
27 #include "fst/lib/shortest-distance.h"
28 #include "fst/lib/test-properties.h"
30 namespace fst { namespace
61 void SingleShortestPath(const Fst<Arc> &ifst,
112 for (ArcIterator< Fst<Arc> > aiter(ifst, s);
228 void ShortestPath(const Fst<Arc> &ifst, MutableFst<Arc> *ofst,
255 // Algorithm works on the reverse of 'fst' : 'rfst' 'distance' i
[all...] |
| queue.h | 18 // Functions and classes for various Fst state queues with
27 #include "fst/lib/arcfilter.h"
28 #include "fst/lib/connect.h"
29 #include "fst/lib/heap.h"
30 #include "fst/lib/topsort.h"
32 namespace fst { namespace
39 // // Ctr: may need args (e.g., Fst, comparator) for some queues
280 // States are ordered in the queue topologically. The FST must be acyclic.
291 TopOrderQueue(const Fst<Arc> &fst, ArcFilter filter
[all...] |
| connect.h | 17 // Classes and functions to remove unsuccessful paths from an Fst.
22 #include "fst/lib/mutable-fst.h"
24 namespace fst { namespace
50 void InitVisit(const Fst<A> &fst) {
64 fst_ = &fst;
65 start_ = fst.Start();
182 const Fst<A> *fst_;
194 // Trims an FST, removing states and arcs that are not on successfu
[all...] |
| encode.h | 17 // Class to encode and decoder an fst.
22 #include "fst/lib/map.h"
23 #include "fst/lib/rmfinalepsilon.h"
25 namespace fst { namespace
188 // Fst is useful for performing classical determinization or minimization
320 void Encode(MutableFst<A> *fst, EncodeMapper<A>* mapper) {
321 Map(fst, mapper);
326 void Decode(MutableFst<A>* fst, const EncodeMapper<A>& mapper) {
327 Map(fst, EncodeMapper<A>(mapper, DECODE));
328 RmFinalEpsilon(fst);
[all...] |
| vector-fst.h | 1 // vector-fst.h
17 // Simple concrete, mutable FST whose states and arcs are stored in STL
26 #include "fst/lib/mutable-fst.h"
27 #include "fst/lib/test-properties.h"
29 namespace fst { namespace
34 // State definition. This does not manage the Fst properties.
174 // manages Fst properties and the # of input and output epsilons.
196 explicit VectorFstImpl(const Fst<A> &fst);
[all...] |
| /external/srec/tools/grxmlcompile/ |
| grxmlcompile.cpp | 24 #include "fst/lib/fst.h"
25 #include "fst/lib/fstlib.h"
26 #include "fst/lib/arc.h"
27 #include "fst/lib/fst-decl.h"
28 #include "fst/lib/vector-fst.h"
29 #include "fst/lib/arcsort.h"
30 #include "fst/lib/invert.h
[all...] |
