mirror of
https://github.com/mozilla/DeepSpeech.git
synced 2025-10-26 11:19:39 +00:00
440893c58d
Flatten structure to avoid nested STL structures which are awkward to wrap with SWIG and slower at runtime.
99 lines
3.1 KiB
C++
99 lines
3.1 KiB
C++
#ifndef DECODER_UTILS_H_
|
|
#define DECODER_UTILS_H_
|
|
|
|
#include <utility>
|
|
#include <vector>
|
|
|
|
#include "fst/log.h"
|
|
#include "path_trie.h"
|
|
#include "output.h"
|
|
|
|
const float NUM_FLT_INF = std::numeric_limits<float>::max();
|
|
const float NUM_FLT_MIN = std::numeric_limits<float>::min();
|
|
const float NUM_FLT_LOGE = 0.4342944819;
|
|
|
|
// inline function for validation check
|
|
inline void check(
|
|
bool x, const char *expr, const char *file, int line, const char *err) {
|
|
if (!x) {
|
|
std::cout << "[" << file << ":" << line << "] ";
|
|
LOG(FATAL) << "\"" << expr << "\" check failed. " << err;
|
|
}
|
|
}
|
|
|
|
#define VALID_CHECK(x, info) \
|
|
check(static_cast<bool>(x), #x, __FILE__, __LINE__, info)
|
|
#define VALID_CHECK_EQ(x, y, info) VALID_CHECK((x) == (y), info)
|
|
#define VALID_CHECK_GT(x, y, info) VALID_CHECK((x) > (y), info)
|
|
#define VALID_CHECK_LT(x, y, info) VALID_CHECK((x) < (y), info)
|
|
|
|
|
|
// Function template for comparing two pairs
|
|
template <typename T1, typename T2>
|
|
bool pair_comp_first_rev(const std::pair<T1, T2> &a,
|
|
const std::pair<T1, T2> &b) {
|
|
return a.first > b.first;
|
|
}
|
|
|
|
// Function template for comparing two pairs
|
|
template <typename T1, typename T2>
|
|
bool pair_comp_second_rev(const std::pair<T1, T2> &a,
|
|
const std::pair<T1, T2> &b) {
|
|
return a.second > b.second;
|
|
}
|
|
|
|
// Return the sum of two probabilities in log scale
|
|
template <typename T>
|
|
T log_sum_exp(const T &x, const T &y) {
|
|
static T num_min = -std::numeric_limits<T>::max();
|
|
if (x <= num_min) return y;
|
|
if (y <= num_min) return x;
|
|
T xmax = std::max(x, y);
|
|
return std::log(std::exp(x - xmax) + std::exp(y - xmax)) + xmax;
|
|
}
|
|
|
|
// Get pruned probability vector for each time step's beam search
|
|
std::vector<std::pair<size_t, float>> get_pruned_log_probs(
|
|
const double *prob_step,
|
|
size_t class_dim,
|
|
double cutoff_prob,
|
|
size_t cutoff_top_n);
|
|
|
|
// Get beam search result from prefixes in trie tree
|
|
std::vector<Output> get_beam_search_result(
|
|
const std::vector<PathTrie *> &prefixes,
|
|
size_t beam_size);
|
|
|
|
// Functor for prefix comparsion
|
|
bool prefix_compare(const PathTrie *x, const PathTrie *y);
|
|
|
|
/* Get length of utf8 encoding string
|
|
* See: http://stackoverflow.com/a/4063229
|
|
*/
|
|
size_t get_utf8_str_len(const std::string &str);
|
|
|
|
/* Split a string into a list of strings on a given string
|
|
* delimiter. NB: delimiters on beginning / end of string are
|
|
* trimmed. Eg, "FooBarFoo" split on "Foo" returns ["Bar"].
|
|
*/
|
|
std::vector<std::string> split_str(const std::string &s,
|
|
const std::string &delim);
|
|
|
|
/* Splits string into vector of strings representing
|
|
* UTF-8 characters (not same as chars)
|
|
*/
|
|
std::vector<std::string> split_utf8_str(const std::string &str);
|
|
|
|
// Add a word in index to the dicionary of fst
|
|
void add_word_to_fst(const std::vector<int> &word,
|
|
fst::StdVectorFst *dictionary);
|
|
|
|
// Add a word in string to dictionary
|
|
bool add_word_to_dictionary(
|
|
const std::string &word,
|
|
const std::unordered_map<std::string, int> &char_map,
|
|
bool add_space,
|
|
int SPACE_ID,
|
|
fst::StdVectorFst *dictionary);
|
|
#endif // DECODER_UTILS_H
|