aboutsummaryrefslogtreecommitdiff
path: root/tensorflow_lite_support/cc/text/tokenizers/regex_tokenizer.cc
blob: 38aff8805b301d2c9138aa363e3d51a12bc1bd8b (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
/* Copyright 2020 The TensorFlow Authors. All Rights Reserved.

Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at

    http://www.apache.org/licenses/LICENSE-2.0

Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
==============================================================================*/

#include "tensorflow_lite_support/cc/text/tokenizers/regex_tokenizer.h"

#include <iostream>

#include "absl/strings/str_cat.h"
#include "absl/strings/substitute.h"
#include "tensorflow_lite_support/cc/utils/common_utils.h"
namespace tflite {
namespace support {
namespace text {
namespace tokenizer {

namespace {
constexpr char kStart[] = "<START>";
constexpr char kPad[] = "<PAD>";
constexpr char kUnknown[] = "<UNKNOWN>";

void buildIndexTokenMap(
    const absl::node_hash_map<std::string, int>& token_index_map,
    absl::node_hash_map<int, absl::string_view>* index_token_map) {
  for (const auto& token : token_index_map) {
    (*index_token_map)[token.second] = token.first;
  }
}

}  // namespace

// RE2::FindAndConsume requires the delim_re_ to have a matching group in order
// to capture the matched delimiter length. Surround the regex with a
// parenthesis to create a matching group, it's fine if the regex is already
// surrounded by parenthesis.
RegexTokenizer::RegexTokenizer(const std::string& regex_pattern,
                               const std::string& path_to_vocab)
    : delim_re_{absl::Substitute("($0)", regex_pattern)},
      token_index_map_{utils::LoadVocabAndIndexFromFile(path_to_vocab)} {
  buildIndexTokenMap(token_index_map_, &index_token_map_);
}

RegexTokenizer::RegexTokenizer(const std::string& regex_pattern,
                               const char* vocab_buffer_data,
                               size_t vocab_buffer_size)
    : delim_re_{absl::Substitute("($0)", regex_pattern)},
      token_index_map_{utils::LoadVocabAndIndexFromBuffer(vocab_buffer_data,
                                                          vocab_buffer_size)} {
  buildIndexTokenMap(token_index_map_, &index_token_map_);
}

TokenizerResult RegexTokenizer::Tokenize(const std::string& input) {
  absl::string_view leftover(input.data());
  absl::string_view last_end = leftover;

  TokenizerResult result;

  // Keep looking for split points until we have reached the end of the input.
  absl::string_view extracted_delim_token;
  while (RE2::FindAndConsume(&leftover, delim_re_, &extracted_delim_token)) {
    absl::string_view token(last_end.data(),
                            extracted_delim_token.data() - last_end.data());
    bool has_non_empty_token = token.length() > 0;

    last_end = leftover;

    // Mark the end of the previous token, only if there was something.
    if (has_non_empty_token) {
      result.subwords.push_back(std::string(token));
    }
  }

  // Close the last token.
  if (!leftover.empty()) {
    result.subwords.push_back(std::string(leftover));
  }

  return result;
}

bool RegexTokenizer::LookupId(absl::string_view key, int* result) const {
  auto it = token_index_map_.find(key);
  if (it == token_index_map_.end()) {
    return false;
  }
  *result = it->second;
  return true;
}

bool RegexTokenizer::LookupWord(int vocab_id, absl::string_view* result) const {
  auto it = index_token_map_.find(vocab_id);
  if (it == index_token_map_.end()) {
    return false;
  }
  *result = it->second;
  return true;
}

bool RegexTokenizer::GetStartToken(int* start_token) {
  return LookupId(kStart, start_token);
}

bool RegexTokenizer::GetPadToken(int* pad_token) {
  return LookupId(kPad, pad_token);
}

bool RegexTokenizer::GetUnknownToken(int* unknown_token) {
  return LookupId(kUnknown, unknown_token);
}

}  // namespace tokenizer
}  // namespace text
}  // namespace support
}  // namespace tflite