Creates FST replacement or not depending on conditions including program options.
More...
#include <task.hifst.replacefstbyarc.hpp>
|
| ManualReplaceFstByArc (grammar_inversecategories_t const &vcat, unordered_set< std::string > const &replacefstbyarc, bool alignmode, std::size_t min_numstates=std::numeric_limits< std::size_t >::max()) |
|
| ManualReplaceFstByArc (grammar_inversecategories_t const &vcat, unordered_set< std::string > const &replacefstbyarc, unordered_set< std::string > const &replacefstbyarcexceptions, bool alignmode, std::size_t min_numstates=std::numeric_limits< std::size_t >::max()) |
|
fst::VectorFst< Arc > * | operator() (fst::VectorFst< Arc > const &fst, Label const &hieroindex) const |
| Determines whether an FST is replaceable If so (NS > minns or determined by program option hifst.replacfstbyarc), then it builds the FST replacement and returns it. Otherwise returns NULL. More...
|
|
template<class Arc = fst::LexStdArc>
class ucam::hifst::ManualReplaceFstByArc< Arc >
Creates FST replacement or not depending on conditions including program options.
Definition at line 95 of file task.hifst.replacefstbyarc.hpp.
template<class Arc = fst::LexStdArc>
- Parameters
-
vcat | cc - string category mapping |
replacefstbyarc | Contains a list of non-terminals corresponding to cell lattices that must be replaced |
alignmode | Hifst in alignment mode or not |
min_numstates | Number of states minimum threshold |
Definition at line 117 of file task.hifst.replacefstbyarc.hpp.
template<class Arc = fst::LexStdArc>
template<class Arc = fst::LexStdArc>
Determines whether an FST is replaceable If so (NS > minns or determined by program option hifst.replacfstbyarc), then it builds the FST replacement and returns it. Otherwise returns NULL.
- Parameters
-
fst | The fst candidate for replacing with a pointer arc |
hieroindex | Index for cc,x,y in the cyk grid cell |
Definition at line 149 of file task.hifst.replacefstbyarc.hpp.
The documentation for this class was generated from the following file: