wehub-resource-sync
167 lines
6.6 KiB
Python
167 lines
6.6 KiB
Python
# Copyright (c) 2022 PaddlePaddle Authors. All Rights Reserved.
|
|
# Copyright 2020 The HuggingFace Team. 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.
|
|
|
|
import json
|
|
import os
|
|
import unittest
|
|
|
|
from paddlenlp.transformers.xlm.tokenizer import XLMTokenizer
|
|
from tests.testing_utils import slow
|
|
|
|
from ..test_tokenizer_common import TokenizerTesterMixin
|
|
|
|
|
|
class XLMTokenizationTest(TokenizerTesterMixin, unittest.TestCase):
|
|
tokenizer_class = XLMTokenizer
|
|
test_offsets = False
|
|
|
|
def setUp(self):
|
|
super().setUp()
|
|
|
|
# Adapted from Sennrich et al. 2015 and https://github.com/rsennrich/subword-nmt
|
|
vocab = [
|
|
"l",
|
|
"o",
|
|
"w",
|
|
"e",
|
|
"r",
|
|
"s",
|
|
"t",
|
|
"i",
|
|
"d",
|
|
"n",
|
|
"w</w>",
|
|
"r</w>",
|
|
"t</w>",
|
|
"lo",
|
|
"low",
|
|
"er</w>",
|
|
"low</w>",
|
|
"lowest</w>",
|
|
"newer</w>",
|
|
"wider</w>",
|
|
"<unk>",
|
|
]
|
|
vocab_tokens = dict(zip(vocab, range(len(vocab))))
|
|
merges = ["l o 123", "lo w 1456", "e r</w> 1789", ""]
|
|
|
|
self.vocab_file = os.path.join(self.tmpdirname, XLMTokenizer.resource_files_names["vocab_file"])
|
|
self.merges_file = os.path.join(self.tmpdirname, XLMTokenizer.resource_files_names["merges_file"])
|
|
with open(self.vocab_file, "w") as fp:
|
|
fp.write(json.dumps(vocab_tokens))
|
|
with open(self.merges_file, "w") as fp:
|
|
fp.write("\n".join(merges))
|
|
|
|
def get_input_output_texts(self, tokenizer):
|
|
input_text = "lower newer"
|
|
output_text = "lower newer"
|
|
return input_text, output_text
|
|
|
|
def test_get_vocab(self):
|
|
vocab_keys = list(self.get_tokenizer().get_vocab().keys())
|
|
|
|
self.assertEqual(vocab_keys[0], "l")
|
|
self.assertEqual(vocab_keys[-1], "<special9>")
|
|
self.assertEqual(len(vocab_keys), 34)
|
|
|
|
def test_add_tokens_tokenizer(self):
|
|
tokenizers = self.get_tokenizers(do_lower_case=False)
|
|
for tokenizer in tokenizers:
|
|
with self.subTest(f"{tokenizer.__class__.__name__}"):
|
|
vocab_size = tokenizer.vocab_size
|
|
all_size = len(tokenizer.get_vocab())
|
|
|
|
self.assertNotEqual(vocab_size, 0)
|
|
|
|
# We usually have added tokens from the start in tests because our vocab fixtures are
|
|
# smaller than the original vocabs - let's not assert this
|
|
# self.assertEqual(vocab_size, all_size)
|
|
|
|
new_toks = ["aaaaa bbbbbb", "cccccccccdddddddd"]
|
|
added_toks = tokenizer.add_tokens(new_toks)
|
|
vocab_size_2 = tokenizer.vocab_size
|
|
all_size_2 = len(tokenizer.get_vocab())
|
|
|
|
self.assertNotEqual(vocab_size_2, 0)
|
|
self.assertEqual(vocab_size, vocab_size_2)
|
|
self.assertEqual(added_toks, len(new_toks))
|
|
self.assertEqual(all_size_2, all_size + len(new_toks))
|
|
|
|
tokens = tokenizer.encode(
|
|
"aaaaa bbbbbb low cccccccccdddddddd l", return_token_type_ids=None, add_special_tokens=False
|
|
)["input_ids"]
|
|
self.assertGreaterEqual(len(tokens), 4)
|
|
self.assertGreater(tokens[0], tokenizer.vocab_size - 1)
|
|
self.assertGreater(tokens[-2], tokenizer.vocab_size - 1)
|
|
|
|
new_toks_2 = {"eos_token": ">>>>|||<||<<|<<", "pad_token": "<<<<<|||>|>>>>|>"}
|
|
added_toks_2 = tokenizer.add_special_tokens(new_toks_2)
|
|
vocab_size_3 = tokenizer.vocab_size
|
|
all_size_3 = len(tokenizer.get_vocab())
|
|
|
|
self.assertNotEqual(vocab_size_3, 0)
|
|
self.assertEqual(vocab_size, vocab_size_3)
|
|
self.assertEqual(added_toks_2, len(new_toks_2))
|
|
self.assertEqual(all_size_3, all_size_2 + len(new_toks_2))
|
|
|
|
tokens = tokenizer.encode(
|
|
">>>>|||<||<<|<< aaaaabbbbbb low cccccccccdddddddd <<<<<|||>|>>>>|> l",
|
|
return_token_type_ids=None,
|
|
add_special_tokens=False,
|
|
)["input_ids"]
|
|
self.assertGreaterEqual(len(tokens), 6)
|
|
self.assertGreater(tokens[0], tokenizer.vocab_size - 1)
|
|
self.assertGreater(tokens[0], tokens[1])
|
|
self.assertGreater(tokens[-2], tokenizer.vocab_size - 1)
|
|
self.assertEqual(tokens[0], tokenizer.eos_token_id)
|
|
self.assertEqual(tokens[-2], tokenizer.pad_token_id)
|
|
|
|
def test_consecutive_unk_string(self):
|
|
pass
|
|
|
|
def test_add_tokens(self):
|
|
tokenizer = XLMTokenizer(self.vocab_file, self.merges_file)
|
|
vocab_size = len(tokenizer)
|
|
self.assertEqual(tokenizer.add_tokens(""), 0)
|
|
self.assertEqual(tokenizer.add_tokens("testoken"), 1)
|
|
self.assertEqual(tokenizer.add_tokens(["testoken1", "testtoken2"]), 2)
|
|
self.assertEqual(len(tokenizer.get_vocab()), vocab_size + 3)
|
|
|
|
def test_full_tokenizer(self):
|
|
"""Adapted from Sennrich et al. 2015 and https://github.com/rsennrich/subword-nmt"""
|
|
tokenizer = XLMTokenizer(self.vocab_file, self.merges_file)
|
|
|
|
text = "lower"
|
|
bpe_tokens = ["low", "er</w>"]
|
|
tokens = tokenizer.tokenize(text)
|
|
self.assertListEqual(tokens, bpe_tokens)
|
|
|
|
input_tokens = tokens + ["<unk>"]
|
|
input_bpe_tokens = [14, 15, 20]
|
|
self.assertListEqual(tokenizer.convert_tokens_to_ids(input_tokens), input_bpe_tokens)
|
|
|
|
@slow
|
|
def test_sequence_builders(self):
|
|
tokenizer = XLMTokenizer.from_pretrained("xlm-mlm-en-2048")
|
|
|
|
text = tokenizer.encode("sequence builders", add_special_tokens=False)["input_ids"]
|
|
text_2 = tokenizer.encode("multi-sequence build", add_special_tokens=False)["input_ids"]
|
|
|
|
encoded_sentence = tokenizer.build_inputs_with_special_tokens(text)
|
|
encoded_pair = tokenizer.build_inputs_with_special_tokens(text, text_2)
|
|
|
|
assert encoded_sentence == [0] + text + [1]
|
|
assert encoded_pair == [0] + text + [1] + text_2 + [1]
|