2023-02-21 20:00:03 +08:00
|
|
|
|
// sherpa-onnx/csrc/text-utils.cc
|
|
|
|
|
|
//
|
|
|
|
|
|
// Copyright 2009-2011 Saarland University; Microsoft Corporation
|
|
|
|
|
|
// Copyright 2023 Xiaomi Corporation
|
|
|
|
|
|
|
|
|
|
|
|
#include "sherpa-onnx/csrc/text-utils.h"
|
|
|
|
|
|
|
2023-03-31 22:34:10 +08:00
|
|
|
|
#include <algorithm>
|
2024-06-19 20:51:57 +08:00
|
|
|
|
#include <cassert>
|
2023-10-18 10:19:10 +08:00
|
|
|
|
#include <cctype>
|
2023-10-26 11:10:48 +11:00
|
|
|
|
#include <cstdint>
|
2023-03-31 22:34:10 +08:00
|
|
|
|
#include <limits>
|
|
|
|
|
|
#include <sstream>
|
2023-02-21 20:00:03 +08:00
|
|
|
|
#include <string>
|
2023-03-31 22:34:10 +08:00
|
|
|
|
#include <unordered_map>
|
2023-10-18 10:19:10 +08:00
|
|
|
|
#include <utility>
|
2023-02-21 20:00:03 +08:00
|
|
|
|
#include <vector>
|
|
|
|
|
|
|
2023-10-25 11:49:27 +08:00
|
|
|
|
#include "sherpa-onnx/csrc/macros.h"
|
2023-10-18 10:19:10 +08:00
|
|
|
|
|
2023-02-21 20:00:03 +08:00
|
|
|
|
// This file is copied/modified from
|
|
|
|
|
|
// https://github.com/kaldi-asr/kaldi/blob/master/src/util/text-utils.cc
|
|
|
|
|
|
|
|
|
|
|
|
namespace sherpa_onnx {
|
|
|
|
|
|
|
2023-03-31 22:34:10 +08:00
|
|
|
|
// copied from kaldi/src/util/text-util.cc
|
|
|
|
|
|
template <class T>
|
|
|
|
|
|
class NumberIstream {
|
|
|
|
|
|
public:
|
|
|
|
|
|
explicit NumberIstream(std::istream &i) : in_(i) {}
|
|
|
|
|
|
|
|
|
|
|
|
NumberIstream &operator>>(T &x) {
|
|
|
|
|
|
if (!in_.good()) return *this;
|
|
|
|
|
|
in_ >> x;
|
|
|
|
|
|
if (!in_.fail() && RemainderIsOnlySpaces()) return *this;
|
|
|
|
|
|
return ParseOnFail(&x);
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
private:
|
|
|
|
|
|
std::istream &in_;
|
|
|
|
|
|
|
|
|
|
|
|
bool RemainderIsOnlySpaces() {
|
|
|
|
|
|
if (in_.tellg() != std::istream::pos_type(-1)) {
|
|
|
|
|
|
std::string rem;
|
|
|
|
|
|
in_ >> rem;
|
|
|
|
|
|
|
|
|
|
|
|
if (rem.find_first_not_of(' ') != std::string::npos) {
|
|
|
|
|
|
// there is not only spaces
|
|
|
|
|
|
return false;
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
in_.clear();
|
|
|
|
|
|
return true;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
NumberIstream &ParseOnFail(T *x) {
|
|
|
|
|
|
std::string str;
|
|
|
|
|
|
in_.clear();
|
|
|
|
|
|
in_.seekg(0);
|
|
|
|
|
|
// If the stream is broken even before trying
|
|
|
|
|
|
// to read from it or if there are many tokens,
|
|
|
|
|
|
// it's pointless to try.
|
|
|
|
|
|
if (!(in_ >> str) || !RemainderIsOnlySpaces()) {
|
|
|
|
|
|
in_.setstate(std::ios_base::failbit);
|
|
|
|
|
|
return *this;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
std::unordered_map<std::string, T> inf_nan_map;
|
|
|
|
|
|
// we'll keep just uppercase values.
|
|
|
|
|
|
inf_nan_map["INF"] = std::numeric_limits<T>::infinity();
|
|
|
|
|
|
inf_nan_map["+INF"] = std::numeric_limits<T>::infinity();
|
|
|
|
|
|
inf_nan_map["-INF"] = -std::numeric_limits<T>::infinity();
|
|
|
|
|
|
inf_nan_map["INFINITY"] = std::numeric_limits<T>::infinity();
|
|
|
|
|
|
inf_nan_map["+INFINITY"] = std::numeric_limits<T>::infinity();
|
|
|
|
|
|
inf_nan_map["-INFINITY"] = -std::numeric_limits<T>::infinity();
|
|
|
|
|
|
inf_nan_map["NAN"] = std::numeric_limits<T>::quiet_NaN();
|
|
|
|
|
|
inf_nan_map["+NAN"] = std::numeric_limits<T>::quiet_NaN();
|
|
|
|
|
|
inf_nan_map["-NAN"] = -std::numeric_limits<T>::quiet_NaN();
|
|
|
|
|
|
// MSVC
|
|
|
|
|
|
inf_nan_map["1.#INF"] = std::numeric_limits<T>::infinity();
|
|
|
|
|
|
inf_nan_map["-1.#INF"] = -std::numeric_limits<T>::infinity();
|
|
|
|
|
|
inf_nan_map["1.#QNAN"] = std::numeric_limits<T>::quiet_NaN();
|
|
|
|
|
|
inf_nan_map["-1.#QNAN"] = -std::numeric_limits<T>::quiet_NaN();
|
|
|
|
|
|
|
|
|
|
|
|
std::transform(str.begin(), str.end(), str.begin(), ::toupper);
|
|
|
|
|
|
|
|
|
|
|
|
if (inf_nan_map.find(str) != inf_nan_map.end()) {
|
|
|
|
|
|
*x = inf_nan_map[str];
|
|
|
|
|
|
} else {
|
|
|
|
|
|
in_.setstate(std::ios_base::failbit);
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
return *this;
|
|
|
|
|
|
}
|
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
/// ConvertStringToReal converts a string into either float or double
|
|
|
|
|
|
/// and returns false if there was any kind of problem (i.e. the string
|
|
|
|
|
|
/// was not a floating point number or contained extra non-whitespace junk).
|
|
|
|
|
|
/// Be careful- this function will successfully read inf's or nan's.
|
|
|
|
|
|
template <typename T>
|
|
|
|
|
|
bool ConvertStringToReal(const std::string &str, T *out) {
|
|
|
|
|
|
std::istringstream iss(str);
|
|
|
|
|
|
|
|
|
|
|
|
NumberIstream<T> i(iss);
|
|
|
|
|
|
|
|
|
|
|
|
i >> *out;
|
|
|
|
|
|
|
|
|
|
|
|
if (iss.fail()) {
|
|
|
|
|
|
// Number conversion failed.
|
|
|
|
|
|
return false;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
return true;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
template bool ConvertStringToReal<float>(const std::string &str, float *out);
|
|
|
|
|
|
|
|
|
|
|
|
template bool ConvertStringToReal<double>(const std::string &str, double *out);
|
|
|
|
|
|
|
2023-02-21 20:00:03 +08:00
|
|
|
|
void SplitStringToVector(const std::string &full, const char *delim,
|
|
|
|
|
|
bool omit_empty_strings,
|
|
|
|
|
|
std::vector<std::string> *out) {
|
|
|
|
|
|
size_t start = 0, found = 0, end = full.size();
|
|
|
|
|
|
out->clear();
|
|
|
|
|
|
while (found != std::string::npos) {
|
|
|
|
|
|
found = full.find_first_of(delim, start);
|
|
|
|
|
|
// start != end condition is for when the delimiter is at the end
|
|
|
|
|
|
if (!omit_empty_strings || (found != start && start != end))
|
|
|
|
|
|
out->push_back(full.substr(start, found - start));
|
|
|
|
|
|
start = found + 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2023-03-27 14:59:40 +08:00
|
|
|
|
template <class F>
|
|
|
|
|
|
bool SplitStringToFloats(const std::string &full, const char *delim,
|
|
|
|
|
|
bool omit_empty_strings, // typically false
|
|
|
|
|
|
std::vector<F> *out) {
|
|
|
|
|
|
assert(out != nullptr);
|
|
|
|
|
|
if (*(full.c_str()) == '\0') {
|
|
|
|
|
|
out->clear();
|
|
|
|
|
|
return true;
|
|
|
|
|
|
}
|
|
|
|
|
|
std::vector<std::string> split;
|
|
|
|
|
|
SplitStringToVector(full, delim, omit_empty_strings, &split);
|
|
|
|
|
|
out->resize(split.size());
|
|
|
|
|
|
for (size_t i = 0; i < split.size(); ++i) {
|
|
|
|
|
|
// assume atof never fails
|
2023-03-31 22:34:10 +08:00
|
|
|
|
F f = 0;
|
|
|
|
|
|
if (!ConvertStringToReal(split[i], &f)) return false;
|
|
|
|
|
|
(*out)[i] = f;
|
2023-03-27 14:59:40 +08:00
|
|
|
|
}
|
|
|
|
|
|
return true;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// Instantiate the template above for float and double.
|
|
|
|
|
|
template bool SplitStringToFloats(const std::string &full, const char *delim,
|
|
|
|
|
|
bool omit_empty_strings,
|
|
|
|
|
|
std::vector<float> *out);
|
|
|
|
|
|
template bool SplitStringToFloats(const std::string &full, const char *delim,
|
|
|
|
|
|
bool omit_empty_strings,
|
|
|
|
|
|
std::vector<double> *out);
|
|
|
|
|
|
|
2023-10-26 13:07:30 +08:00
|
|
|
|
static bool IsPunct(char c) { return c != '\'' && std::ispunct(c); }
|
2023-10-28 22:22:00 +08:00
|
|
|
|
static bool IsGermanUmlaut(const std::string &word) {
|
2023-10-27 16:11:38 +08:00
|
|
|
|
// ä 0xC3 0xA4
|
|
|
|
|
|
// ö 0xC3 0xB6
|
|
|
|
|
|
// ü 0xC3 0xBC
|
|
|
|
|
|
// Ä 0xC3 0x84
|
|
|
|
|
|
// Ö 0xC3 0x96
|
|
|
|
|
|
// Ü 0xC3 0x9C
|
|
|
|
|
|
// ß 0xC3 0x9F
|
|
|
|
|
|
|
2023-10-28 11:09:34 +08:00
|
|
|
|
if (word.size() != 2 || static_cast<uint8_t>(word[0]) != 0xc3) {
|
2023-10-27 16:11:38 +08:00
|
|
|
|
return false;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2023-10-28 11:09:34 +08:00
|
|
|
|
auto c = static_cast<uint8_t>(word[1]);
|
|
|
|
|
|
if (c == 0xa4 || c == 0xb6 || c == 0xbc || c == 0x84 || c == 0x96 ||
|
2023-10-27 16:11:38 +08:00
|
|
|
|
c == 0x9c || c == 0x9f) {
|
|
|
|
|
|
return true;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
return false;
|
|
|
|
|
|
}
|
2023-10-26 13:07:30 +08:00
|
|
|
|
|
2023-10-28 11:09:34 +08:00
|
|
|
|
// see https://www.tandem.net/blog/spanish-accents
|
2023-10-28 22:22:00 +08:00
|
|
|
|
// https://www.compart.com/en/unicode/U+00DC
|
2023-10-28 11:09:34 +08:00
|
|
|
|
static bool IsSpanishDiacritic(const std::string &word) {
|
|
|
|
|
|
// á 0xC3 0xA1
|
|
|
|
|
|
// é 0xC3 0xA9
|
|
|
|
|
|
// í 0xC3 0xAD
|
|
|
|
|
|
// ó 0xC3 0xB3
|
|
|
|
|
|
// ú 0xC3 0xBA
|
|
|
|
|
|
// ü 0xC3 0xBC
|
|
|
|
|
|
// ñ 0xC3 0xB1
|
2023-10-28 22:22:00 +08:00
|
|
|
|
//
|
|
|
|
|
|
// uppercase
|
|
|
|
|
|
//
|
|
|
|
|
|
// Á 0xC3 0x81
|
|
|
|
|
|
// É 0xC3 0x89
|
|
|
|
|
|
// Í 0xC3 0x8D
|
|
|
|
|
|
// Ó 0xC3 0x93
|
|
|
|
|
|
// Ú 0xC3 0x9A
|
|
|
|
|
|
// Ü 0xC3 0x9C
|
|
|
|
|
|
// Ñ 0xC3 0x91
|
2023-10-28 11:09:34 +08:00
|
|
|
|
|
|
|
|
|
|
if (word.size() != 2 || static_cast<uint8_t>(word[0]) != 0xc3) {
|
|
|
|
|
|
return false;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
auto c = static_cast<uint8_t>(word[1]);
|
|
|
|
|
|
if (c == 0xa1 || c == 0xa9 || c == 0xad || c == 0xb3 || c == 0xba ||
|
2023-10-28 22:22:00 +08:00
|
|
|
|
c == 0xbc || c == 0xb1 || c == 0x81 || c == 0x89 || c == 0x8d ||
|
|
|
|
|
|
c == 0x93 || c == 0x9a || c == 0x9c || c == 0x91) {
|
2023-10-28 11:09:34 +08:00
|
|
|
|
return true;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
return false;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2023-10-28 22:22:00 +08:00
|
|
|
|
// see https://www.busuu.com/en/french/accent-marks
|
|
|
|
|
|
static bool IsFrenchDiacritic(const std::string &word) {
|
|
|
|
|
|
// acute accent
|
|
|
|
|
|
// é 0xC3 0xA9
|
|
|
|
|
|
//
|
|
|
|
|
|
// grave accent
|
|
|
|
|
|
// à 0xC3 0xA0
|
|
|
|
|
|
// è 0xC3 0xA8
|
|
|
|
|
|
// ù 0xC3 0xB9
|
|
|
|
|
|
//
|
|
|
|
|
|
// cedilla
|
|
|
|
|
|
// ç 0xC3 0xA7
|
|
|
|
|
|
//
|
|
|
|
|
|
// circumflex
|
|
|
|
|
|
// â 0xC3 0xA2
|
|
|
|
|
|
// ê 0xC3 0xAA
|
|
|
|
|
|
// î 0xC3 0xAE
|
|
|
|
|
|
// ô 0xC3 0xB4
|
|
|
|
|
|
// û 0xC3 0xBB
|
|
|
|
|
|
//
|
|
|
|
|
|
// trema
|
|
|
|
|
|
// ë 0xC3 0xAB
|
|
|
|
|
|
// ï 0xC3 0xAF
|
|
|
|
|
|
// ü 0xC3 0xBC
|
|
|
|
|
|
//
|
|
|
|
|
|
// É 0xC3 0x89
|
|
|
|
|
|
//
|
|
|
|
|
|
// À 0xC3 0x80
|
|
|
|
|
|
// È 0xC3 0x88
|
|
|
|
|
|
// Ù 0xC3 0x99
|
|
|
|
|
|
// Ç 0xC3 0x87
|
|
|
|
|
|
// Â 0xC3 0x82
|
|
|
|
|
|
// Ê 0xC3 0x8A
|
|
|
|
|
|
// Î 0xC3 0x8E
|
|
|
|
|
|
// Ô 0xC3 0x94
|
|
|
|
|
|
// Û 0xC3 0x9B
|
|
|
|
|
|
// Ë 0xC3 0x8B
|
|
|
|
|
|
// Ï 0xC3 0x8F
|
|
|
|
|
|
// Ü 0xC3 0x9C
|
|
|
|
|
|
|
|
|
|
|
|
if (word.size() != 2 || static_cast<uint8_t>(word[0]) != 0xc3) {
|
|
|
|
|
|
return false;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
auto c = static_cast<uint8_t>(word[1]);
|
|
|
|
|
|
if (c == 0xa9 || c == 0xa0 || c == 0xa8 || c == 0xb9 || c == 0xa7 ||
|
|
|
|
|
|
c == 0xa2 || c == 0xaa || c == 0xae || c == 0xb4 || c == 0xbb ||
|
|
|
|
|
|
c == 0xab || c == 0xaf || c == 0xbc || c == 0x89 || c == 0x80 ||
|
|
|
|
|
|
c == 0x88 || c == 0x99 || c == 0x87 || c == 0x82 || c == 0x8a ||
|
|
|
|
|
|
c == 0x8e || c == 0x94 || c == 0x9b || c == 0x8b || c == 0x8f ||
|
|
|
|
|
|
c == 0x9c) {
|
|
|
|
|
|
return true;
|
|
|
|
|
|
}
|
|
|
|
|
|
return false;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2023-10-28 11:09:34 +08:00
|
|
|
|
static bool IsSpecial(const std::string &w) {
|
2023-10-28 22:22:00 +08:00
|
|
|
|
bool ans = IsGermanUmlaut(w) || IsSpanishDiacritic(w) || IsFrenchDiacritic(w);
|
|
|
|
|
|
|
|
|
|
|
|
// for french d’impossible
|
|
|
|
|
|
// ’ 0xE2 0x80 0x99
|
|
|
|
|
|
bool ans2 = false;
|
|
|
|
|
|
if (w.size() == 3) {
|
|
|
|
|
|
auto c0 = static_cast<uint8_t>(w[0]);
|
|
|
|
|
|
auto c1 = static_cast<uint8_t>(w[1]);
|
|
|
|
|
|
auto c2 = static_cast<uint8_t>(w[2]);
|
|
|
|
|
|
if (c0 == 0xe2 && c1 == 0x80 && c2 == 0x99) {
|
|
|
|
|
|
ans2 = true;
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
return ans || ans2;
|
2023-10-28 11:09:34 +08:00
|
|
|
|
}
|
|
|
|
|
|
|
2023-10-25 14:55:27 +08:00
|
|
|
|
static std::vector<std::string> MergeCharactersIntoWords(
|
|
|
|
|
|
const std::vector<std::string> &words) {
|
|
|
|
|
|
std::vector<std::string> ans;
|
|
|
|
|
|
|
|
|
|
|
|
int32_t n = static_cast<int32_t>(words.size());
|
|
|
|
|
|
int32_t i = 0;
|
|
|
|
|
|
int32_t prev = -1;
|
|
|
|
|
|
|
|
|
|
|
|
while (i < n) {
|
|
|
|
|
|
const auto &w = words[i];
|
2023-10-28 11:09:34 +08:00
|
|
|
|
if (w.size() >= 3 || (w.size() == 2 && !IsSpecial(w)) ||
|
2023-10-26 13:07:30 +08:00
|
|
|
|
(w.size() == 1 && (IsPunct(w[0]) || std::isspace(w[0])))) {
|
2023-10-25 14:55:27 +08:00
|
|
|
|
if (prev != -1) {
|
|
|
|
|
|
std::string t;
|
|
|
|
|
|
for (; prev < i; ++prev) {
|
|
|
|
|
|
t.append(words[prev]);
|
|
|
|
|
|
}
|
|
|
|
|
|
prev = -1;
|
|
|
|
|
|
ans.push_back(std::move(t));
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
if (!std::isspace(w[0])) {
|
|
|
|
|
|
ans.push_back(w);
|
|
|
|
|
|
}
|
|
|
|
|
|
++i;
|
|
|
|
|
|
continue;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2023-10-27 16:11:38 +08:00
|
|
|
|
// e.g., öffnen
|
2023-10-28 11:09:34 +08:00
|
|
|
|
if (w.size() == 1 || (w.size() == 2 && IsSpecial(w))) {
|
2023-10-25 14:55:27 +08:00
|
|
|
|
if (prev == -1) {
|
|
|
|
|
|
prev = i;
|
|
|
|
|
|
}
|
|
|
|
|
|
++i;
|
|
|
|
|
|
continue;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
SHERPA_ONNX_LOGE("Ignore %s", w.c_str());
|
|
|
|
|
|
++i;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
if (prev != -1) {
|
|
|
|
|
|
std::string t;
|
|
|
|
|
|
for (; prev < i; ++prev) {
|
|
|
|
|
|
t.append(words[prev]);
|
|
|
|
|
|
}
|
|
|
|
|
|
ans.push_back(std::move(t));
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
return ans;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2023-10-18 10:19:10 +08:00
|
|
|
|
std::vector<std::string> SplitUtf8(const std::string &text) {
|
2023-10-25 11:49:27 +08:00
|
|
|
|
const uint8_t *begin = reinterpret_cast<const uint8_t *>(text.c_str());
|
|
|
|
|
|
const uint8_t *end = begin + text.size();
|
2023-10-18 10:19:10 +08:00
|
|
|
|
|
2023-10-25 14:55:27 +08:00
|
|
|
|
// Note that English words are split into single characters.
|
|
|
|
|
|
// We need to invoke MergeCharactersIntoWords() to merge them
|
2023-10-18 10:19:10 +08:00
|
|
|
|
std::vector<std::string> ans;
|
|
|
|
|
|
|
2023-10-25 11:49:27 +08:00
|
|
|
|
auto start = begin;
|
|
|
|
|
|
while (start < end) {
|
|
|
|
|
|
uint8_t c = *start;
|
|
|
|
|
|
uint8_t i = 0x80;
|
|
|
|
|
|
int32_t num_bytes = 0;
|
2023-10-18 10:19:10 +08:00
|
|
|
|
|
2023-10-25 11:49:27 +08:00
|
|
|
|
// see
|
|
|
|
|
|
// https://en.wikipedia.org/wiki/UTF-8
|
|
|
|
|
|
for (; c & i; i >>= 1) {
|
|
|
|
|
|
++num_bytes;
|
2023-10-18 10:19:10 +08:00
|
|
|
|
}
|
|
|
|
|
|
|
2023-10-25 11:49:27 +08:00
|
|
|
|
if (num_bytes == 0) {
|
|
|
|
|
|
// this is an ascii
|
|
|
|
|
|
ans.emplace_back(reinterpret_cast<const char *>(start), 1);
|
|
|
|
|
|
++start;
|
|
|
|
|
|
} else if (2 <= num_bytes && num_bytes <= 4) {
|
|
|
|
|
|
ans.emplace_back(reinterpret_cast<const char *>(start), num_bytes);
|
|
|
|
|
|
start += num_bytes;
|
|
|
|
|
|
} else {
|
|
|
|
|
|
SHERPA_ONNX_LOGE("Invalid byte at position: %d",
|
|
|
|
|
|
static_cast<int32_t>(start - begin));
|
|
|
|
|
|
// skip this byte
|
|
|
|
|
|
++start;
|
2023-10-18 10:19:10 +08:00
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2023-10-25 14:55:27 +08:00
|
|
|
|
return MergeCharactersIntoWords(ans);
|
2023-10-18 10:19:10 +08:00
|
|
|
|
}
|
2023-10-25 11:49:27 +08:00
|
|
|
|
|
2024-04-13 12:15:57 +08:00
|
|
|
|
std::string ToLowerCase(const std::string &s) {
|
|
|
|
|
|
std::string ans(s.size(), 0);
|
|
|
|
|
|
std::transform(s.begin(), s.end(), ans.begin(),
|
|
|
|
|
|
[](unsigned char c) { return std::tolower(c); });
|
|
|
|
|
|
return ans;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void ToLowerCase(std::string *in_out) {
|
|
|
|
|
|
std::transform(in_out->begin(), in_out->end(), in_out->begin(),
|
|
|
|
|
|
[](unsigned char c) { return std::tolower(c); });
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2023-02-21 20:00:03 +08:00
|
|
|
|
} // namespace sherpa_onnx
|