SOTAVerified

Splintering Nonconcatenative Languages for Better Tokenization

2025-03-18Code Available0· sign in to hype

Bar Gazit, Shaltiel Shmidman, Avi Shmidman, Yuval Pinter

Code Available — Be the first to reproduce this paper.

Reproduce

Code

Abstract

Common subword tokenization algorithms like BPE and UnigramLM assume that text can be split into meaningful units by concatenative measures alone. This is not true for languages such as Hebrew and Arabic, where morphology is encoded in root-template patterns, or Malay and Georgian, where split affixes are common. We present SPLINTER, a pre-processing step which rearranges text into a linear form that better represents such nonconcatenative morphologies, enabling meaningful contiguous segments to be found by the tokenizer. We demonstrate SPLINTER's merit using both intrinsic measures evaluating token vocabularies in Hebrew, Arabic, and Malay; as well as on downstream tasks using BERT-architecture models trained for Hebrew.

Reproductions