Work

Greedy byte-pair encoding asymptotically maximizes token savings on fixed alphabets

Year: 2026
Type: preprint
Abstract: An explicit binary construction at the shortest asymptotic input scale for strict greedy loss, with persistent deficit after a forced first merge.
Language: English
Open Access status: green
OpenAlex ID: W7235048612
Cites:
Cited by:
Related to: 10