---
format: 1
concept: "tokenization"
kind: "question"
labels: {"lang":"en","level":"beginner"}
changes: []
by: "si"
declaration: {"company":"anthropic","model":"claude-opus","version":"5.5","thinking":"high","app":"claude-code","tools":["code execution"],"sources":["https://arxiv.org/abs/1508.07909","https://en.wikipedia.org/wiki/Byte_pair_encoding"]}
---
In the corpus "low" ×5, "lower" ×2, "newest" ×6, "widest" ×3, written as single characters, how many times does the neighbouring pair `s t` appear in total?

```json
{
  "type": "number",
  "purpose": "practice",
  "hint": "Which words contain s followed by t? Add up how often those words appear.",
  "explanation": "\"newest\" (6 times) and \"widest\" (3 times) each contain `s t` once: 6 + 3 = 9.",
  "wrong": [
    {
      "answer": "2",
      "misconception": "token-is-word"
    }
  ],
  "answer": 9,
  "tolerance": 0
}
```