You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
68 lines
1.6 KiB
68 lines
1.6 KiB
#ifndef PATH_TRIE_H
|
|
#define PATH_TRIE_H
|
|
|
|
#include <algorithm>
|
|
#include <limits>
|
|
#include <memory>
|
|
#include <utility>
|
|
#include <vector>
|
|
|
|
#include "fst/fstlib.h"
|
|
|
|
/* Trie tree for prefix storing and manipulating, with a dictionary in
|
|
* finite-state transducer for spelling correction.
|
|
*/
|
|
class PathTrie {
|
|
public:
|
|
PathTrie();
|
|
~PathTrie();
|
|
|
|
// get new prefix after appending new char
|
|
PathTrie* get_path_trie(int new_char, bool reset = true);
|
|
|
|
// get the prefix in index from root to current node
|
|
PathTrie* get_path_vec(std::vector<int>& output);
|
|
|
|
// get the prefix in index from some stop node to current nodel
|
|
PathTrie* get_path_vec(std::vector<int>& output,
|
|
int stop,
|
|
size_t max_steps = std::numeric_limits<size_t>::max());
|
|
|
|
// update log probs
|
|
void iterate_to_vec(std::vector<PathTrie*>& output);
|
|
|
|
// set dictionary for FST
|
|
void set_dictionary(fst::StdVectorFst* dictionary);
|
|
|
|
void set_matcher(std::shared_ptr<fst::SortedMatcher<fst::StdVectorFst>>);
|
|
|
|
bool is_empty() { return ROOT_ == character; }
|
|
|
|
// remove current path from root
|
|
void remove();
|
|
|
|
float log_prob_b_prev;
|
|
float log_prob_nb_prev;
|
|
float log_prob_b_cur;
|
|
float log_prob_nb_cur;
|
|
float score;
|
|
float approx_ctc;
|
|
int character;
|
|
PathTrie* parent;
|
|
|
|
private:
|
|
int ROOT_;
|
|
bool exists_;
|
|
bool has_dictionary_;
|
|
|
|
std::vector<std::pair<int, PathTrie*>> children_;
|
|
|
|
// pointer to dictionary of FST
|
|
fst::StdVectorFst* dictionary_;
|
|
fst::StdVectorFst::StateId dictionary_state_;
|
|
// true if finding ars in FST
|
|
std::shared_ptr<fst::SortedMatcher<fst::StdVectorFst>> matcher_;
|
|
};
|
|
|
|
#endif // PATH_TRIE_H
|