mlsanityData to 7 Oct 2026

Word Recovery in Large Language Models Enables Character-Level Tokenization Robustness

arXiv 2603.10771 ↗First posted 11 Mar 2026cs.CLcited by 2

Not on the map. Why?

Abstract (arXiv)

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 phenomenon through mechanistic interpretability and identify a core process we term word recovery. We first introduce a decoding-based method to detect word recovery, showing that hidden states reconstruct canonical word-level token identities from character-level inputs. We then provide causal evidence by removing the corresponding subspace from hidden states, which consistently degrades downstream task performance. Finally, we conduct a fine-grained attention analysis and show that in-group attention among characters belonging to the same canonical token is critical for word recovery: masking such attention in early layers substantially reduces both recovery scores and task performance. Together, our findings provide a mechanistic explanation for tokenization robustness and identify word recovery as a key mechanism enabling LLMs to process character-level inputs.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 46 of its 59 references that are in the map. First posted on arXiv 11 Mar 2026.

Builds on

46 of 59 references.

References · 46

  1. 2024Qwen2.5 Technical Reportcited by 4,713
  2. 2015Neural Machine Translation of Rare Words with Subword Unitscited by 2,898
  3. 2022Locating and Editing Factual Associations in GPTcited by 2,609
  4. 2018SentencePiece: A simple and language independent subword tokenizer and detokenizer for Neural Text Processingcited by 1,973
  5. 2024Gemma 2: Improving Open Language Models at a Practical Sizecited by 1,928
  6. 2022Interpretability in the Wild: a Circuit for Indirect Object Identification in GPT-2 smallcited by 1,130
  7. 2022In-context Learning and Induction Headscited by 930
  8. 2022Toy Models of Superpositioncited by 928
  9. 2024Scaling and evaluating sparse autoencoderscited by 530
  10. 2023Dissecting Recall of Factual Associations in Auto-Regressive Language Modelscited by 512
  11. 2024Sparse Feature Circuits: Discovering and Editing Interpretable Causal Graphs in Language Modelscited by 412
  12. 2019BPE-Dropout: Simple and Effective Subword Regularizationcited by 189
34 more
  1. 2024Do I Know This Entity? Knowledge Awareness and Hallucinations in Language Modelscited by 114
  2. 2023Language Models Implement Simple Word2Vec-style Vector Arithmeticcited by 97
  3. 2023Overthinking the Truth: Understanding how Language Models Process False Demonstrationscited by 78
  4. 2023Successor Heads: Recurring, Interpretable Attention Heads In The Wildcited by 77
  5. 2022Polysemanticity and Capacity in Neural Networkscited by 74
  6. 2021Superbizarre Is Not Superb: Derivational Morphology Improves BERT's Interpretation of Complex Wordscited by 63
  7. 2024From Tokens to Words: On the Inner Lexicon of LLMscited by 46
  8. 2025When Truth Is Overridden: Uncovering the Internal Origins of Sycophancy in Large Language Modelscited by 46
  9. 2022What do tokens know about their characters and how do they know it?cited by 36
  10. 2024Locate-then-edit for Multi-hop Factual Recall under Knowledge Editingcited by 36
  11. 2025Understanding the Repeat Curse in Large Language Models from a Feature Perspectivecited by 36
  12. 2024Tokenization Matters! Degrading Large Language Models through Challenging Their Tokenizationcited by 32
  13. 2024CUTE: Measuring LLMs' Understanding of Their Tokenscited by 28
  14. 2021Models In a Spelling Bee: Language Models Implicitly Learn the Character Composition of Tokenscited by 26
  15. 2025RepreGuard: Detecting LLM-Generated Text by Revealing Hidden Representation Patternscited by 24
  16. 2025Hierarchical Autoregressive Transformers: Combining Byte- and Word-Level Processing for Robust, Adaptable Language Modelscited by 22
  17. 2025EAP-GP: Mitigating Saturation Effect in Gradient-based Automated Circuit Identificationcited by 21
  18. 2024Tokenization Falling Short: On Subword Robustness in Large Language Modelscited by 18
  19. 2024Token Erasure as a Footprint of Implicit Vocabulary Items in LLMscited by 17
  20. 2025Broken Tokens? Your Language Model can Secretly Handle Non-Canonical Tokenizationscited by 16
  21. 2025Adaptive Multi-Subspace Representation Steering for Attribute Alignment in Large Language Modelscited by 16
  22. 2025Short-length Adversarial Training Helps LLMs Defend Long-length Jailbreak Attacks: Theoretical and Empirical Evidencecited by 13
  23. 2025Understanding How Value Neurons Shape the Generation of Specified Values in LLMscited by 13
  24. 2025Understanding and Mitigating Cross-lingual Privacy Leakage via Language-specific and Universal Privacy Neuronscited by 13
  25. 2022Incorporating Context into Subword Vocabulariescited by 11
  26. 2025Mechanistic Unveiling of Transformer Circuits: Self-Influence as a Key to Model Reasoningcited by 11
  27. 2025The Strawberry Problem: Emergence of Character-level Understanding in Tokenized Language Modelscited by 11
  28. 2025PIXEL: Adaptive Steering Via Position-wise Injection with eXact Estimated Levels under Subspace Calibrationcited by 10
  29. 2025Internal Chain-of-Thought: Empirical Evidence for Layer-wise Subtask Scheduling in LLMscited by 9
  30. 2023Theoretical Analysis of Robust Overfitting for Wide DNNs: An NTK Approachcited by 8
  31. 2025StochasTok: Improving Fine-Grained Subword Understanding in LLMscited by 6
  32. 2025Understanding and Mitigating Political Stance Cross-topic Generalization in Large Language Modelscited by 6
  33. 2025The Compositional Architecture of Regret in Large Language Modelscited by 3
  34. 2025PAHQ: Accelerating Automated Circuit Discovery through Mixed-Precision Inference Optimizationcited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 2.

2 papers.