Distributional Properties of Subword Regularization
<|reference_start|>Distributional Properties of Subword Regularization: Subword regularization, used widely in NLP, improves model performance by reducing the dependency on exact tokenizations, augmenting the training corpus, and exposing the model to more unique contexts during training. BPE and MaxMatch, two popular subword tokenization schemes, have stochastic dropout regularization variants. However, there has not been an analysis of the distributions formed by them. We show that these stochastic variants are heavily biased towards a small set of tokenizations per word. If the benefits of subword regularization are as mentioned, we hypothesize that biasedness artificially limits the effectiveness of these schemes. Thus, we propose an algorithm to uniformly sample tokenizations that we use as a drop-in replacement for the stochastic aspects of existing tokenizers, and find that it improves machine translation quality.<|reference_end|>
@article{cognetta2024distributional,
    title={Distributional Properties of Subword Regularization},
    author={Marco Cognetta, Vil'em Zouhar, Naoaki Okazaki},
    journal={arXiv preprint arXiv:2408.11443},
    year={2024},
    archivePrefix={arXiv},
    eprint={2408.11443},
    primaryClass={cs.CL}
}