English
Related papers

Related papers: Breaking Character: Are Subwords Good Enough for M…

200 papers

Can pretrained language models (PLMs) generate derivationally complex words? We present the first study investigating this question, taking BERT as the example PLM. We examine BERT's derivational capabilities in different settings, ranging…

Computation and Language · Computer Science 2020-10-08 Valentin Hofmann , Janet B. Pierrehumbert , Hinrich Schütze

There is a growing body of work in recent years to develop pre-trained language models (PLMs) for the Arabic language. This work concerns addressing two major problems in existing Arabic PLMs which constraint progress of the Arabic NLU and…

As opposed to general English, many concepts in biomedical terminology have been designed in recent history by biomedical professionals with the goal of being precise and concise. This is often achieved by concatenating meaningful…

Computation and Language · Computer Science 2023-07-11 Bernal Jiménez Gutiérrez , Huan Sun , Yu Su

Masked language modeling (MLM) is one of the key sub-tasks in vision-language pretraining. In the cross-modal setting, tokens in the sentence are masked at random, and the model predicts the masked tokens given the image and the text. In…

Computation and Language · Computer Science 2021-09-07 Yonatan Bitton , Gabriel Stanovsky , Michael Elhadad , Roy Schwartz

Multilingual Language Models (\MLLMs) such as mBERT, XLM, XLM-R, \textit{etc.} have emerged as a viable option for bringing the power of pretraining to a large number of languages. Given their success in zero-shot transfer learning, there…

Computation and Language · Computer Science 2021-12-24 Sumanth Doddapaneni , Gowtham Ramesh , Mitesh M. Khapra , Anoop Kunchukuttan , Pratyush Kumar

Contextual word-representations became a standard in modern natural language processing systems. These models use subword tokenization to handle large vocabularies and unknown words. Word-level usage of such systems requires a way of…

Computation and Language · Computer Science 2021-03-30 Judit Ács , Ákos Kádár , András Kornai

Tokenisation is a core part of language models (LMs). It involves splitting a character sequence into subwords which are assigned arbitrary indices before being served to the LM. While typically lossless, however, this process may lead to…

Computation and Language · Computer Science 2024-07-18 Anton Schäfer , Thomas Hofmann , Imanol Schlag , Tiago Pimentel

Masked language modeling (MLM), a self-supervised pretraining objective, is widely used in natural language processing for learning text representations. MLM trains a model to predict a random sample of input tokens that have been replaced…

Computation and Language · Computer Science 2021-09-07 Atsuki Yamaguchi , George Chrysostomou , Katerina Margatina , Nikolaos Aletras

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

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ß

One of the challenges with finetuning pretrained language models (PLMs) is that their tokenizer is optimized for the language(s) it was pretrained on, but brittle when it comes to previously unseen variations in the data. This can for…

Computation and Language · Computer Science 2023-04-21 Verena Blaschke , Hinrich Schütze , Barbara Plank

In Spoken language understanding (SLU), a natural solution is concatenating pre-trained speech models (e.g. HuBERT) and pretrained language models (PLM, e.g. T5). Most previous works use pretrained language models with subword-based…

Computation and Language · Computer Science 2022-11-02 Chan-Jan Hsu , Ho-Lam Chung , Hung-yi Lee , Yu Tsao

Neural models that do not rely on pre-training have excelled in the keyphrase generation task with large annotated datasets. Meanwhile, new approaches have incorporated pre-trained language models (PLMs) for their data efficiency. However,…

Computation and Language · Computer Science 2024-02-26 Di Wu , Wasi Uddin Ahmad , Kai-Wei Chang

We present a new pre-trained language model (PLM) for modern Hebrew, termed AlephBERTGimmel, which employs a much larger vocabulary (128K items) than standard Hebrew PLMs before. We perform a contrastive analysis of this model against all…

Computation and Language · Computer Science 2023-05-17 Eylon Gueta , Avi Shmidman , Shaltiel Shmidman , Cheyn Shmuel Shmidman , Joshua Guedalia , Moshe Koppel , Dan Bareket , Amit Seker , Reut Tsarfaty

This work introduces an approach to assessing phrase break in ESL learners' speech with pre-trained language models (PLMs). Different with traditional methods, this proposal converts speech to token sequences, and then leverages the power…

Computation and Language · Computer Science 2022-10-31 Zhiyi Wang , Shaoguang Mao , Wenshan Wu , Yan Xia

Recently, the performance of Pre-trained Language Models (PLMs) has been significantly improved by injecting knowledge facts to enhance their abilities of language understanding. For medical domains, the background knowledge sources are…

Computation and Language · Computer Science 2021-08-23 Taolin Zhang , Zerui Cai , Chengyu Wang , Minghui Qiu , Bite Yang , Xiaofeng He

Current neural query auto-completion (QAC) systems rely on character-level language models, but they slow down when queries are long. We present how to utilize subword language models for the fast and accurate generation of query completion…

Computation and Language · Computer Science 2019-09-04 Gyuwan Kim

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

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

The widespread application of pre-trained language models (PLMs) in natural language processing (NLP) has led to increasing concerns about their explainability. Selective rationalization is a self-explanatory framework that selects…

Computation and Language · Computer Science 2025-01-07 Libing Yuan , Shuaibo Hu , Kui Yu , Le Wu