Unsupervised Morphological Tree Tokenizer
Not on the map. Why?
Abstract (arXiv)
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 textitMorphOverriding 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.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 23 of its 52 references that are in the map. First posted on arXiv 21 Jun 2024.
Builds on
23 of 52 references.
References · 23
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2016Pointer Sentinel Mixture Modelscited by 2,992
- 2015Neural Machine Translation of Rare Words with Subword Unitscited by 2,898
- 2018Subword Regularization: Improving Neural Network Translation Models with Multiple Subword Candidatescited by 632
- 2020Byte Pair Encoding is Suboptimal for Language Model Pretrainingcited by 189
- 2021Between words and characters: A Brief History of Open-Vocabulary Modeling and Tokenization in NLPcited by 130
- 2021Superbizarre Is Not Superb: Derivational Morphology Improves BERT's Interpretation of Complex Wordscited by 63
- 2019Unsupervised Latent Tree Induction with Deep Inside-Outside Recursive Autoencoderscited by 60
- 2018How Much Does Tokenization Affect Neural Machine Translation?cited by 26
- 2017Jointly Learning Sentence Embeddings and Syntax with Unsupervised Tree-LSTMscited by 23
- 2021R2D2: Recursive Transformer based on Differentiable Tree for Interpretable Hierarchical Language Modelingcited by 19
- 2018Morphological and Language-Agnostic Word Segmentation for NMTcited by 16
11 more
- 2021The Effectiveness of Morphology-aware Segmentation in Low-Resource Neural Machine Translationcited by 16
- 2022Fast-R2D2: A Pretrained Recursive Neural Network based on Pruned CKY for Grammar Induction and Text Representationcited by 14
- 2023Effects of sub-word segmentation on performance of transformer language modelscited by 12
- 2020Morfessor EM+Prune: Improved Subword Segmentation with Expectation Maximization and Pruningcited by 11
- 2022Dynamic Programming in Rank Space: Scaling Structured Inference with Low-Rank HMMs and PCFGscited by 10
- 2024Generative Pretrained Structured Transformers: Unsupervised Syntactic Language Models at Scalecited by 9
- 2019Morphological Word Embeddingscited by 8
- 2023CompoundPiece: Evaluating and Improving Decompounding Performance of Language Modelscited by 7
- 2023Augmenting Transformers with Recursively Composed Multi-grained Representationscited by 5
- 2019Weakly Supervised Domain Detectioncited by 4
- 2023A Multi-Grained Self-Interpretable Symbolic-Neural Model For Single/Multi-Labeled Text Classificationcited by 4
Built on by
Not cited yet.