Pruned BPE hides low-final-exposure BPE tokens as internal merge nodes and reallocates their visible vocabulary slots to better-exposed candidates from resumed training, reducing encoded length by about 0.27-0.36% at fixed visible vocabulary size.
An Analysis of BPE Vocabulary Trimming in Neural Machine Translation
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
We explore threshold vocabulary trimming in Byte-Pair Encoding subword tokenization, a postprocessing step that replaces rare subwords with their component subwords. The technique is available in popular tokenization libraries but has not been subjected to rigorous scientific scrutiny. While the removal of rare subwords is suggested as best practice in machine translation implementations, both as a means to reduce model size and for improving model performance through robustness, our experiments indicate that, across a large space of hyperparameter settings, vocabulary trimming fails to improve performance, and is even prone to incurring heavy degradation.
citation-role summary
citation-polarity summary
fields
cs.CL 1years
2026 1verdicts
CONDITIONAL 1roles
baseline 1polarities
baseline 1representative citing papers
citing papers explorer
-
Pruned BPE: Post-training Visibility Pruning and Token Reallocation for Byte Pair Encoding
Pruned BPE hides low-final-exposure BPE tokens as internal merge nodes and reallocates their visible vocabulary slots to better-exposed candidates from resumed training, reducing encoded length by about 0.27-0.36% at fixed visible vocabulary size.