English
Related papers

Related papers: Improving Korean NLP Tasks with Linguistically Inf…

200 papers

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

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

Since state-of-the-art LLMs often underperform in languages other than English or Chinese, improving the capability of LLMs in new languages has become an essential task. Moreover, LLMs' entire end-to-end training process remains largely…

Computation and Language · Computer Science 2025-06-30 Jinpyo Kim , Gyeongje Cho , Chanwoo Park , Jongwon Park , Jongmin Kim , Yeonkyoun So , Jaejin Lee

Subword tokenization is a key design choice for modern language models, including large language models (LLMs), with byte- and character-level BPE serving as a widely used baseline. Standard BPE selects merges by raw pair frequency, which…

Computation and Language · Computer Science 2026-03-23 Azam Nouri

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

This research introduces KoGEC, a Korean Grammatical Error Correction system using pre\--trained translation models. We fine-tuned NLLB (No Language Left Behind) models for Korean GEC, comparing their performance against large language…

Computation and Language · Computer Science 2025-06-16 Taeeun Kim , Semin Jeong , Youngsook Song

Existing Machine Translation (MT) research often suggests a single, fixed set of hyperparameters for word segmentation models, symmetric Byte Pair Encoding (BPE), which applies the same number of merge operations (NMO) to train tokenizers…

Computation and Language · Computer Science 2026-02-16 Saumitra Yadav , Manish Shrivastava

In this paper, we formalize practical byte pair encoding tokenization as it is used in large language models and other NLP systems, in particular we formally define and investigate the semantics of the SentencePiece and HuggingFace…

Formal Languages and Automata Theory · Computer Science 2023-09-19 Martin Berglund , Brink van der Merwe

State-of-the-art language models are autoregressive and operate on subword units known as tokens. Specifically, one must encode the conditioning string into a list of tokens before passing to the language models for next-token prediction.…

Computation and Language · Computer Science 2024-07-09 Buu Phan , Marton Havasi , Matthew Muckley , Karen Ullrich

We incorporate morphological supervision into character language models (CLMs) via multitasking and show that this addition improves bits-per-character (BPC) performance across 24 languages, even when the morphology data and language…

Computation and Language · Computer Science 2019-06-14 Terra Blevins , Luke Zettlemoyer

The pre-trained language models have achieved great successes in various natural language understanding (NLU) tasks due to its capacity to capture the deep contextualized information in text by pre-training on large-scale corpora. One of…

Computation and Language · Computer Science 2021-06-04 Junqiu Wei , Qun Liu , Yinpeng Guo , Xin Jiang

Many NLP applications, such as biomedical data and technical support, have 10-100 million tokens of in-domain data and limited computational resources for learning from it. How should we train a language model in this scenario? Most…

Computation and Language · Computer Science 2020-10-01 Charles Welch , Rada Mihalcea , Jonathan K. Kummerfeld

An important assumption that comes with using LLMs on psycholinguistic data has gone unverified. LLM-based predictions are based on subword tokenization, not decomposition of words into morphemes. Does that matter? We carefully test this by…

Computation and Language · Computer Science 2023-10-30 Sathvik Nair , Philip Resnik

Phones and their context-dependent variants have been the standard modeling units for conventional speech recognition systems, while characters and subwords have demonstrated their effectiveness for end-to-end recognition systems. We…

Audio and Speech Processing · Electrical Eng. & Systems 2021-06-23 Weiran Wang , Guangsen Wang , Aadyot Bhatnagar , Yingbo Zhou , Caiming Xiong , Richard Socher

Simplified Chinese to Traditional Chinese character conversion is a common preprocessing step in Chinese NLP. Despite this, current approaches have poor performance because they do not take into account that a simplified Chinese character…

Computation and Language · Computer Science 2020-05-08 Pranav A , Isabelle Augenstein

Since the appearance of BERT, recent works including XLNet and RoBERTa utilize sentence embedding models pre-trained by large corpora and a large number of parameters. Because such models have large hardware and a huge amount of data, they…

Computation and Language · Computer Science 2020-08-12 Sangah Lee , Hansol Jang , Yunmee Baik , Suzi Park , Hyopil Shin

Tokenization is the first step in modern neural language model pipelines where an input text is converted to a sequence of subword tokens. We introduce from first principles a finite-state transduction framework which can efficiently encode…

Computation and Language · Computer Science 2024-10-22 Marco Cognetta , Naoaki Okazaki

The quality of subword tokenization is critical for Large Language Models, yet evaluating tokenizers for morphologically rich Uralic languages is hampered by the lack of clean morpheme lexicons. We introduce SampoNLP, a corpus-free toolkit…

Computation and Language · Computer Science 2026-01-09 Iaroslav Chelombitko , Ekaterina Chelombitko , Aleksey Komissarov

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

Recent years have brought great advances into solving morphological tasks, mostly due to powerful neural models applied to various tasks as (re)inflection and analysis. Yet, such morphological tasks cannot be considered solved, especially…

Computation and Language · Computer Science 2023-06-23 David Guriel , Omer Goldman , Reut Tsarfaty
‹ Prev 1 3 4 5 6 7 10 Next ›