English
Related papers

Related papers: CharBERT: Character-aware Pre-trained Language Mod…

200 papers

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

Pretrained language models (PLMs) have shown marvelous improvements across various NLP tasks. Most Chinese PLMs simply treat an input text as a sequence of characters, and completely ignore word information. Although Whole Word Masking can…

Computation and Language · Computer Science 2023-03-23 Xinnian Liang , Zefan Zhou , Hui Huang , Shuangzhi Wu , Tong Xiao , Muyun Yang , Zhoujun Li , Chao Bian

Despite the development of pre-trained language models (PLMs) significantly raise the performances of various Chinese natural language processing (NLP) tasks, the vocabulary for these Chinese PLMs remain to be the one provided by Google…

Computation and Language · Computer Science 2020-11-18 Wei Zhu

Pre-trained Language Model (PLM) has become a representative foundation model in the natural language processing field. Most PLMs are trained with linguistic-agnostic pre-training tasks on the surface form of the text, such as the masked…

Computation and Language · Computer Science 2022-11-11 Yiming Cui , Wanxiang Che , Shijin Wang , Ting Liu

Recent years have witnessed the burgeoning of pretrained language models (LMs) for text-based natural language (NL) understanding tasks. Such models are typically trained on free-form NL text, hence may not be suitable for tasks like…

Computation and Language · Computer Science 2020-05-19 Pengcheng Yin , Graham Neubig , Wen-tau Yih , Sebastian Riedel

Most of the Chinese pre-trained models adopt characters as basic units for downstream tasks. However, these models ignore the information carried by words and thus lead to the loss of some important semantics. In this paper, we propose a…

Computation and Language · Computer Science 2022-07-14 Wenbiao Li , Rui Sun , Yunfang Wu

Pre-trained Language Models (PLMs) have been widely used in various natural language processing (NLP) tasks, owing to their powerful text representations trained on large-scale corpora. In this paper, we propose a new PLM called PERT for…

Computation and Language · Computer Science 2022-03-15 Yiming Cui , Ziqing Yang , Ting Liu

Bidirectional Encoder Representations from Transformers (BERT) has shown marvelous improvements across various NLP tasks, and consecutive variants have been proposed to further improve the performance of the pre-trained language models. In…

Computation and Language · Computer Science 2020-12-14 Yiming Cui , Wanxiang Che , Ting Liu , Bing Qin , Shijin Wang , Guoping Hu

Pre-trained language models such as BERT have exhibited remarkable performances in many tasks in natural language understanding (NLU). The tokens in the models are usually fine-grained in the sense that for languages like English they are…

Computation and Language · Computer Science 2021-05-28 Xinsong Zhang , Pengshuai Li , Hang Li

Pre-trained models are widely used in the tasks of natural language processing nowadays. However, in the specific field of text simplification, the research on improving pre-trained models is still blank. In this work, we propose a…

Computation and Language · Computer Science 2022-04-19 Renliang Sun , Xiaojun Wan

With the widespread of digital environments, reliable authentication and continuous access control has become crucial. It can minimize cyber attacks and prevent frauds, specially those associated with identity theft. A particular interest…

Cryptography and Security · Computer Science 2024-11-12 Matheus Simão , Fabiano Prado , Omar Abdul Wahab , Anderson Avila

Due to the compelling improvements brought by BERT, many recent representation models adopted the Transformer architecture as their main building block, consequently inheriting the wordpiece tokenization system despite it not being…

Computation and Language · Computer Science 2020-11-03 Hicham El Boukkouri , Olivier Ferret , Thomas Lavergne , Hiroshi Noji , Pierre Zweigenbaum , Junichi Tsujii

Byte-pair encoding (BPE) is a ubiquitous algorithm in the subword tokenization process of language models as it provides multiple benefits. However, this process is solely based on pre-training data statistics, making it hard for the…

Computation and Language · Computer Science 2021-09-27 Gustavo Aguilar , Bryan McCann , Tong Niu , Nazneen Rajani , Nitish Keskar , Thamar Solorio

Pre-trained language models (PLMs) that use subword tokenization schemes can succeed at a variety of language tasks that require character-level information, despite lacking explicit access to the character composition of tokens. Here,…

Computation and Language · Computer Science 2022-06-07 Ayush Kaushal , Kyle Mahowald

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

We introduce a new pre-trainable generic representation for visual-linguistic tasks, called Visual-Linguistic BERT (VL-BERT for short). VL-BERT adopts the simple yet powerful Transformer model as the backbone, and extends it to take both…

Computer Vision and Pattern Recognition · Computer Science 2020-02-19 Weijie Su , Xizhou Zhu , Yue Cao , Bin Li , Lewei Lu , Furu Wei , Jifeng Dai

Pre-trained language models (PLMs) aim to learn universal language representations by conducting self-supervised training tasks on large-scale corpora. Since PLMs capture word semantics in different contexts, the quality of word…

Computation and Language · Computer Science 2022-03-22 Wenhao Yu , Chenguang Zhu , Yuwei Fang , Donghan Yu , Shuohang Wang , Yichong Xu , Michael Zeng , Meng Jiang

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

Modern language models mostly take sub-words as input, a design that balances the trade-off between vocabulary size, number of parameters, and performance. However, sub-word tokenization still has disadvantages like not being robust to…

Computation and Language · Computer Science 2022-11-24 Chu-Tak Lee , Qipeng Guo , Xipeng Qiu

Although pre-trained language models (PLMs) have achieved state-of-the-art performance on various natural language processing (NLP) tasks, they are shown to be lacking in knowledge when dealing with knowledge driven tasks. Despite the many…

Computation and Language · Computer Science 2022-08-02 Qianglong Chen , Feng-Lin Li , Guohai Xu , Ming Yan , Ji Zhang , Yin Zhang
‹ Prev 1 2 3 10 Next ›