English
Related papers

Related papers: Unsupervised Morphological Tree Tokenizer

200 papers

Large language models are trained with tokenizers, and the resulting token distribution is highly imbalanced: a few words dominate the stream while most occur rarely. Recent practice favors ever-larger vocabularies, but it is unclear where…

Computation and Language · Computer Science 2025-12-01 Woojin Chung , Jeonghoon Kim

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

Dealing with the complex word forms in morphologically rich languages is an open problem in language processing, and is particularly important in translation. In contrast to most modern neural systems of translation, which discard the…

Neural and Evolutionary Computing · Computer Science 2016-06-15 Ekaterina Vylomova , Trevor Cohn , Xuanli He , Gholamreza Haffari

Finding an optimal word representation algorithm is particularly important in terms of domain specific data, as the same word can have different meanings and hence, different representations depending on the domain and context. While…

Computation and Language · Computer Science 2025-10-09 Nouman Ahmed , Ronin Wu , Victor Botev

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

Recent advances in large language models enable documents to be represented as dense semantic embeddings, supporting similarity-based operations over large text collections. However, many web-scale systems still rely on flat clustering or…

Computation and Language · Computer Science 2026-01-30 Thomas Haschka , Joseph Bakarji

There are two major classes of natural language grammar -- the dependency grammar that models one-to-one correspondences between words and the constituency grammar that models the assembly of one or several corresponded words. While…

Computation and Language · Computer Science 2021-07-13 Yikang Shen , Yi Tay , Che Zheng , Dara Bahri , Donald Metzler , Aaron Courville

This paper focuses on unsupervised modeling of morphological families, collectively comprising a forest over the language vocabulary. This formulation enables us to capture edgewise properties reflecting single-step morphological…

Computation and Language · Computer Science 2017-02-24 Jiaming Luo , Karthik Narasimhan , Regina Barzilay

A central challenge in developing Multimodal Large Language Models (MLLMs) is effectively integrating heterogeneous inputs into a cohesive reasoning engine. Current paradigms predominantly rely on modular architectures that introduce…

Genomics · Quantitative Biology 2026-05-12 Yanan Li , Christina Yi Jin , Yuan Jin , Manli Luo , Tie Xu , Shuai Jiao , Wei He , Qing Zhang

While many languages possess processes of joining two or more words to create compound words, previous studies have been typically limited only to languages with excessively productive compound formation (e.g., German, Dutch) and there is…

Computation and Language · Computer Science 2023-10-24 Benjamin Minixhofer , Jonas Pfeiffer , Ivan Vulić

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

How to boost speech pre-training with textual data is an unsolved problem due to the fact that speech and text are very different modalities with distinct characteristics. In this paper, we propose a cross-modal Speech and Language Model…

Computation and Language · Computer Science 2023-06-16 Ziqiang Zhang , Sanyuan Chen , Long Zhou , Yu Wu , Shuo Ren , Shujie Liu , Zhuoyuan Yao , Xun Gong , Lirong Dai , Jinyu Li , Furu Wei

Modern language models are typically trained over subword sequences, but ultimately define probabilities over character-strings. Ideally, the choice of the tokeniser -- which maps character-strings to subwords -- should not affect the…

Computation and Language · Computer Science 2025-06-04 Pietro Lesci , Clara Meister , Thomas Hofmann , Andreas Vlachos , Tiago Pimentel

Inferring topological and geometrical information from data can offer an alternative perspective on machine learning problems. Methods from topological data analysis, e.g., persistent homology, enable us to obtain such information,…

Computer Vision and Pattern Recognition · Computer Science 2018-02-19 Christoph Hofer , Roland Kwitt , Marc Niethammer , Andreas Uhl

Learning discriminative global features plays a vital role in semantic segmentation. And most of the existing methods adopt stacks of local convolutions or non-local blocks to capture long-range context. However, due to the absence of…

Computer Vision and Pattern Recognition · Computer Science 2019-09-30 Lin Song , Yanwei Li , Zeming Li , Gang Yu , Hongbin Sun , Jian Sun , Nanning Zheng

Subword tokenization methods like Byte Pair Encoding (BPE) are widely used in large language models due to their balance of vocabulary compactness and representational power. However, they suffer from inefficiencies in representing rare…

Computation and Language · Computer Science 2025-10-20 Rares Dolga , Lucas Maystre , Tudor Berariu , David Barber

In this paper, we focus on the problem of unsupervised image-sentence matching. Existing research explores to utilize document-level structural information to sample positive and negative instances for model training. Although the approach…

Computer Vision and Pattern Recognition · Computer Science 2021-04-07 Zejun Li , Zhongyu Wei , Zhihao Fan , Haijun Shan , Xuanjing Huang

Large language models (LLMs) trained with canonical tokenization exhibit surprising robustness to non-canonical inputs such as character-level tokenization, yet the mechanisms underlying this robustness remain unclear. We study this…

Computation and Language · Computer Science 2026-03-12 Zhipeng Yang , Shu Yang , Lijie Hu , Di Wang

In settings where only unlabelled speech data is available, speech technology needs to be developed without transcriptions, pronunciation dictionaries, or language modelling text. A similar problem is faced when modelling infant language…

Computation and Language · Computer Science 2016-03-10 Herman Kamper , Aren Jansen , Sharon Goldwater

Tokenizers act as a bridge between human language and the latent space of language models, influencing how language is represented in these models. Due to the immense popularity of English-Centric Large Language Models (LLMs), efforts are…

Computation and Language · Computer Science 2025-01-22 Menan Velayuthan , Kengatharaiyer Sarveswaran
‹ Prev 1 8 9 10 Next ›