Cambridge SMT System
|
Convenience class that inherits Taskinterface behaviour and optimizes an fst. More...
#include <task.optimizefst.hpp>
Public Member Functions | |
OptimizeFstTask (const ucam::util::RegistryPO &rg, const std::string &fstkey, const std::string stripEps) | |
Constructor with RegistryPO object. More... | |
bool | run (Data &d) |
Optimizes fst. this involves rmepsilon, determinizing and minimizing. The fst is accessed via data object using access key readfstkey_. If parentheses exist, the procedure is skipped, as a PDT is not determinizable. More... | |
Public Member Functions inherited from ucam::util::TaskInterface< Data > | |
TaskInterface () | |
Constructor. More... | |
virtual | ~TaskInterface () |
bool | chainrun (Data &d) |
Implements chain of responsability. Calls run method and, if there is another task, call its run method too. More... | |
bool | operator() (Data &d) |
TaskInterface & | appendTask (TaskInterface *t) |
Appends a task class. If there is no task, append here, otherwise delegate in next task. More... | |
TaskInterface & | operator() (TaskInterface *t) |
TaskInterface * | getTask () |
Return appended task. More... | |
TaskInterface * | next () |
Static Public Member Functions | |
static OptimizeFstTask * | init (const ucam::util::RegistryPO &rg, const std::string &optimizefstkey, const std::string &fstkey, const std::string &stripepskey) |
Convenience class that inherits Taskinterface behaviour and optimizes an fst.
Definition at line 33 of file task.optimizefst.hpp.
|
inline |
Constructor with RegistryPO object.
Definition at line 45 of file task.optimizefst.hpp.
|
inlinestatic |
Definition at line 62 of file task.optimizefst.hpp.
|
inlinevirtual |
Optimizes fst. this involves rmepsilon, determinizing and minimizing. The fst is accessed via data object using access key readfstkey_. If parentheses exist, the procedure is skipped, as a PDT is not determinizable.
&d | data object |
Implements ucam::util::TaskInterface< Data >.
Definition at line 79 of file task.optimizefst.hpp.