English
Related papers

Related papers: Improving Tokenisation by Alternative Treatment of…

200 papers

Subword tokenization has become the prevailing standard in the field of natural language processing (NLP) over recent years, primarily due to the widespread utilization of pre-trained language models. This shift began with Byte-Pair…

Computation and Language · Computer Science 2024-06-11 Yanis Labrak , Adrien Bazoge , Beatrice Daille , Mickael Rouvier , Richard Dufour

Language models can largely benefit from efficient tokenization. However, they still mostly utilize the classical BPE algorithm, a simple and reliable method. This has been shown to cause such issues as under-trained tokens and sub-optimal…

Computation and Language · Computer Science 2024-09-10 Pavel Chizhov , Catherine Arnett , Elizaveta Korotkova , Ivan P. Yamshchikov

Traditionally, NLP performance improvement has been focused on improving models and increasing the number of model parameters. NLP vocabulary construction has remained focused on maximizing the number of words represented through subword…

Computation and Language · Computer Science 2023-04-26 Sandeep Mehta , Darpan Shah , Ravindra Kulkarni , Cornelia Caragea

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…

Computation and Language · Computer Science 2023-04-24 Tatsuya Hiraoka , Tomoya Iwakura

Tokenization is a crucial step in information retrieval, especially for lexical matching algorithms, where the quality of indexable tokens directly impacts the effectiveness of a retrieval system. Since different languages have unique…

Computation and Language · Computer Science 2022-10-12 Odunayo Ogundepo , Xinyu Zhang , Jimmy Lin

Subword regularization, used widely in NLP, improves model performance by reducing the dependency on exact tokenizations, augmenting the training corpus, and exposing the model to more unique contexts during training. BPE and MaxMatch, two…

Computation and Language · Computer Science 2024-08-22 Marco Cognetta , Vilém Zouhar , Naoaki Okazaki

Subword tokenization schemes are the dominant technique used in current NLP models. However, such schemes can be rigid and tokenizers built on one corpus do not adapt well to other parallel corpora. It has also been observed that in…

Computation and Language · Computer Science 2023-06-29 Makesh Narsimhan Sreedhar , Xiangpeng Wan , Yu Cheng , Junjie Hu

Transformers are responsible for the vast majority of recent advances in natural language processing. The majority of practical natural language processing applications of these models are typically enabled through transfer learning. This…

Computation and Language · Computer Science 2024-02-02 Vladislav Mosin , Igor Samenko , Alexey Tikhonov , Borislav Kozlovskii , Ivan P. Yamshchikov

Large Language Models (LLMs) are gaining popularity and improving rapidly. Tokenizers are crucial components of natural language processing, especially for LLMs. Tokenizers break down input text into tokens that models can easily process…

Computation and Language · Computer Science 2025-09-22 Tandin Wangchuk , Tad Gonsalves

When applying machine learning to problems in NLP, there are many choices to make about how to represent input texts. These choices can have a big effect on performance, but they are often uninteresting to researchers or practitioners who…

Computation and Language · Computer Science 2015-03-03 Dani Yogatama , Noah A. Smith

Subword tokenization critically affects Natural Language Processing (NLP) performance, yet its behavior in morphologically rich and low-resource language families remains under-explored. This study systematically compares three subword…

Computation and Language · Computer Science 2026-03-31 Nuo Xu , Ahrii Kim

Variation in language is ubiquitous and often systematically linked to regional, social, and contextual factors. Tokenizers split texts into smaller units and might behave differently for less common linguistic forms. This might affect…

Computation and Language · Computer Science 2025-07-08 Anna Wegmann , Dong Nguyen , David Jurgens

Tokenization is a fundamental step in natural language processing, breaking text into units that computational models can process. While learned subword tokenizers have become the de-facto standard, they present challenges such as large…

Computation and Language · Computer Science 2025-01-22 Pit Neitemeier , Björn Deiseroth , Constantin Eichenberg , Lukas Balles

Tokenization is the first - and often underappreciated - layer of computation in language models. While Chain-of-Thought (CoT) prompting enables transformer models to approximate recurrent computation by externalizing intermediate steps, we…

Computation and Language · Computer Science 2025-05-21 Xiang Zhang , Juntai Cao , Jiaqi Wei , Yiwei Xu , Chenyu You

The impact of subword tokenization on language model performance is well-documented for perplexity, with finer granularity consistently reducing this intrinsic metric. However, research on how different tokenization schemes affect a model's…

Computation and Language · Computer Science 2025-08-12 Nishant Luitel , Nirajan Bekoju , Anand Kumar Sah , Subarna Shakya

Tokenization is a foundational step in the text process of Large Language Models (LLMs). Texts must be first tokenized into token IDs, which are then input to LLMs. Inefficient tokenization results in long token-ID sequences and will slow…

Computation and Language · Computer Science 2026-05-14 Chong Li , Yingzhuo Deng , Wen Yang , Jiajun Zhang , Chengqing Zong

Prior research has demonstrated noticeable performance gains through the use of probabilistic tokenizations, an approach that involves employing multiple tokenizations of the same input string during the training phase of a language model.…

Computation and Language · Computer Science 2024-07-08 Ashutosh Sathe , Divyanshu Aggarwal , Sunayana Sitaram

Language models typically tokenize raw text into sequences of subword identifiers from a predefined vocabulary, a process inherently sensitive to typographical errors, length variations, and largely oblivious to the internal structure of…

Computation and Language · Computer Science 2024-10-07 Yekun Chai , Yewei Fang , Qiwei Peng , Xuhong Li

Transformers achieve unrivalled performance in modelling language, but remain inefficient in terms of memory and time complexity. A possible remedy is to reduce the sequence length in the intermediate layers by pooling fixed-length segments…

Computation and Language · Computer Science 2023-10-25 Piotr Nawrot , Jan Chorowski , Adrian Łańcucki , Edoardo M. Ponti

Tokenization is the first step in training any Large Language Model (LLM), where the text is split into a sequence of tokens as per the model's fixed vocabulary. This tokenization in LLMs is different from the traditional tokenization in…

Computation and Language · Computer Science 2025-12-29 Sachin Pawar , Manoj Apte , Kshitij Jadhav , Girish Keshav Palshikar , Nitin Ramrakhiyani