Our new X account is live! Follow @wizwand_team for updates
WorkDL logo mark

Tokenization with Factorized Subword Encoding

About

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.

David Samuel, Lilja {\O}vrelid• 2023

Related benchmarks

TaskDatasetResultRank
Dependency ParsingUD Treebank Arabic (test)
LAS87.05
11
Dependency Parsingzh gsd CoNLL 2018 Shared Task (test)
LAS86.39
5
Morpho-syntactic ParsingUniversal Dependencies English en-ewt (test)
UPOS Accuracy97.9
4
Morpho-syntactic ParsingUniversal Dependencies Scottish Gaelic (gd-arcosg) (test)
UPOS97.78
4
Morpho-syntactic ParsingUniversal Dependencies Norwegian (no-bokmaal) (test)
UPOS Accuracy98.9
4
Morpho-syntactic ParsingUniversal Dependencies Turkish tr-kenet (test)
UPOS93.94
4
Morpho-syntactic ParsingUniversal Dependencies Czech cs-pdt (test)
UPOS99.39
4
Showing 7 of 7 rows

Other info

Code

Follow for update