English
Related papers

Related papers: Byte Pair Encoding is Suboptimal for Language Mode…

200 papers

Multilingual automatic speech recognition (ASR) requires tokenization that efficiently covers many writing systems. Byte-level BPE (BBPE) using UTF-8 is widely adopted for its language-agnostic design and full Unicode coverage, but its…

Computation and Language · Computer Science 2026-02-03 Hyunsik Kim , Haeri Kim , Munhak Lee , Kyungmin Lee

We investigate tokenization strategies for Kurdish word embeddings by comparing word-level, morpheme-based, and BPE approaches on morphological similarity preservation tasks. We develop a BiLSTM-CRF morphological segmenter using…

Computation and Language · Computer Science 2025-11-19 Ali Salehi , Cassandra L. Jacobs

Data-driven segmentation of words into subword units has been used in various natural language processing applications such as automatic speech recognition and statistical machine translation for almost 20 years. Recently it has became more…

Computation and Language · Computer Science 2020-03-09 Stig-Arne Grönroos , Sami Virpioja , Mikko Kurimo

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 an important preprocessing step in the training and inference of large language models (LLMs). While there has been extensive research on the expressive power of the neural achitectures used in LLMs, the impact of…

Computation and Language · Computer Science 2024-12-05 Saibo Geng , Sankalp Gambhir , Chris Wendler , Robert West

Most pre-trained language models (PLMs) construct word representations at subword level with Byte-Pair Encoding (BPE) or its variations, by which OOV (out-of-vocab) words are almost avoidable. However, those methods split a word into…

Computation and Language · Computer Science 2021-05-17 Wentao Ma , Yiming Cui , Chenglei Si , Ting Liu , Shijin Wang , Guoping Hu

Pre-trained language model representations have been successful in a wide range of language understanding tasks. In this paper, we examine different strategies to integrate pre-trained representations into sequence to sequence models and…

Computation and Language · Computer Science 2019-04-02 Sergey Edunov , Alexei Baevski , Michael Auli

Large language models (LLMs) require iterative updates to address the outdated information problem, where LLM unlearning offers an approach for selective removal. However, mainstream unlearning methods primarily rely on fine-tuning…

Computation and Language · Computer Science 2025-09-29 Miao Yu , Liang Lin , Guibin Zhang , Xinfeng Li , Junfeng Fang , Xingrui Yu , Ivor Tsang , Ningyu Zhang , Kun Wang , Yang Wang

Language model pre-training based on large corpora has achieved tremendous success in terms of constructing enriched contextual representations and has led to significant performance gains on a diverse range of Natural Language…

Computation and Language · Computer Science 2021-08-04 Weidong Guo , Mingjun Zhao , Lusheng Zhang , Di Niu , Jinwen Luo , Zhenhua Liu , Zhenyang Li , Jianbo Tang

We propose to pre-train a unified language model for both autoencoding and partially autoregressive language modeling tasks using a novel training procedure, referred to as a pseudo-masked language model (PMLM). Given an input text with…

Computation and Language · Computer Science 2020-03-02 Hangbo Bao , Li Dong , Furu Wei , Wenhui Wang , Nan Yang , Xiaodong Liu , Yu Wang , Songhao Piao , Jianfeng Gao , Ming Zhou , Hsiao-Wuen Hon

While there has been a large body of research attempting to circumvent tokenization for language modeling (Clark et al., 2022; Xue et al., 2022), the current consensus is that it is a necessary initial step for designing state-of-the-art…

Computation and Language · Computer Science 2025-04-11 Nived Rajaraman , Jiantao Jiao , Kannan Ramchandran

The cold-start issue is the challenge when we talk about recommender systems, especially in the case when we do not have the past interaction data of new users or new items. Content-based features or hybrid solutions are common as…

Information Retrieval · Computer Science 2025-09-17 Yushang Zhao , Xinyue Han , Qian Leng , Qianyi Sun , Haotian Lyu , Chengrui Zhou

Subword tokenization has become the de-facto standard for tokenization, although comparative evaluations of subword vocabulary quality across languages are scarce. Existing evaluation studies focus on the effect of a tokenization algorithm…

Computation and Language · Computer Science 2023-10-23 Lisa Beinborn , Yuval Pinter

Tokenization is fundamental to how language models represent and process text, yet the behavior of widely used BPE tokenizers has received far less study than model architectures and training. In this paper, we investigate intermediate…

Computation and Language · Computer Science 2026-02-05 Yike Sun , Haotong Yang , Zhouchen Lin , Muhan Zhang

Tokenization is fundamental to Natural Language Processing (NLP), directly impacting model efficiency and linguistic fidelity. While Byte Pair Encoding (BPE) is widely used in Large Language Models (LLMs), it often disregards morpheme…

Computation and Language · Computer Science 2025-02-04 Ehsaneddin Asgari , Yassine El Kheir , Mohammad Ali Sadraei Javaheri

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

This paper presents a comprehensive examination of the impact of tokenization strategies and vocabulary sizes on the performance of Arabic language models in downstream natural language processing tasks. Our investigation focused on the…

Computation and Language · Computer Science 2024-09-23 Mohamed Taher Alrefaie , Nour Eldin Morsy , Nada Samir

This paper introduces Dynamic Programming Encoding (DPE), a new segmentation algorithm for tokenizing sentences into subword units. We view the subword segmentation of output sentences as a latent variable that should be marginalized out…

Computation and Language · Computer Science 2020-08-04 Xuanli He , Gholamreza Haffari , Mohammad Norouzi

Pipelined NLP systems have largely been superseded by end-to-end neural modeling, yet nearly all commonly-used models still require an explicit tokenization step. While recent tokenization approaches based on data-derived subword lexicons…

Computation and Language · Computer Science 2022-05-19 Jonathan H. Clark , Dan Garrette , Iulia Turc , John Wieting

Sub-word segmentation is an essential pre-processing step for Neural Machine Translation (NMT). Existing work has shown that neural sub-word segmenters are better than Byte-Pair Encoding (BPE), however, they are inefficient as they require…

Computation and Language · Computer Science 2023-08-01 Haiyue Song , Raj Dabre , Chenhui Chu , Sadao Kurohashi , Eiichiro Sumita
‹ Prev 1 4 5 6 7 8 10 Next ›