Batching BPE Tokenization Merges
Not on the map. Why?
Abstract (arXiv)
The Byte Pair Encoding algorithm can be safely batched to merge hundreds of pairs of tokens at a time when building up a tokenizer's vocabulary. This technique combined with reducing the memory footprint of text used in vocabulary training make it feasible to train a high quality tokenizer on a basic laptop. This paper presents BatchBPE, an open-source pure Python implementation of these concepts, with the goal of making experimenting with new tokenization strategies more accessible especially in compute- and memory-constrained contexts. BatchBPE's usefulness and malleability are demonstrated through the training of several token vocabularies to explore the batch merging process and experiment with preprocessing a stop word list and ignoring the least common text chunks in a dataset. Resultant encoded lengths of texts are used as a basic evaluation metric.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 7 of its 18 references that are in the map. First posted on arXiv 5 Aug 2024.
Builds on
7 of 18 references.
References · 7
- 2015Neural Machine Translation of Rare Words with Subword Unitscited by 2,898
- 2018SentencePiece: A simple and language independent subword tokenizer and detokenizer for Neural Text Processingcited by 1,973
- 2020Byte Pair Encoding is Suboptimal for Language Model Pretrainingcited by 189
- 2024Fishing for Magikarp: Automatically Detecting Under-trained Tokens in Large Language Modelscited by 45
- 2023A Formal Perspective on Byte-Pair Encodingcited by 35
- 2024Data Mixture Inference: What do BPE Tokenizers Reveal about their Training Data?cited by 13
- 2024Rethinking Tokenization: Crafting Better Tokenizers for Large Language Modelscited by 8
Built on by
Not cited yet.