to-kun
took tokens to t-can
Current tokenizers have notorious issues that are bringing all the LLMs down.
tokun
is a model specialized in text embedding.
It is lossless while providing high input compression.
tokun
produces vectors of dimension 256 equivalent to 64 UTF-32-BE bytes.
IE each embedding can be thought of as a token of length 16 characters.
But these vectors are more than basic IDs, they keep meaningful information on their constituting parts.
The model produces vector embeddings that can be directly ingested by another model.
Regular tokens are unrelated IDs, while tokun
has the following properties:
- international:
tokun
performs evenly on the whole Unicode space - compression: the sequence length is divided by 16
- embeddings: the output vectors have only a dimension 256
- lossless: embeddings store all the information up to the byte level
- built-ins: Unicode has built-in special tokens, no need for
<|im_start|>
- meaningful: embeddings are natively related to each-other based on their parts
In all cases, the model requires the code from the package tokun
:
pip install tokun
Login to Hugging Face:
huggingface-cli login
Download the repository:
import huggingface_hub as hh
api = hh.HfApi()
api.snapshot_download(repo_id='apehex/tokun', local_dir='tokun/')
Import the tokenizer and model:
tokenizer = tokun.huggingface.ByteTokenizer()
model = hh.from_pretrained_keras('tokun/variants/16x4/')
You can directly load the weights from the repository.
For the most performant variant of the model, 16x4
:
import tensorflow as tf
import tokun.model
import urllib.request
urllib.request.urlretrieve('https://github.com/apehex/tokun/raw/main/models/16x4/1/7.7.keras', 'model.keras')
model = tf.keras.models.load_model('model.keras', compile=False)
Since it is small (between 1 and 2M parameters depending on the variant), the model can also be trained on Google Colab.
We will be encoding and decoding the following sample:
__s = """Une unité lexicale ou token lexical ou plus simplement token est un couple composé d'un nom et d'une valeur optionnelle (e.g. 135677)."""
The sequence dimension is fixed to 512 because exporting the Keras model requires to specify the input shape.
So the sample is padded to 16 * 512
characters or 64 * 512
bytes.
# encode with UTF-32
__x = tokenizer.batch_encode_plus(batch_text_or_text_pairs=[__s], padding='max_length', max_length=64 * 512, add_special_tokens=False)
__x = tf.convert_to_tensor(__x['input_ids'])
# tokenize
__e = model.layers[1](__x) # encoder
# these embeddings would be the input of a LLM
__o = llm(__e) # replace with your LLM
# detokenize
__p = model.layers[2](__o) # decoder
# interpret probabilities as byte indexes
__y = tokun.pipeline.postprocess(__p)
print(len(__s))
# 252
print(__x.shape) # 16 * 512 characters = 64 * 512 bytes
# (1, 32768)
print(__e.shape) # 512 embeddings
# (1, 512, 256)
print(__p.shape) # back to x shape
# (1, 32768, 256)
Note: the base Tensorflow implementation operates on any sequence dimension (see below)
__x = tokun.pipeline.preprocess(text=__s, groups=[4, 16], expand=[1], flatten=True)
__e = model._encoder(__x) # final embedding = input for another model
# these embeddings would be the input of a LLM
__o = llm(__e) # replace with your LLM
# detokenize
__p = MODEL._decoder(__o)
# interpret probabilities as byte indexes
__y = tokun.pipeline.postprocess(__p)
The OG version doesn't fix the sequence dimension:
print(len(__s))
# 252
print(__x.shape) # 4 * 252 = 1008 padded to 1024 bytes
# (1, 1024)
print(__e.shape) # 252 / 16 = 1024 / 64 = 16
# (1, 16, 256)
print(__p.shape) # back to x shape
# (1, 1024, 256)
tokun
was trained on random sequences of UTF-32-BE bytes, so that it covers the first 4 planes of Unicode.
Validation was also performed on the 7 languages of [MLQA][github-mlqa] to make sure the model keeps its accuracy on regular text.
Final model:
Older / simpler model iterations:
Main article:
- on Github
- on Hugging Face
Notes on each iteration:
See TODO.
This project was inspired by a video from Andrej Karpathy, "Let's build the GPT tokenizer".
Licensed under the aGPLv3.