floleuerer commited on
Commit
1ba60c3
·
verified ·
1 Parent(s): cb7f76d

Add dataset card

Browse files
Files changed (1) hide show
  1. README.md +30 -69
README.md CHANGED
@@ -1,51 +1,18 @@
1
  ---
2
  license: cc-by-4.0
3
  task_categories:
4
- - question-answering
5
  language:
6
- - en
7
  tags:
8
- - benchmark
9
- - evaluation
10
- - letter-counting
11
- - tokenization
12
- - reasoning
13
  size_categories:
14
- - n<1K
15
  pretty_name: StrawberryBench
16
- dataset_info:
17
- features:
18
- - name: id
19
- dtype: string
20
- - name: word
21
- dtype: string
22
- - name: letter
23
- dtype: string
24
- - name: question
25
- dtype: string
26
- - name: answer
27
- dtype: int64
28
- - name: difficulty
29
- dtype: string
30
- - name: word_length
31
- dtype: int64
32
- - name: zero_count
33
- dtype: bool
34
- - name: template_idx
35
- dtype: int64
36
- - name: language
37
- dtype: string
38
- splits:
39
- - name: test
40
- num_bytes: 130887
41
- num_examples: 847
42
- download_size: 29895
43
- dataset_size: 130887
44
- configs:
45
- - config_name: default
46
- data_files:
47
- - split: test
48
- path: data/test-*
49
  ---
50
 
51
  # StrawberryBench Dataset
@@ -89,32 +56,36 @@ English (en)
89
  | `id` | string | Unique example identifier (`sb_XXXXX`) |
90
  | `word` | string | The word or phrase to count in |
91
  | `letter` | string | The single letter to count (lowercase) |
92
- | `question` | string | Natural language question (one of 4 templates) |
93
  | `answer` | int | Correct count (ground truth) |
94
- | `difficulty` | string | `easy` / `medium` / `hard` / `sentence` |
95
  | `word_length` | int | Number of non-space characters in `word` |
96
  | `zero_count` | bool | Whether `answer == 0` (letter absent) |
97
- | `template_idx` | int | Which question template was used (0–3) |
 
98
 
99
  ### Data Splits
100
 
101
  | Split | Examples |
102
  |-------|----------|
103
  | train | — |
104
- | test | 560 |
105
 
106
  The dataset is released as a single test split only; it is designed for zero-shot / few-shot evaluation, not fine-tuning.
107
 
108
  ### Difficulty Tiers
109
 
110
- | Tier | Word Length | # Examples |
111
  |------|-------------|------------|
112
- | easy | 3–6 chars | 185 |
113
- | medium | 7–12 chars | 204 |
114
- | hard | 13+ chars | 132 |
115
- | sentence | phrase | 39 |
 
 
 
116
 
117
- Approximately 25% of examples have `zero_count = true` (the letter does not appear in the word).
118
 
119
  ## Dataset Creation
120
 
@@ -124,14 +95,15 @@ All words and phrases are common English vocabulary, proper nouns, and well-know
124
 
125
  ### Question Templates
126
 
127
- Four templates are used per question (randomly assigned):
128
 
129
- 1. `"How many times does the letter '{letter}' appear in the word '{word}'?"`
130
- 2. `"Count the occurrences of the letter '{letter}' in '{word}'."`
131
- 3. `"In the word '{word}', how many '{letter}'s are there?"`
132
- 4. `"What is the count of the letter '{letter}' in '{word}'?"`
133
-
134
- Sentence-level questions use analogous templates with "phrase" instead of "word".
 
135
 
136
  ### Curation Rationale
137
 
@@ -151,17 +123,6 @@ correct = sum(1 for ex in ds["test"] if model_predict(ex["question"]) == ex["ans
151
  accuracy = correct / len(ds["test"])
152
  ```
153
 
154
- ## Citation
155
-
156
- ```bibtex
157
- @article{strawberrybench2026,
158
- title={StrawberryBench: Can Language Models Count Letters?},
159
- author={},
160
- journal={arXiv preprint arXiv:XXXX.XXXXX},
161
- year={2026}
162
- }
163
- ```
164
-
165
  ## License
166
 
167
  [Creative Commons Attribution 4.0 International (CC BY 4.0)](https://creativecommons.org/licenses/by/4.0/)
 
1
  ---
2
  license: cc-by-4.0
3
  task_categories:
4
+ - question-answering
5
  language:
6
+ - en
7
  tags:
8
+ - benchmark
9
+ - evaluation
10
+ - letter-counting
11
+ - tokenization
12
+ - reasoning
13
  size_categories:
14
+ - n<1K
15
  pretty_name: StrawberryBench
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
16
  ---
17
 
18
  # StrawberryBench Dataset
 
56
  | `id` | string | Unique example identifier (`sb_XXXXX`) |
57
  | `word` | string | The word or phrase to count in |
58
  | `letter` | string | The single letter to count (lowercase) |
59
+ | `question` | string | Natural language question |
60
  | `answer` | int | Correct count (ground truth) |
61
+ | `difficulty` | string | `easy` / `medium` / `hard` / `sentence` / `paragraph` / `names` / `foreign` |
62
  | `word_length` | int | Number of non-space characters in `word` |
63
  | `zero_count` | bool | Whether `answer == 0` (letter absent) |
64
+ | `template_idx` | int | Which question template was used (0 or 1) |
65
+ | `language` | string | For `foreign` difficulty, the language (optional) |
66
 
67
  ### Data Splits
68
 
69
  | Split | Examples |
70
  |-------|----------|
71
  | train | — |
72
+ | test | 847 |
73
 
74
  The dataset is released as a single test split only; it is designed for zero-shot / few-shot evaluation, not fine-tuning.
75
 
76
  ### Difficulty Tiers
77
 
78
+ | Tier | Description / Word Length | # Examples |
79
  |------|-------------|------------|
80
+ | easy | 3–6 chars | 183 |
81
+ | medium | 7–12 chars | 228 |
82
+ | hard | 13+ chars | 146 |
83
+ | sentence | short multi-word phrases | 46 |
84
+ | paragraph | longer text passages (100+ chars) | 55 |
85
+ | names | common first names (repeated letters) | 112 |
86
+ | foreign | non-English words (German, etc.) | 77 |
87
 
88
+ Approximately 11% of examples have `zero_count = true` (the letter does not appear in the word).
89
 
90
  ## Dataset Creation
91
 
 
95
 
96
  ### Question Templates
97
 
98
+ Two main templates are used per example (randomly assigned index 0 or 1):
99
 
100
+ - **Standard (easy, medium, hard):**
101
+ 1. `"How many times does the letter '{letter}' appear in the word '{word}'?"`
102
+ 2. `"In the word '{word}', how many '{letter}'s are there?"`
103
+ - **Sentences:** Uses "phrase" instead of "word".
104
+ - **Paragraphs:** Uses "following text: '{word}'".
105
+ - **Names:** `"How many {letter}'s are in the name '{word}'?"`
106
+ - **Foreign:** `"How many times does the letter '{letter}' appear in the {language} word '{word}'?"`
107
 
108
  ### Curation Rationale
109
 
 
123
  accuracy = correct / len(ds["test"])
124
  ```
125
 
 
 
 
 
 
 
 
 
 
 
 
126
  ## License
127
 
128
  [Creative Commons Attribution 4.0 International (CC BY 4.0)](https://creativecommons.org/licenses/by/4.0/)