Public Member Functions | Private Attributes | List of all members
TrainingGraphCompiler Class Reference

#include <training-graph-compiler.h>

Collaboration diagram for TrainingGraphCompiler:
Collaboration graph
[legend]

Public Member Functions

 TrainingGraphCompiler (const TransitionModel &trans_model, const ContextDependency &ctx_dep, fst::VectorFst< fst::StdArc > *lex_fst, const std::vector< int32 > &disambig_syms, const TrainingGraphCompilerOptions &opts)
 
bool CompileGraph (const fst::VectorFst< fst::StdArc > &word_grammar, fst::VectorFst< fst::StdArc > *out_fst)
 
bool CompileGraphs (const std::vector< const fst::VectorFst< fst::StdArc > *> &word_fsts, std::vector< fst::VectorFst< fst::StdArc > *> *out_fsts)
 
bool CompileGraphFromText (const std::vector< int32 > &transcript, fst::VectorFst< fst::StdArc > *out_fst)
 
bool CompileGraphsFromText (const std::vector< std::vector< int32 > > &word_grammar, std::vector< fst::VectorFst< fst::StdArc > *> *out_fsts)
 
 ~TrainingGraphCompiler ()
 

Private Attributes

const TransitionModel & trans_model_
 
const ContextDependency & ctx_dep_
 
fst::VectorFst< fst::StdArc > * lex_fst_
 
std::vector< int32 > disambig_syms_
 
int32 subsequential_symbol_
 
fst::TableComposeCache< fst::Fst< fst::StdArc > > lex_cache_
 
TrainingGraphCompilerOptions opts_
 

Detailed Description

Definition at line 59 of file training-graph-compiler.h.

Constructor & Destructor Documentation

◆ TrainingGraphCompiler()

TrainingGraphCompiler ( const TransitionModel &  trans_model,
const ContextDependency &  ctx_dep,
fst::VectorFst< fst::StdArc > *  lex_fst,
const std::vector< int32 > &  disambig_syms,
const TrainingGraphCompilerOptions &  opts 
)

Definition at line 26 of file training-graph-compiler.cc.

References fst::AddSubsequentialLoop(), ContextDependency::CentralPosition(), ContextDependency::ContextWidth(), TrainingGraphCompiler::disambig_syms_, TransitionModel::GetPhones(), rnnlm::i, kaldi::IsSortedAndUniq(), KALDI_ASSERT, KALDI_ERR, TrainingGraphCompiler::lex_fst_, kaldi::SortAndUniq(), TrainingGraphCompiler::subsequential_symbol_, and TrainingGraphCompiler::trans_model_.

30  :
31  trans_model_(trans_model), ctx_dep_(ctx_dep), lex_fst_(lex_fst),
32  disambig_syms_(disambig_syms), opts_(opts) {
33  using namespace fst;
34  const std::vector<int32> &phone_syms = trans_model_.GetPhones(); // needed to create context fst.
35 
36  KALDI_ASSERT(!phone_syms.empty());
37  KALDI_ASSERT(IsSortedAndUniq(phone_syms));
38  SortAndUniq(&disambig_syms_);
39  for (int32 i = 0; i < disambig_syms_.size(); i++)
40  if (std::binary_search(phone_syms.begin(), phone_syms.end(),
41  disambig_syms_[i]))
42  KALDI_ERR << "Disambiguation symbol " << disambig_syms_[i]
43  << " is also a phone.";
44 
45  subsequential_symbol_ = 1 + phone_syms.back();
46  if (!disambig_syms_.empty() && subsequential_symbol_ <= disambig_syms_.back())
47  subsequential_symbol_ = 1 + disambig_syms_.back();
48 
49  {
50  int32 N = ctx_dep.ContextWidth(),
51  P = ctx_dep.CentralPosition();
52  if (P != N-1)
53  AddSubsequentialLoop(subsequential_symbol_, lex_fst_); // This is needed for
54  // systems with right-context or we will not successfully compose
55  // with C.
56  }
57 
58  { // make sure lexicon is olabel sorted.
59  fst::OLabelCompare<fst::StdArc> olabel_comp;
60  fst::ArcSort(lex_fst_, olabel_comp);
61  }
62 }
kaldi::TrainingGraphCompiler::ctx_dep_
const ContextDependency & ctx_dep_
Definition: training-graph-compiler.h:97
kaldi::TransitionModel::GetPhones
const std::vector< int32 > & GetPhones() const
Returns a sorted, unique list of phones.
Definition: transition-model.h:199
fst
For an extended explanation of the framework of which grammar-fsts are a part, please see Support for...
Definition: graph.dox:21
kaldi::int32
kaldi::int32 int32
Definition: online-tcp-source.cc:27
kaldi::TrainingGraphCompiler::trans_model_
const TransitionModel & trans_model_
Definition: training-graph-compiler.h:96
kaldi::SortAndUniq
void SortAndUniq(std::vector< T > *vec)
Sorts and uniq&#39;s (removes duplicates) from a vector.
Definition: stl-utils.h:39
kaldi::TrainingGraphCompiler::lex_fst_
fst::VectorFst< fst::StdArc > * lex_fst_
Definition: training-graph-compiler.h:98
KALDI_ERR
#define KALDI_ERR
Definition: kaldi-error.h:147
fst::AddSubsequentialLoop
void AddSubsequentialLoop(StdArc::Label subseq_symbol, MutableFst< StdArc > *fst)
Modifies an FST so that it transuces the same paths, but the input side of the paths can all have the...
Definition: context-fst.cc:297
kaldi::TrainingGraphCompiler::opts_
TrainingGraphCompilerOptions opts_
Definition: training-graph-compiler.h:106
KALDI_ASSERT
#define KALDI_ASSERT(cond)
Definition: kaldi-error.h:185
kaldi::IsSortedAndUniq
bool IsSortedAndUniq(const std::vector< T > &vec)
Returns true if the vector is sorted and contains each element only once.
Definition: stl-utils.h:63

◆ ~TrainingGraphCompiler()

~TrainingGraphCompiler ( )
inline

Definition at line 94 of file training-graph-compiler.h.

94 { delete lex_fst_; }
kaldi::TrainingGraphCompiler::lex_fst_
fst::VectorFst< fst::StdArc > * lex_fst_
Definition: training-graph-compiler.h:98

Member Function Documentation

◆ CompileGraph()

bool CompileGraph ( const fst::VectorFst< fst::StdArc > &  word_grammar,
fst::VectorFst< fst::StdArc > *  out_fst 
)

Definition at line 73 of file training-graph-compiler.cc.

References kaldi::AddSelfLoops(), ContextDependency::CentralPosition(), fst::ComposeDeterministicOnDemandInverse(), ContextDependency::ContextWidth(), TrainingGraphCompiler::ctx_dep_, fst::DeterminizeStarInLog(), TrainingGraphCompiler::disambig_syms_, kaldi::GetHTransducer(), TransitionModel::GetPhones(), KALDI_ASSERT, TrainingGraphCompiler::lex_cache_, TrainingGraphCompiler::lex_fst_, fst::MinimizeEncoded(), TrainingGraphCompiler::opts_, fst::RemoveEpsLocal(), fst::RemoveSomeInputSymbols(), TrainingGraphCompilerOptions::reorder, TrainingGraphCompilerOptions::rm_eps, TrainingGraphCompilerOptions::self_loop_scale, TrainingGraphCompiler::subsequential_symbol_, fst::TableCompose(), TrainingGraphCompiler::trans_model_, TrainingGraphCompilerOptions::transition_scale, and HTransducerConfig::transition_scale.

Referenced by TrainingGraphCompiler::CompileGraphFromText(), and main().

74  {
75  using namespace fst;
76  KALDI_ASSERT(lex_fst_ !=NULL);
77  KALDI_ASSERT(out_fst != NULL);
78 
79  VectorFst<StdArc> phone2word_fst;
80  // TableCompose more efficient than compose.
81  TableCompose(*lex_fst_, word_fst, &phone2word_fst, &lex_cache_);
82 
83  KALDI_ASSERT(phone2word_fst.Start() != kNoStateId);
84 
85  const std::vector<int32> &phone_syms = trans_model_.GetPhones(); // needed to create context fst.
86 
87  // inv_cfst will be expanded on the fly, as needed.
88  InverseContextFst inv_cfst(subsequential_symbol_,
89  phone_syms,
90  disambig_syms_,
91  ctx_dep_.ContextWidth(),
92  ctx_dep_.CentralPosition());
93 
94 
95  VectorFst<StdArc> ctx2word_fst;
96  ComposeDeterministicOnDemandInverse(phone2word_fst, &inv_cfst, &ctx2word_fst);
97  // now ctx2word_fst is C * LG, assuming phone2word_fst is written as LG.
98  KALDI_ASSERT(ctx2word_fst.Start() != kNoStateId);
99 
100  HTransducerConfig h_cfg;
101  h_cfg.transition_scale = opts_.transition_scale;
102 
103  std::vector<int32> disambig_syms_h; // disambiguation symbols on
104  // input side of H.
105  VectorFst<StdArc> *H = GetHTransducer(inv_cfst.IlabelInfo(),
106  ctx_dep_,
107  trans_model_,
108  h_cfg,
109  &disambig_syms_h);
110 
111  VectorFst<StdArc> &trans2word_fst = *out_fst; // transition-id to word.
112  TableCompose(*H, ctx2word_fst, &trans2word_fst);
113 
114  KALDI_ASSERT(trans2word_fst.Start() != kNoStateId);
115 
116  // Epsilon-removal and determinization combined. This will fail if not determinizable.
117  DeterminizeStarInLog(&trans2word_fst);
118 
119  if (!disambig_syms_h.empty()) {
120  RemoveSomeInputSymbols(disambig_syms_h, &trans2word_fst);
121  // we elect not to remove epsilons after this phase, as it is
122  // a little slow.
123  if (opts_.rm_eps)
124  RemoveEpsLocal(&trans2word_fst);
125  }
126 
127 
128  // Encoded minimization.
129  MinimizeEncoded(&trans2word_fst);
130 
131  std::vector<int32> disambig;
132  bool check_no_self_loops = true;
133  AddSelfLoops(trans_model_,
134  disambig,
135  opts_.self_loop_scale,
136  opts_.reorder,
137  check_no_self_loops,
138  &trans2word_fst);
139 
140  delete H;
141  return true;
142 }
kaldi::ContextDependency::ContextWidth
virtual int32 ContextWidth() const
ContextWidth() returns the value N (e.g.
Definition: context-dep.h:61
kaldi::TrainingGraphCompiler::ctx_dep_
const ContextDependency & ctx_dep_
Definition: training-graph-compiler.h:97
fst::TableCompose
void TableCompose(const Fst< Arc > &ifst1, const Fst< Arc > &ifst2, MutableFst< Arc > *ofst, const TableComposeOptions &opts=TableComposeOptions())
Definition: table-matcher.h:315
kaldi::TransitionModel::GetPhones
const std::vector< int32 > & GetPhones() const
Returns a sorted, unique list of phones.
Definition: transition-model.h:199
fst::RemoveEpsLocal
void RemoveEpsLocal(MutableFst< Arc > *fst)
RemoveEpsLocal remove some (but not necessarily all) epsilons in an FST, using an algorithm that is g...
Definition: remove-eps-local-inl.h:309
fst
For an extended explanation of the framework of which grammar-fsts are a part, please see Support for...
Definition: graph.dox:21
kaldi::AddSelfLoops
void AddSelfLoops(const TransitionModel &trans_model, const std::vector< int32 > &disambig_syms, BaseFloat self_loop_scale, bool reorder, bool check_no_self_loops, fst::VectorFst< fst::StdArc > *fst)
For context, see AddSelfLoops().
Definition: hmm-utils.cc:602
kaldi::TrainingGraphCompiler::lex_cache_
fst::TableComposeCache< fst::Fst< fst::StdArc > > lex_cache_
Definition: training-graph-compiler.h:103
fst::MinimizeEncoded
void MinimizeEncoded(VectorFst< Arc > *fst, float delta=kDelta)
Definition: fstext-utils.h:114
kaldi::TrainingGraphCompiler::trans_model_
const TransitionModel & trans_model_
Definition: training-graph-compiler.h:96
kaldi::TrainingGraphCompiler::lex_fst_
fst::VectorFst< fst::StdArc > * lex_fst_
Definition: training-graph-compiler.h:98
fst::ComposeDeterministicOnDemandInverse
void ComposeDeterministicOnDemandInverse(const Fst< Arc > &right, DeterministicOnDemandFst< Arc > *left, MutableFst< Arc > *fst_composed)
This function does &#39;*fst_composed = Compose(Inverse(*fst2), fst1)&#39; Note that the arguments are revers...
Definition: deterministic-fst-inl.h:408
fst::DeterminizeStarInLog
void DeterminizeStarInLog(VectorFst< StdArc > *fst, float delta, bool *debug_ptr, int max_states)
Definition: fstext-utils-inl.h:371
kaldi::ContextDependency::CentralPosition
virtual int32 CentralPosition() const
Central position P of the phone context, in 0-based numbering, e.g.
Definition: context-dep.h:62
kaldi::GetHTransducer
fst::VectorFst< fst::StdArc > * GetHTransducer(const std::vector< std::vector< int32 > > &ilabel_info, const ContextDependencyInterface &ctx_dep, const TransitionModel &trans_model, const HTransducerConfig &config, std::vector< int32 > *disambig_syms_left)
Returns the H tranducer; result owned by caller.
Definition: hmm-utils.cc:254
kaldi::TrainingGraphCompiler::opts_
TrainingGraphCompilerOptions opts_
Definition: training-graph-compiler.h:106
KALDI_ASSERT
#define KALDI_ASSERT(cond)
Definition: kaldi-error.h:185
fst::RemoveSomeInputSymbols
void RemoveSomeInputSymbols(const std::vector< I > &to_remove, MutableFst< Arc > *fst)
RemoveSomeInputSymbols removes any symbol that appears in "to_remove", from the input side of the FST...
Definition: fstext-utils-inl.h:119

◆ CompileGraphFromText()

bool CompileGraphFromText ( const std::vector< int32 > &  transcript,
fst::VectorFst< fst::StdArc > *  out_fst 
)

Definition at line 64 of file training-graph-compiler.cc.

References TrainingGraphCompiler::CompileGraph(), and fst::MakeLinearAcceptor().

Referenced by main().

66  {
67  using namespace fst;
68  VectorFst<StdArc> word_fst;
69  MakeLinearAcceptor(transcript, &word_fst);
70  return CompileGraph(word_fst, out_fst);
71 }
fst
For an extended explanation of the framework of which grammar-fsts are a part, please see Support for...
Definition: graph.dox:21
fst::MakeLinearAcceptor
void MakeLinearAcceptor(const std::vector< I > &labels, MutableFst< Arc > *ofst)
Creates unweighted linear acceptor from symbol sequence.
Definition: fstext-utils-inl.h:311
kaldi::TrainingGraphCompiler::CompileGraph
bool CompileGraph(const fst::VectorFst< fst::StdArc > &word_grammar, fst::VectorFst< fst::StdArc > *out_fst)
Definition: training-graph-compiler.cc:73

◆ CompileGraphs()

bool CompileGraphs ( const std::vector< const fst::VectorFst< fst::StdArc > *> &  word_fsts,
std::vector< fst::VectorFst< fst::StdArc > *> *  out_fsts 
)

Definition at line 161 of file training-graph-compiler.cc.

References kaldi::AddSelfLoops(), ContextDependency::CentralPosition(), fst::ComposeDeterministicOnDemandInverse(), ContextDependency::ContextWidth(), TrainingGraphCompiler::ctx_dep_, fst::DeterminizeStarInLog(), TrainingGraphCompiler::disambig_syms_, kaldi::GetHTransducer(), TransitionModel::GetPhones(), rnnlm::i, KALDI_ASSERT, TrainingGraphCompiler::lex_cache_, TrainingGraphCompiler::lex_fst_, fst::MinimizeEncoded(), TrainingGraphCompiler::opts_, fst::RemoveEpsLocal(), fst::RemoveSomeInputSymbols(), TrainingGraphCompilerOptions::reorder, TrainingGraphCompilerOptions::rm_eps, TrainingGraphCompilerOptions::self_loop_scale, TrainingGraphCompiler::subsequential_symbol_, fst::TableCompose(), TrainingGraphCompiler::trans_model_, TrainingGraphCompilerOptions::transition_scale, and HTransducerConfig::transition_scale.

Referenced by TrainingGraphCompiler::CompileGraphsFromText(), and main().

163  {
164 
165  using namespace fst;
166  KALDI_ASSERT(lex_fst_ !=NULL);
167  KALDI_ASSERT(out_fsts != NULL && out_fsts->empty());
168  out_fsts->resize(word_fsts.size(), NULL);
169  if (word_fsts.empty()) return true;
170 
171  const std::vector<int32> &phone_syms = trans_model_.GetPhones(); // needed to create context fst.
172 
173  // inv_cfst will be expanded on the fly, as needed.
174  InverseContextFst inv_cfst(subsequential_symbol_,
175  phone_syms,
176  disambig_syms_,
177  ctx_dep_.ContextWidth(),
178  ctx_dep_.CentralPosition());
179 
180  for (size_t i = 0; i < word_fsts.size(); i++) {
181  VectorFst<StdArc> phone2word_fst;
182  // TableCompose more efficient than compose.
183  TableCompose(*lex_fst_, *(word_fsts[i]), &phone2word_fst, &lex_cache_);
184 
185  KALDI_ASSERT(phone2word_fst.Start() != kNoStateId &&
186  "Perhaps you have words missing in your lexicon?");
187 
188  VectorFst<StdArc> ctx2word_fst;
189  ComposeDeterministicOnDemandInverse(phone2word_fst, &inv_cfst, &ctx2word_fst);
190  // now ctx2word_fst is C * LG, assuming phone2word_fst is written as LG.
191  KALDI_ASSERT(ctx2word_fst.Start() != kNoStateId);
192 
193  (*out_fsts)[i] = ctx2word_fst.Copy(); // For now this contains the FST with symbols
194  // representing phones-in-context.
195  }
196 
197  HTransducerConfig h_cfg;
198  h_cfg.transition_scale = opts_.transition_scale;
199 
200  std::vector<int32> disambig_syms_h;
201  VectorFst<StdArc> *H = GetHTransducer(inv_cfst.IlabelInfo(),
202  ctx_dep_,
203  trans_model_,
204  h_cfg,
205  &disambig_syms_h);
206 
207  for (size_t i = 0; i < out_fsts->size(); i++) {
208  VectorFst<StdArc> &ctx2word_fst = *((*out_fsts)[i]);
209  VectorFst<StdArc> trans2word_fst;
210  TableCompose(*H, ctx2word_fst, &trans2word_fst);
211 
212  DeterminizeStarInLog(&trans2word_fst);
213 
214  if (!disambig_syms_h.empty()) {
215  RemoveSomeInputSymbols(disambig_syms_h, &trans2word_fst);
216  if (opts_.rm_eps)
217  RemoveEpsLocal(&trans2word_fst);
218  }
219 
220  // Encoded minimization.
221  MinimizeEncoded(&trans2word_fst);
222 
223  std::vector<int32> disambig;
224  bool check_no_self_loops = true;
225  AddSelfLoops(trans_model_,
226  disambig,
227  opts_.self_loop_scale,
228  opts_.reorder,
229  check_no_self_loops,
230  &trans2word_fst);
231 
232  KALDI_ASSERT(trans2word_fst.Start() != kNoStateId);
233 
234  *((*out_fsts)[i]) = trans2word_fst;
235  }
236 
237  delete H;
238  return true;
239 }
kaldi::ContextDependency::ContextWidth
virtual int32 ContextWidth() const
ContextWidth() returns the value N (e.g.
Definition: context-dep.h:61
kaldi::TrainingGraphCompiler::ctx_dep_
const ContextDependency & ctx_dep_
Definition: training-graph-compiler.h:97
fst::TableCompose
void TableCompose(const Fst< Arc > &ifst1, const Fst< Arc > &ifst2, MutableFst< Arc > *ofst, const TableComposeOptions &opts=TableComposeOptions())
Definition: table-matcher.h:315
kaldi::TransitionModel::GetPhones
const std::vector< int32 > & GetPhones() const
Returns a sorted, unique list of phones.
Definition: transition-model.h:199
fst::RemoveEpsLocal
void RemoveEpsLocal(MutableFst< Arc > *fst)
RemoveEpsLocal remove some (but not necessarily all) epsilons in an FST, using an algorithm that is g...
Definition: remove-eps-local-inl.h:309
fst
For an extended explanation of the framework of which grammar-fsts are a part, please see Support for...
Definition: graph.dox:21
kaldi::AddSelfLoops
void AddSelfLoops(const TransitionModel &trans_model, const std::vector< int32 > &disambig_syms, BaseFloat self_loop_scale, bool reorder, bool check_no_self_loops, fst::VectorFst< fst::StdArc > *fst)
For context, see AddSelfLoops().
Definition: hmm-utils.cc:602
kaldi::TrainingGraphCompiler::lex_cache_
fst::TableComposeCache< fst::Fst< fst::StdArc > > lex_cache_
Definition: training-graph-compiler.h:103
fst::MinimizeEncoded
void MinimizeEncoded(VectorFst< Arc > *fst, float delta=kDelta)
Definition: fstext-utils.h:114
kaldi::TrainingGraphCompiler::trans_model_
const TransitionModel & trans_model_
Definition: training-graph-compiler.h:96
kaldi::TrainingGraphCompiler::lex_fst_
fst::VectorFst< fst::StdArc > * lex_fst_
Definition: training-graph-compiler.h:98
fst::ComposeDeterministicOnDemandInverse
void ComposeDeterministicOnDemandInverse(const Fst< Arc > &right, DeterministicOnDemandFst< Arc > *left, MutableFst< Arc > *fst_composed)
This function does &#39;*fst_composed = Compose(Inverse(*fst2), fst1)&#39; Note that the arguments are revers...
Definition: deterministic-fst-inl.h:408
fst::DeterminizeStarInLog
void DeterminizeStarInLog(VectorFst< StdArc > *fst, float delta, bool *debug_ptr, int max_states)
Definition: fstext-utils-inl.h:371
kaldi::ContextDependency::CentralPosition
virtual int32 CentralPosition() const
Central position P of the phone context, in 0-based numbering, e.g.
Definition: context-dep.h:62
kaldi::GetHTransducer
fst::VectorFst< fst::StdArc > * GetHTransducer(const std::vector< std::vector< int32 > > &ilabel_info, const ContextDependencyInterface &ctx_dep, const TransitionModel &trans_model, const HTransducerConfig &config, std::vector< int32 > *disambig_syms_left)
Returns the H tranducer; result owned by caller.
Definition: hmm-utils.cc:254
kaldi::TrainingGraphCompiler::opts_
TrainingGraphCompilerOptions opts_
Definition: training-graph-compiler.h:106
KALDI_ASSERT
#define KALDI_ASSERT(cond)
Definition: kaldi-error.h:185
fst::RemoveSomeInputSymbols
void RemoveSomeInputSymbols(const std::vector< I > &to_remove, MutableFst< Arc > *fst)
RemoveSomeInputSymbols removes any symbol that appears in "to_remove", from the input side of the FST...
Definition: fstext-utils-inl.h:119

◆ CompileGraphsFromText()

bool CompileGraphsFromText ( const std::vector< std::vector< int32 > > &  word_grammar,
std::vector< fst::VectorFst< fst::StdArc > *> *  out_fsts 
)

Definition at line 145 of file training-graph-compiler.cc.

References TrainingGraphCompiler::CompileGraphs(), rnnlm::i, and fst::MakeLinearAcceptor().

Referenced by main().

147  {
148  using namespace fst;
149  std::vector<const VectorFst<StdArc>* > word_fsts(transcripts.size());
150  for (size_t i = 0; i < transcripts.size(); i++) {
151  VectorFst<StdArc> *word_fst = new VectorFst<StdArc>();
152  MakeLinearAcceptor(transcripts[i], word_fst);
153  word_fsts[i] = word_fst;
154  }
155  bool ans = CompileGraphs(word_fsts, out_fsts);
156  for (size_t i = 0; i < transcripts.size(); i++)
157  delete word_fsts[i];
158  return ans;
159 }
fst
For an extended explanation of the framework of which grammar-fsts are a part, please see Support for...
Definition: graph.dox:21
fst::MakeLinearAcceptor
void MakeLinearAcceptor(const std::vector< I > &labels, MutableFst< Arc > *ofst)
Creates unweighted linear acceptor from symbol sequence.
Definition: fstext-utils-inl.h:311
kaldi::TrainingGraphCompiler::CompileGraphs
bool CompileGraphs(const std::vector< const fst::VectorFst< fst::StdArc > *> &word_fsts, std::vector< fst::VectorFst< fst::StdArc > *> *out_fsts)
Definition: training-graph-compiler.cc:161

Member Data Documentation

◆ ctx_dep_

const ContextDependency& ctx_dep_
private

Definition at line 97 of file training-graph-compiler.h.

Referenced by TrainingGraphCompiler::CompileGraph(), and TrainingGraphCompiler::CompileGraphs().

◆ disambig_syms_

std::vector<int32> disambig_syms_
private

Definition at line 100 of file training-graph-compiler.h.

Referenced by TrainingGraphCompiler::CompileGraph(), TrainingGraphCompiler::CompileGraphs(), and TrainingGraphCompiler::TrainingGraphCompiler().

◆ lex_cache_

fst::TableComposeCache<fst::Fst<fst::StdArc> > lex_cache_
private

Definition at line 103 of file training-graph-compiler.h.

Referenced by TrainingGraphCompiler::CompileGraph(), and TrainingGraphCompiler::CompileGraphs().

◆ lex_fst_

fst::VectorFst<fst::StdArc>* lex_fst_
private

Definition at line 98 of file training-graph-compiler.h.

Referenced by TrainingGraphCompiler::CompileGraph(), TrainingGraphCompiler::CompileGraphs(), and TrainingGraphCompiler::TrainingGraphCompiler().

◆ opts_

TrainingGraphCompilerOptions opts_
private

Definition at line 106 of file training-graph-compiler.h.

Referenced by TrainingGraphCompiler::CompileGraph(), and TrainingGraphCompiler::CompileGraphs().

◆ subsequential_symbol_

int32 subsequential_symbol_
private

Definition at line 101 of file training-graph-compiler.h.

Referenced by TrainingGraphCompiler::CompileGraph(), TrainingGraphCompiler::CompileGraphs(), and TrainingGraphCompiler::TrainingGraphCompiler().

◆ trans_model_

const TransitionModel& trans_model_
private

Definition at line 96 of file training-graph-compiler.h.

Referenced by TrainingGraphCompiler::CompileGraph(), TrainingGraphCompiler::CompileGraphs(), and TrainingGraphCompiler::TrainingGraphCompiler().

The documentation for this class was generated from the following files: