English
Related papers

Related papers: LCP-dropout: Compression-based Multiple Subword Se…

200 papers

Subword segmentation is widely used to address the open vocabulary problem in machine translation. The dominant approach to subword segmentation is Byte Pair Encoding (BPE), which keeps the most frequent words intact while splitting the…

Computation and Language · Computer Science 2020-05-05 Ivan Provilkov , Dmitrii Emelianenko , Elena Voita

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

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

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 regularization methods such as BPE dropout are typically applied only during fine-tuning, while pretraining is usually done with deterministic tokenization. This creates a potential segmentation mismatch between pretraining and…

Computation and Language · Computer Science 2026-05-14 Ruan Visser , Trienko Grobler , Marcel Dunaiski

Subword segmenters like BPE operate as a preprocessing step in neural machine translation and other (conditional) language models. They are applied to datasets before training, so translation or text generation quality relies on the quality…

Computation and Language · Computer Science 2023-05-12 Francois Meyer , Jan Buys

We explore threshold vocabulary trimming in Byte-Pair Encoding subword tokenization, a postprocessing step that replaces rare subwords with their component subwords. The technique is available in popular tokenization libraries but has not…

Computation and Language · Computer Science 2024-04-02 Marco Cognetta , Tatsuya Hiraoka , Naoaki Okazaki , Rico Sennrich , Yuval Pinter

Most neural machine translation systems are built upon subword units extracted by methods such as Byte-Pair Encoding (BPE) or wordpiece. However, the choice of number of merge operations is generally made by following existing recipes. In…

Computation and Language · Computer Science 2019-06-26 Shuoyang Ding , Adithya Renduchintala , Kevin Duh

Traditional greedy tokenization methods have been a critical step in Natural Language Processing (NLP), influencing how text is converted into tokens and directly impacting model performance. While subword tokenizers like Byte-Pair Encoding…

Computation and Language · Computer Science 2025-05-05 Bharath Raj , Garvit Suri , Vikrant Dewangan , Raghav Sonavane

Natural language processing (NLP) models often require a massive number of parameters for word embeddings, resulting in a large storage or memory footprint. Deploying neural NLP models to mobile devices requires compressing the word…

Computation and Language · Computer Science 2017-11-20 Raphael Shu , Hideki Nakayama

In neural machine translation (NMT), it is has become standard to translate using subword units to allow for an open vocabulary and improve accuracy on infrequent words. Byte-pair encoding (BPE) and its variants are the predominant approach…

Computation and Language · Computer Science 2018-10-23 Elizabeth Salesky , Andrew Runge , Alex Coda , Jan Niehues , Graham Neubig

We present a subword regularization method for WordPiece, which uses a maximum matching algorithm for tokenization. The proposed method, MaxMatch-Dropout, randomly drops words in a search using the maximum matching algorithm. It realizes…

Computation and Language · Computer Science 2022-09-12 Tatsuya Hiraoka

This paper evaluates the performance of several modern subword segmentation methods in a low-resource neural machine translation setting. We compare segmentations produced by applying BPE at the token or sentence level with…

Computation and Language · Computer Science 2024-05-17 Jonne Sälevä , Constantine Lignos

A popular approach to sentence compression is to formulate the task as a constrained optimization problem and solve it with integer linear programming (ILP) tools. Unfortunately, dependence on ILP may make the compressor prohibitively slow,…

Computation and Language · Computer Science 2015-10-29 Katja Filippova , Enrique Alfonseca

Recent dynamic tokenisation methods operate directly on bytes and pool their latent representations into patches. This bears similarities to computational models of word segmentation that determine lexical boundaries using spikes in an…

Computation and Language · Computer Science 2025-06-24 Zébulon Goriely , Suchir Salhan , Pietro Lesci , Julius Cheng , Paula Buttery

Multilingual modelling can improve machine translation for low-resource languages, partly through shared subword representations. This paper studies the role of subword segmentation in cross-lingual transfer. We systematically compare the…

Computation and Language · Computer Science 2024-04-01 Francois Meyer , Jan Buys

Tokenization is a foundational step in natural language processing (NLP) tasks, bridging raw text and language models. Existing tokenization approaches like Byte-Pair Encoding (BPE) originate from the field of data compression, and it has…

Computation and Language · Computer Science 2024-10-08 Craig W. Schmidt , Varshini Reddy , Haoran Zhang , Alec Alameddine , Omri Uzan , Yuval Pinter , Chris Tanner

Subword tokenization methods, such as Byte-Pair Encoding (BPE), significantly impact the performance and efficiency of large language models (LLMs). The standard approach involves training a general-purpose tokenizer that uniformly…

Computation and Language · Computer Science 2026-01-30 Vijini Liyanage , François Yvon

Pipeline-parallel distributed optimization is essential for large-scale machine learning but is challenged by significant communication overhead from transmitting high-dimensional activations and gradients between workers. Existing…

Optimization and Control · Mathematics 2025-09-24 Boao Kong , Xu Huang , Yuqi Xu , Yixuan Liang , Bin Wang , Kun Yuan

Data-driven subword segmentation has become the default strategy for open-vocabulary machine translation and other NLP tasks, but may not be sufficiently generic for optimal learning of non-concatenative morphology. We design a test suite…

Computation and Language · Computer Science 2021-09-03 Chantal Amrhein , Rico Sennrich
‹ Prev 1 2 3 10 Next ›