Improving Tokenisation by Alternative Treatment of Spaces
Edward Gow-Smith, Harish Tayyar Madabushi, Carolina Scarton, Aline, Villavicencio

TL;DR
This paper proposes treating spaces as individual tokens in subword tokenisation algorithms, improving the handling of complex words and morphological correctness without harming overall NLP task performance.
Contribution
It introduces a novel modification to BPE and Unigram tokenisation algorithms by always treating spaces as separate tokens, enhancing linguistic validity.
Findings
Improved performance on complex word tasks
More morphologically correct tokenisations, especially for prefixes
No negative impact on general NLP tasks
Abstract
Tokenisation is the first step in almost all NLP tasks, and state-of-the-art transformer-based language models all use subword tokenisation algorithms to process input text. Existing algorithms have problems, often producing tokenisations of limited linguistic validity, and representing equivalent strings differently depending on their position within a word. We hypothesise that these problems hinder the ability of transformer-based models to handle complex words, and suggest that these problems are a result of allowing tokens to include spaces. We thus experiment with an alternative tokenisation approach where spaces are always treated as individual tokens. Specifically, we apply this modification to the BPE and Unigram algorithms. We find that our modified algorithms lead to improved performance on downstream NLP tasks that involve handling complex words, whilst having no detrimental…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNatural Language Processing Techniques · Topic Modeling · Text Readability and Simplification
MethodsByte Pair Encoding
