Tokenization with Factorized Subword Encoding

David Samuel, Lilja Øvrelid
6/13/2023
cs.CLcs.AI

No official code found. Best implementation: ltgoslo/factorizer (16 stars, GPL-3.0, last commit 2024-05-14).

Abstract

In recent years, language models have become increasingly larger and more complex. However, the input representations for these models continue to rely on simple and greedy subword tokenization methods. In this paper, we propose a novel tokenization method that factorizes subwords onto discrete triplets using a VQ-VAE model. The effectiveness of the proposed tokenization method, referred to as the Factorizer, is evaluated on language modeling and morpho-syntactic tasks for 7 diverse languages. Results indicate that this method is more appropriate and robust for morphological tasks than the commonly used byte-pair encoding (BPE) tokenization algorithm.

View on arXivView PDF

Code Implementations(1)

ltgoslo/factorizerCommunity100%
GPL-3.0
160PythonMay 16, 20232 years agoGPL-3.0

Similar Papers

Cite this paper

@article{samuel2023tokenization,
  title  = {Tokenization with Factorized Subword Encoding},
  author = {David Samuel and Lilja Øvrelid},
  year   = {2023},
  eprint = {2306.07764},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2306.07764v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2306.07764.svg)](https://codeofpaper.com/paper/2306.07764)

Discussion