The Architecture of Language Discretisation

This comprehensive analysis investigates the critical role of tokenisation—the conversion of continuous text into discrete numerical representations—within the architecture of large language models (LLMs). It argues that this process, far from being a simple preprocessing step, fundamentally dictates a model's computational efficiency, morphological understanding, and inherent linguistic biases. The presentation begins by tracing the historical evolution from semantically rich but vocabulary-heavy word-level tokenisation to computationally expensive character-level methods, establishing the context for the rise of subword algorithms like Byte-Pair Encoding (BPE). Through a controlled experiment tokenising a literary corpus, the analysis reveals counterintuitive results where a naive whitespace-based tokeniser achieves superior compression to a sophisticated GPT-2 BPE model, exposing architectural flaws in how BPE handles whitespace and fragments text. This leads to a deeper examination of the tangible consequences of tokenisation, including cognitive blind spots in models (such as the inability to count characters in a word), degraded arithmetic reasoning, and a significant "multilingual token tax" that financially and computationally disadvantages non-English users. Critically, the presentation debunks the long-held assumption that maximal text compression yields superior model performance, highlighting research that shows overly optimised tokenisers can underperform by violating natural linguistic structures. In response to these limitations, the analysis explores the architectural frontier, detailing promising solutions such as SuperBPE, which captures multi-word expressions by bridging spaces, and the more radical Byte-Level Transformer (BLT) paradigm, which aims to eliminate tokenisation entirely by processing raw byte streams. The work concludes that the future of the field lies in moving beyond the rigid constraints of static subword vocabularies toward more flexible, equitable, and architecturally native systems that better reflect the fluid reality of human language.

Authors

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-03-16
DOI
https://doi.org/10.5281/zenodo.19057340
Primary Topic
Topic Modeling
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

The Architecture of Language Discretisation

Partha Majumdar
Zenodo (CERN European Organization for Nuclear Research)
Topic Modeling
article

The Architecture of Language Discretisation

Partha Majumdar
article en

Abstract

This comprehensive analysis investigates the critical role of tokenisation—the conversion of continuous text into discrete numerical representations—within the architecture of large language models (LLMs). It argues that this process, far from being a simple preprocessing step, fundamentally dictates a model's computational efficiency, morphological understanding, and inherent linguistic biases. The presentation begins by tracing the historical evolution from semantically rich but vocabulary-heavy word-level tokenisation to computationally expensive character-level methods, establishing the context for the rise of subword algorithms like Byte-Pair Encoding (BPE). Through a controlled experiment tokenising a literary corpus, the analysis reveals counterintuitive results where a naive whitespace-based tokeniser achieves superior compression to a sophisticated GPT-2 BPE model, exposing architectural flaws in how BPE handles whitespace and fragments text. This leads to a deeper examination of the tangible consequences of tokenisation, including cognitive blind spots in models (such as the inability to count characters in a word), degraded arithmetic reasoning, and a significant "multilingual token tax" that financially and computationally disadvantages non-English users. Critically, the presentation debunks the long-held assumption that maximal text compression yields superior model performance, highlighting research that shows overly optimised tokenisers can underperform by violating natural linguistic structures. In response to these limitations, the analysis explores the architectural frontier, detailing promising solutions such as SuperBPE, which captures multi-word expressions by bridging spaces, and the more radical Byte-Level Transformer (BLT) paradigm, which aims to eliminate tokenisation entirely by processing raw byte streams. The work concludes that the future of the field lies in moving beyond the rigid constraints of static subword vocabularies toward more flexible, equitable, and architecturally native systems that better reflect the fluid reality of human language.

Zenodo (CERN European Organization for Nuclear Research)
Kalinga University (IN), Swiss School of Public Health (CH)
Quality Education
Openalex Percentile: Top 23%
Topic Modeling
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.