English

Unsupervised Morphological Tree Tokenizer

Computation and Language 2025-07-11 v2 Machine Learning

Abstract

As a cornerstone in language modeling, tokenization involves segmenting text inputs into pre-defined atomic units. Conventional statistical tokenizers often disrupt constituent boundaries within words, thereby corrupting semantic information. To address this drawback, we introduce morphological structure guidance to tokenization and propose a deep model to induce character-level structures of words. Specifically, the deep model jointly encodes internal structures and representations of words with a mechanism named MorphOverriding\textit{MorphOverriding} to ensure the indecomposability of morphemes. By training the model with self-supervised objectives, our method is capable of inducing character-level structures that align with morphological rules without annotated training data. Based on the induced structures, our algorithm tokenizes words through vocabulary matching in a top-down manner. Empirical results indicate that the proposed method effectively retains complete morphemes and outperforms widely adopted methods such as BPE and WordPiece on both morphological segmentation tasks and language modeling tasks. Code is available at https://github.com/martianmartina/TreeTokenizer.

Keywords

Cite

@article{arxiv.2406.15245,
  title  = {Unsupervised Morphological Tree Tokenizer},
  author = {Qingyang Zhu and Xiang Hu and Pengyu Ji and Wei Wu and Kewei Tu},
  journal= {arXiv preprint arXiv:2406.15245},
  year   = {2025}
}

Comments

ACL 2025 Findings

R2 v1 2026-06-28T17:14:55.464Z