Spaces:
Running
Running
File size: 4,406 Bytes
d8760c5 |
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 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 |
/**
* @license
* Copyright 2019 Google LLC. 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.
* =============================================================================
*/
// https://github.com/tensorflow/tfjs-models/blob/master/universal-sentence-encoder/src/tokenizer/trie.ts
class TrieNode {
constructor(key) {
this.key = key;
this.parent = null;
this.children = {};
this.end = false;
}
getWord() {
const output = [];
let node = this;
while (node !== null) {
if (node.key !== null) {
output.unshift(node.key);
}
node = node.parent;
}
return [output, this.score, this.index];
}
}
class Trie {
constructor() {
this.root = new TrieNode(null);
}
insert(word, score, index) {
let node = this.root;
const symbols = [];
for (const symbol of word) {
symbols.push(symbol);
}
for (let i = 0; i < symbols.length; i++) {
if (!node.children[symbols[i]]) {
node.children[symbols[i]] = new TrieNode(symbols[i]);
node.children[symbols[i]].parent = node;
}
node = node.children[symbols[i]];
if (i === symbols.length - 1) {
node.end = true;
node.score = score;
node.index = index;
}
}
}
find(ss) {
let node = this.root;
let iter = 0;
while (iter < ss.length && node != null) {
node = node.children[ss[iter]];
iter++;
}
return node;
}
}
const bert = {
loadTokenizer: async () => {
const tokenizer = new BertTokenizer();
await tokenizer.load();
return tokenizer;
}
};
class BertTokenizer {
constructor() {
this.separator = '\u2581';
this.UNK_INDEX = 100;
}
async load() {
this.vocab = await this.loadVocab();
this.trie = new Trie();
// Actual tokens start at 999.
for (let i = 999; i < this.vocab.length; i++) {
const word = this.vocab[i];
this.trie.insert(word, 1, i);
}
this.token2Id = {}
this.vocab.forEach((d, i) => {
this.token2Id[d] = i
})
this.decode = a => a.map(d => this.vocab[d].replace('▁', ' ')).join('')
// Adds [CLS] and [SEP]
this.tokenizeCLS = str => [101, ...this.tokenize(str), 102]
}
async loadVocab() {
if (!window.bertProcessedVocab){
window.bertProcessedVocab = await (await fetch('data/processed_vocab.json')).json()
}
return window.bertProcessedVocab
}
processInput(text) {
const words = text.split(' ');
return words.map(word => {
if (word !== '[CLS]' && word !== '[SEP]') {
return this.separator + word.toLowerCase().normalize('NFKC');
}
return word;
});
}
tokenize(text) {
// Source:
// https://github.com/google-research/bert/blob/88a817c37f788702a363ff935fd173b6dc6ac0d6/tokenization.py#L311
let outputTokens = [];
const words = this.processInput(text);
for (let i = 0; i < words.length; i++) {
const chars = [];
for (const symbol of words[i]) {
chars.push(symbol);
}
let isUnknown = false;
let start = 0;
const subTokens = [];
const charsLength = chars.length;
while (start < charsLength) {
let end = charsLength;
let currIndex;
while (start < end) {
let substr = chars.slice(start, end).join('');
const match = this.trie.find(substr);
if (match != null && match.end) {
currIndex = match.getWord()[2];
break;
}
end = end - 1;
}
if (currIndex == null) {
isUnknown = true;
break;
}
subTokens.push(currIndex);
start = end;
}
if (isUnknown) {
outputTokens.push(this.UNK_INDEX);
} else {
outputTokens = outputTokens.concat(subTokens);
}
}
return outputTokens;
}
} |