CUTE: Measuring LLMs' Understanding of Their Tokens

Lukas Edman, Helmut Schmid, Alexander Fraser
9/23/2024
cs.CL

No official code found. Best implementation: Leukas/CUTE (20 stars, MIT, last commit 2026-04-26).

Abstract

Large Language Models (LLMs) show remarkable performance on a wide variety of tasks. Most LLMs split text into multi-character tokens and process them as atomic units without direct access to individual characters. This raises the question: To what extent can LLMs learn orthographic information? To answer this, we propose a new benchmark, CUTE, which features a collection of tasks designed to test the orthographic knowledge of LLMs. We evaluate popular LLMs on CUTE, finding that most of them seem to know the spelling of their tokens, yet fail to use this information effectively to manipulate text, calling into question how much of this knowledge is generalizable.

View on arXivView PDF

Code Implementations(1)

Leukas/CUTECommunity100%
MIT
203PythonMay 24, 20245 months agoMIT

Similar Papers

Cite this paper

@article{edman2024cute,
  title  = {CUTE: Measuring LLMs' Understanding of Their Tokens},
  author = {Lukas Edman and Helmut Schmid and Alexander Fraser},
  year   = {2024},
  eprint = {2409.15452},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2409.15452v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2409.15452.svg)](https://codeofpaper.com/paper/2409.15452)

Discussion