Downstream Task-Oriented Neural Tokenizer Optimization with Vocabulary Restriction as Post Processing

Tatsuya Hiraoka, Tomoya Iwakura
4/21/2023
cs.CL

No confident code implementation found for this paper.

Abstract

This paper proposes a method to optimize tokenization for the performance improvement of already trained downstream models. Our method generates tokenization results attaining lower loss values of a given downstream model on the training data for restricting vocabularies and trains a tokenizer reproducing the tokenization results. Therefore, our method can be applied to variety of tokenization methods, while existing work cannot due to the simultaneous learning of the tokenizer and the downstream model. This paper proposes an example of the BiLSTM-based tokenizer with vocabulary restriction, which can capture wider contextual information for the tokenization process than non-neural-based tokenization methods used in existing work. Experimental results on text classification in Japanese, Chinese, and English text classification tasks show that the proposed method improves performance compared to the existing methods for tokenization optimization.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{hiraoka2023downstream,
  title  = {Downstream Task-Oriented Neural Tokenizer Optimization with Vocabulary Restriction as Post Processing},
  author = {Tatsuya Hiraoka and Tomoya Iwakura},
  year   = {2023},
  eprint = {2304.10808},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2304.10808v1}
}

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/2304.10808.svg)](https://codeofpaper.com/paper/2304.10808)

Discussion