Home
last modified time | relevance | path

Searched refs:fst1 (Results 1 – 25 of 28) sorted by relevance

12

/external/openfst/src/include/fst/
Dconcat.h47 void Concat(MutableFst<Arc> *fst1, const Fst<Arc> &fst2) { in Concat() argument
54 if (!CompatSymbols(fst1->InputSymbols(), fst2.InputSymbols()) || in Concat()
55 !CompatSymbols(fst1->OutputSymbols(), fst2.OutputSymbols())) { in Concat()
62 uint64 props1 = fst1->Properties(kFstProperties, false); in Concat()
65 StateId start1 = fst1->Start(); in Concat()
67 if (props2 & kError) fst1->SetProperties(kError, kError); in Concat()
71 StateId numstates1 = fst1->NumStates(); in Concat()
73 fst1->ReserveStates(numstates1 + CountStates(fst2)); in Concat()
78 StateId s1 = fst1->AddState(); in Concat()
80 fst1->SetFinal(s1, fst2.Final(s2)); in Concat()
[all …]
Dunion.h44 void Union(MutableFst<Arc> *fst1, const Fst<Arc> &fst2) { in Union() argument
51 if (!CompatSymbols(fst1->InputSymbols(), fst2.InputSymbols()) || in Union()
52 !CompatSymbols(fst1->OutputSymbols(), fst2.OutputSymbols())) { in Union()
59 StateId numstates1 = fst1->NumStates(); in Union()
60 bool initial_acyclic1 = fst1->Properties(kInitialAcyclic, true); in Union()
61 uint64 props1 = fst1->Properties(kFstProperties, false); in Union()
66 if (props2 & kError) fst1->SetProperties(kError, kError); in Union()
71 fst1->ReserveStates( in Union()
78 StateId s1 = fst1->AddState(); in Union()
80 fst1->SetFinal(s1, fst2.Final(s2)); in Union()
[all …]
Drational.h44 template <class A> void Union(RationalFst<A> *fst1, const Fst<A> &fst2);
45 template <class A> void Concat(RationalFst<A> *fst1, const Fst<A> &fst2);
46 template <class A> void Concat(const Fst<A> &fst1, RationalFst<A> *fst2);
120 void InitUnion(const Fst<A> &fst1, const Fst<A> &fst2) { in InitUnion() argument
123 uint64 props1 = fst1.Properties(kFstProperties, false); in InitUnion()
125 SetInputSymbols(fst1.InputSymbols()); in InitUnion()
126 SetOutputSymbols(fst1.OutputSymbols()); in InitUnion()
131 rfst_.SetInputSymbols(fst1.InputSymbols()); in InitUnion()
132 rfst_.SetOutputSymbols(fst1.OutputSymbols()); in InitUnion()
136 fst_tuples_.push_back(make_pair(-1, fst1.Copy())); in InitUnion()
[all …]
Dequal.h31 bool Equal(const Fst<Arc> &fst1, const Fst<Arc> &fst2, float delta = kDelta) {
35 if (fst1.Start() != fst2.Start()) {
40 StateIterator< Fst<Arc> > siter1(fst1);
56 Weight final1 = fst1.Final(s1);
65 ArcIterator< Fst<Arc> > aiter1(fst1, s1);
109 if (fst1.NumArcs(s1) != fst2.NumArcs(s2) ||
110 fst1.NumInputEpsilons(s1) != fst2.NumInputEpsilons(s2) ||
111 fst1.NumOutputEpsilons(s1) != fst2.NumOutputEpsilons(s2)) {
Dequivalent.h130 bool Equivalent(const Fst<Arc> &fst1,
137 if (!CompatSymbols(fst1.InputSymbols(), fst2.InputSymbols()) ||
138 !CompatSymbols(fst1.OutputSymbols(), fst2.OutputSymbols())) {
146 if (fst1.Properties(props, true) != props) {
159 if ((fst1.Properties(kUnweighted , true) != kUnweighted)
161 VectorFst<Arc> efst1(fst1);
179 MappedId s1 = Util::MapState(fst1.Start(), FST1);
204 if (Util::IsFinal(fst1, s1) != Util::IsFinal(fst2, s2)) {
226 ArcIterator<Fst<Arc> > arc_iter(fst1, Util::UnMapState(s1));
255 if (Util::IsFinal(fst1, p.first) != Util::IsFinal(fst2, p.second)) {
[all …]
Drandequivalent.h44 bool RandEquivalent(const Fst<Arc> &fst1, const Fst<Arc> &fst2,
52 if (!CompatSymbols(fst1.InputSymbols(), fst2.InputSymbols()) ||
53 !CompatSymbols(fst1.OutputSymbols(), fst2.OutputSymbols())) {
63 VectorFst<Arc> sfst1(fst1);
109 if (fst1.Properties(kError, false) || fst2.Properties(kError, false)) {
122 bool RandEquivalent(const Fst<Arc> &fst1, const Fst<Arc> &fst2,
129 return RandEquivalent(fst1, fst2, num_paths, delta, opts, error);
Ddifference.h72 DifferenceFst(const Fst<A> &fst1, const Fst<A> &fst2,
78 new R(fst1, MATCH_NONE),
81 SetImpl(CreateBase1(fst1, cfst, copts));
83 if (!fst1.Properties(kAcceptor, true)) {
90 DifferenceFst(const Fst<A> &fst1, const Fst<A> &fst2, in DifferenceFst() argument
96 copts.matcher1 = new R(fst1, MATCH_NONE, kNoLabel, MATCHER_REWRITE_ALWAYS, in DifferenceFst()
101 SetImpl(CreateBase1(fst1, cfst, copts)); in DifferenceFst()
103 if (!fst1.Properties(kAcceptor, true)) { in DifferenceFst()
Dcompose.h123 ComposeFstImplBase(const Fst<A> &fst1, const Fst<A> &fst2, in ComposeFstImplBase() argument
129 if (!CompatSymbols(fst2.InputSymbols(), fst1.OutputSymbols())) { in ComposeFstImplBase()
135 SetInputSymbols(fst1.InputSymbols()); in ComposeFstImplBase()
222 ComposeFstImpl(const FST1 &fst1, const FST2 &fst2,
388 const FST1 &fst1, const FST2 &fst2, in ComposeFstImpl() argument
390 : ComposeFstImplBase<Arc>(fst1, fst2, opts), in ComposeFstImpl()
392 new F(fst1, fst2, opts.matcher1, opts.matcher2)), in ComposeFstImpl()
408 uint64 fprops1 = fst1.Properties(kFstProperties, false); in ComposeFstImpl()
516 ComposeFst(const Fst<A> &fst1, const Fst<A> &fst2,
518 : ImplToFst<Impl>(CreateBase(fst1, fst2, opts)) {} in CreateBase() argument
[all …]
Dintersect.h70 IntersectFst(const Fst<A> &fst1, const Fst<A> &fst2,
72 bool acceptors = fst1.Properties(kAcceptor, true) &&
74 SetImpl(CreateBase(fst1, fst2, opts));
82 IntersectFst(const Fst<A> &fst1, const Fst<A> &fst2, in IntersectFst() argument
84 bool acceptors = fst1.Properties(kAcceptor, true) && in IntersectFst()
86 SetImpl(CreateBase1(fst1, fst2, opts)); in IntersectFst()
Dstate-table.h276 GenericComposeStateTable(const Fst<A> &fst1, const Fst<A> &fst2) {} in GenericComposeStateTable() argument
279 GenericComposeStateTable(const Fst<A> &fst1, const Fst<A> &fst2, in GenericComposeStateTable() argument
358 ProductComposeStateTable(const Fst<A> &fst1, const Fst<A> &fst2,
360 : StateTable(new ComposeFingerprint<StateId, F>(CountStates(fst1), in StateTable() argument
391 StringDetComposeStateTable(const Fst<A> &fst1, const Fst<A> &fst2) in StringDetComposeStateTable() argument
395 if (fst1.Properties(props1, true) != props1 || in StringDetComposeStateTable()
433 DetStringComposeStateTable(const Fst<A> &fst1, const Fst<A> &fst2) in DetStringComposeStateTable() argument
437 if (fst1.Properties(props1, true) != props1 || in DetStringComposeStateTable()
471 ErasableComposeStateTable(const Fst<A> &fst1, const Fst<A> &fst2) {} in ErasableComposeStateTable() argument
Dcompose-filter.h220 SequenceComposeFilter(const FST1 &fst1, const FST2 &fst2,
222 : matcher1_(matcher1 ? matcher1 : new M1(fst1, MATCH_OUTPUT)),
305 AltSequenceComposeFilter(const FST1 &fst1, const FST2 &fst2,
307 : matcher1_(matcher1 ? matcher1 : new M1(fst1, MATCH_OUTPUT)),
391 MatchComposeFilter(const FST1 &fst1, const FST2 &fst2,
393 : matcher1_(matcher1 ? matcher1 : new M1(fst1, MATCH_OUTPUT)),
494 MultiEpsFilter(const FST1 &fst1, const FST2 &fst2,
497 : filter_(fst1, fst2, matcher1, matcher2), in filter_() argument
Dlookahead-filter.h61 MatchType LookAheadMatchType(const Fst<Arc> &fst1, const Fst<Arc> &fst2) { in LookAheadMatchType() argument
62 LookAheadMatcher< Fst <Arc> > matcher1(fst1, MATCH_OUTPUT); in LookAheadMatchType()
211 LookAheadComposeFilter(const FST1 &fst1, const FST2 &fst2, in LookAheadComposeFilter() argument
213 : filter_(fst1, fst2, matcher1, matcher2), in LookAheadComposeFilter()
345 PushWeightsComposeFilter(const FST1 &fst1, const FST2 &fst2, in PushWeightsComposeFilter() argument
347 : filter_(fst1, fst2, matcher1, matcher2), in PushWeightsComposeFilter()
439 PushLabelsComposeFilter(const FST1 &fst1, const FST2 &fst2, in PushLabelsComposeFilter() argument
441 : filter_(fst1, fst2, matcher1, matcher2), in PushLabelsComposeFilter()
/external/openfst/src/script/
Drandequivalent.cc25 bool RandEquivalent(const FstClass &fst1, const FstClass &fst2, in RandEquivalent() argument
28 if (!ArcTypesMatch(fst1, fst2, "RandEquivalent")) return false; in RandEquivalent()
29 RandEquivalentInnerArgs1 args(fst1, fst2, seed, num_paths, delta, in RandEquivalent()
33 Apply<Operation<RandEquivalentArgs1> >("RandEquivalent", fst1.ArcType(), in RandEquivalent()
39 bool RandEquivalent(const FstClass &fst1, const FstClass &fst2, int32 seed, in RandEquivalent() argument
42 if (!ArcTypesMatch(fst1, fst2, "RandEquivalent")) return false; in RandEquivalent()
44 RandEquivalentInnerArgs2 args(fst1, fst2, seed, num_paths, delta, opts); in RandEquivalent()
48 "RandEquivalent", fst1.ArcType(), &args_with_retval); in RandEquivalent()
Dreverse.cc24 void Reverse(const FstClass &fst1, MutableFstClass *fst2) { in Reverse() argument
25 if (!ArcTypesMatch(fst1, *fst2, "Reverse")) return; in Reverse()
27 ReverseArgs args(fst1, fst2); in Reverse()
29 Apply<Operation<ReverseArgs> >("Reverse", fst1.ArcType(), &args); in Reverse()
Dunion.cc24 void Union(MutableFstClass *fst1, const FstClass &fst2) { in Union() argument
25 if (!ArcTypesMatch(*fst1, fst2, "Union")) return; in Union()
27 UnionArgs args(fst1, fst2); in Union()
29 Apply<Operation<UnionArgs> >("Union", fst1->ArcType(), &args); in Union()
Dequal.cc24 bool Equal(const FstClass &fst1, const FstClass &fst2, float kDelta) { in Equal() argument
25 if (!ArcTypesMatch(fst1, fst2, "Equal")) return false; in Equal()
27 EqualInnerArgs args(fst1, fst2, kDelta); in Equal()
30 Apply<Operation<EqualArgs> >("Equal", fst1.ArcType(), &args_with_retval); in Equal()
Dequivalent.cc24 bool Equivalent(const FstClass &fst1, const FstClass &fst2, in Equivalent() argument
26 if (!ArcTypesMatch(fst1, fst2, "Equivalent")) return false; in Equivalent()
28 EquivalentInnerArgs args(fst1, fst2, kDelta); in Equivalent()
31 Apply<Operation<EquivalentArgs> >("Equivalent", fst1.ArcType(), in Equivalent()
/external/openfst/src/include/fst/script/
Drandequivalent.h36 const Fst<Arc> &fst1 = *(args->args.arg1.GetFst<Arc>()); in RandEquivalent() local
39 args->retval = RandEquivalent(fst1, fst2, args->args.arg3, args->args.arg4, in RandEquivalent()
54 const Fst<Arc> &fst1 = *(args->args.arg1.GetFst<Arc>()); in RandEquivalent() local
64 args->retval = RandEquivalent(fst1, fst2, args->args.arg4, in RandEquivalent()
71 args->retval = RandEquivalent(fst1, fst2, args->args.arg4, in RandEquivalent()
77 args->retval = RandEquivalent(fst1, fst2, args->args.arg4, in RandEquivalent()
84 bool RandEquivalent(const FstClass &fst1,
92 bool RandEquivalent(const FstClass &fst1,
Dreverse.h31 const Fst<Arc> &fst1 = *(args->arg1.GetFst<Arc>()); in Reverse() local
34 Reverse(fst1, fst2); in Reverse()
37 void Reverse(const FstClass &fst1, MutableFstClass *fst2);
Dunion.h31 MutableFst<Arc> *fst1 = args->arg1->GetMutableFst<Arc>(); in Union() local
34 Union(fst1, fst2); in Union()
37 void Union(MutableFstClass *fst1, const FstClass &fst2);
Dequal.h32 const Fst<Arc> &fst1 = *(args->args.arg1.GetFst<Arc>()); in Equal() local
35 args->retval = Equal(fst1, fst2, args->args.arg3); in Equal()
38 bool Equal(const FstClass &fst1, const FstClass &fst2,
Dequivalent.h33 const Fst<Arc> &fst1 = *(args->args.arg1.GetFst<Arc>()); in Equivalent() local
36 args->retval = Equivalent(fst1, fst2, args->args.arg3); in Equivalent()
39 bool Equivalent(const FstClass &fst1, const FstClass &fst2,
/external/openfst/src/bin/
Dfstminimize.cc54 MutableFstClass *fst1 = MutableFstClass::Read(in_name, true); in main() local
55 if (!fst1) return 1; in main()
58 new VectorFstClass(fst1->ArcType()) : 0; in main()
60 s::Minimize(fst1, fst2, FLAGS_delta); in main()
62 fst1->Write(out1_name); in main()
Dfstunion.cc56 MutableFstClass *fst1 = MutableFstClass::Read(in1_name, true); in main() local
57 if (!fst1) return 1; in main()
64 Union(fst1, *fst2); in main()
65 fst1->Write(out_name); in main()
Dfstconcat.cc52 MutableFstClass *fst1 = MutableFstClass::Read(in1_name, true); in main() local
53 if (!fst1) return 1; in main()
58 s::Concat(fst1, *fst2); in main()
59 fst1->Write(out_fname); in main()

12