English
Related papers

Related papers: What do tokens know about their characters and how…

200 papers

Language models (LMs) have been reported to implicitly encode character-level information, despite not being explicitly provided during training. However, the mechanisms underlying this phenomenon remain largely unexplored. To reveal the…

Computation and Language · Computer Science 2026-02-06 Soma Sato , Ryohei Sasano

Standard pretrained language models operate on sequences of subword tokens without direct access to the characters that compose each token's string representation. We probe the embedding layer of pretrained language models and show that…

Computation and Language · Computer Science 2022-06-09 Itay Itzhak , Omer Levy

Understanding how and what pre-trained language models (PLMs) learn about language is an open challenge in natural language processing. Previous work has focused on identifying whether they capture semantic and syntactic information, and…

Computation and Language · Computer Science 2023-10-27 Ahmed Alajrami , Katerina Margatina , Nikolaos Aletras

Large language models (LLMs) can spell out tokens character by character with high accuracy, yet they struggle with more complex character-level tasks, such as identifying compositional subcomponents within tokens. In this work, we…

Computation and Language · Computer Science 2025-06-13 Tatsuya Hiraoka , Kentaro Inui

Large pretrained language models (PLMs) typically tokenize the input string into contiguous subwords before any pretraining or inference. However, previous studies have claimed that this form of subword tokenization is inadequate for…

Computation and Language · Computer Science 2022-04-12 Omri Keren , Tal Avinari , Reut Tsarfaty , Omer Levy

Most pretrained language models rely on subword tokenization, which processes text as a sequence of subword tokens. However, different granularities of text, such as characters, subwords, and words, can contain different kinds of…

Computation and Language · Computer Science 2024-04-09 Yilin Wang , Xinyi Hu , Matthew R. Gormley

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

Tokenization is fundamental to pretrained language models (PLMs). Existing tokenization methods for Chinese PLMs typically treat each character as an indivisible token. However, they ignore the unique feature of the Chinese writing system…

Computation and Language · Computer Science 2023-02-16 Chenglei Si , Zhengyan Zhang , Yingfa Chen , Fanchao Qi , Xiaozhi Wang , Zhiyuan Liu , Yasheng Wang , Qun Liu , Maosong Sun

Commonly-used transformer language models depend on a tokenization schema which sets an unchangeable subword vocabulary prior to pre-training, destined to be applied to all downstream tasks regardless of domain shift, novel word formations,…

Computation and Language · Computer Science 2021-08-03 Yuval Pinter , Amanda Stent , Mark Dredze , Jacob Eisenstein

Do pretrained language models have knowledge regarding the surface information of tokens? We examined the surface information stored in word or subword embeddings acquired by pretrained language models from the perspectives of token length,…

Computation and Language · Computer Science 2024-02-23 Tatsuya Hiraoka , Naoaki Okazaki

In this paper we investigate the linguistic knowledge learned by a Neural Language Model (NLM) before and after a fine-tuning process and how this knowledge affects its predictions during several classification problems. We use a wide set…

Computation and Language · Computer Science 2024-02-27 Alessio Miaschi , Dominique Brunato , Felice Dell'Orletta , Giulia Venturi

Character-level language models obviate the need for separately trained tokenizers, but efficiency suffers from longer sequence lengths. Learning to combine character representations into tokens has made training these models more…

Computation and Language · Computer Science 2023-11-16 William Fleshman , Benjamin Van Durme

Despite their remarkable progress across diverse domains, Large Language Models (LLMs) consistently fail at simple character-level tasks, such as counting letters in words, due to a fundamental limitation: tokenization. In this work, we…

Computation and Language · Computer Science 2025-09-17 Adrian Cosma , Stefan Ruseti , Emilian Radoi , Mihai Dascalu

This paper aims to benchmark recent progress in language understanding models that output contextualised representations at the character level. Many such modelling architectures and methods to train those architectures have been proposed,…

Computation and Language · Computer Science 2023-05-10 Kris Cao

Language models typically tokenize text into subwords, using a deterministic, hand-engineered heuristic of combining characters into longer surface-level strings such as 'ing' or whole words. Recent literature has repeatedly shown the…

Computation and Language · Computer Science 2023-10-19 Avijit Thawani , Saurabh Ghanekar , Xiaoyuan Zhu , Jay Pujara

Modern language models are internally -- and mathematically -- distributions over $\it{token}$ strings rather than $\it{character}$ strings, posing numerous challenges for programmers building user applications on top of them. For example,…

Computation and Language · Computer Science 2025-06-11 Tim Vieira , Ben LeBrun , Mario Giulianelli , Juan Luis Gastaldi , Brian DuSell , John Terilla , Timothy J. O'Donnell , Ryan Cotterell

We study word learning in subword and character language models with the psycholinguistic lexical decision task. While subword LMs struggle to discern words and non-words with high accuracy, character LMs solve this task easily and…

Computation and Language · Computer Science 2025-06-03 Bastian Bunzeck , Sina Zarrieß

Character-level features are currently used in different neural network-based natural language processing algorithms. However, little is known about the character-level patterns those models learn. Moreover, models are often compared only…

Computation and Language · Computer Science 2018-08-30 Fréderic Godin , Kris Demuynck , Joni Dambre , Wesley De Neve , Thomas Demeester

Natural language is composed of words, but modern large language models (LLMs) process sub-words as input. A natural question raised by this discrepancy is whether LLMs encode words internally, and if so how. We present evidence that LLMs…

Computation and Language · Computer Science 2025-03-04 Guy Kaplan , Matanel Oren , Yuval Reif , Roy Schwartz

In most cases, word embeddings are learned only from raw tokens or in some cases, lemmas. This includes pre-trained language models like BERT. To investigate on the potential of capturing deeper relations between lexical items and…

Computation and Language · Computer Science 2022-06-07 Juuso Eronen , Michal Ptaszynski , Fumito Masui
‹ Prev 1 2 3 10 Next ›