arXiv Machine Learning By Violeta Kastreva, Philip Whittington, Dennis Komm, Tiago Pimentel

Tokenisation over Bounded Alphabets is Hard

Read the original on arXiv Machine Learning →

arXiv:2511. 15709v2 Announce Type: replace-cross Abstract: Recent works have shown that tokenisation is NP-complete.

Summary generated by The Flow from the publisher's feed. The full article lives at arXiv Machine Learning.

arXiv AI
Aug 11

Length-MAX Tokenizer for Language Models

arXiv:2511. 20849v2 Announce Type: replace-cross Abstract: We introduce a new tokenizer for language models that minimizes the average tokens per character, thereby reducing the number of tokens needed to represent text during training and to generate text during inference.

By Dong Dong, Weijie Su
arXiv Machine Learning
22h ago

Large Language Models: A Mathematical Formulation

arXiv:2601. 22170v2 Announce Type: replace-cross Abstract: Large language models (LLMs) process and predict sequences containing text to answer questions, and address tasks including document summarization, providing recommendations, writing software and solving quantitative problems.

By Ricardo Baptista, Andrew Stuart, Son Tran
arXiv Machine Learning
Jul 28

BHARATI: Morphology-Aware Tokenizers for Classical Indian Languages with Subword Fertility Analysis

arXiv:2607. 23319v1 Announce Type: cross Abstract: Standard subword tokenization algorithms such as Byte-Pair Encoding (BPE) and SentencePiece are trained predominantly on modern language corpora and produce inefficient segmentations when applied to classical Indian languages.

By Poornima Kumaresan, Pavithra Muruganantham, Lakshmi Rajendran, Santhosh Sivasubramani