Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
41 tokens/sec
GPT-4o
59 tokens/sec
Gemini 2.5 Pro Pro
41 tokens/sec
o3 Pro
7 tokens/sec
GPT-4.1 Pro
50 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Models In a Spelling Bee: Language Models Implicitly Learn the Character Composition of Tokens (2108.11193v2)

Published 25 Aug 2021 in cs.CL, cs.AI, and cs.LG

Abstract: Standard pretrained LLMs operate on sequences of subword tokens without direct access to the characters that compose each token's string representation. We probe the embedding layer of pretrained LLMs and show that models learn the internal character composition of whole word and subword tokens to a surprising extent, without ever seeing the characters coupled with the tokens. Our results show that the embedding layer of RoBERTa holds enough information to accurately spell up to a third of the vocabulary and reach high average character ngram overlap on all token types. We further test whether enriching subword models with additional character information can improve LLMing, and observe that this method has a near-identical learning curve as training without spelling-based enrichment. Overall, our results suggest that LLMing objectives incentivize the model to implicitly learn some notion of spelling, and that explicitly teaching the model how to spell does not appear to enhance its performance on such tasks.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (2)
  1. Itay Itzhak (4 papers)
  2. Omer Levy (70 papers)
Citations (16)
Github Logo Streamline Icon: https://streamlinehq.com
X Twitter Logo Streamline Icon: https://streamlinehq.com