Training & Test Sets
Training and test strings for each of the 100 problems can be downloaded using the two tables below. A cell is considered broken if your induction algorithm solves the 5 problems it contains (see the protocol page for details, and the section below about file formats).
Alternatively to these tables, you can download the .tar.gz archive that contains all of the training and test sets:
| Sparsity of the training sample | |||||
| 100% | 50% | 25% | 12.5% | ||
| Alphabet size | 2 | 1 - 2 - 3 - 4 - 5 | 6 - 7 - 8 - 9 - 10 | 11 - 12 - 13 - 14 - 15 | 16 - 17 - 18 - 19 - 20 |
| 5 | 21 - 22 - 23 - 24 - 25 | 26 - 27 - 28 - 29 - 30 | 31 - 32 - 33 - 34 - 35 | 36 - 37 - 38 - 39 - 40 | |
| 10 | 41 - 42 - 43 - 44 - 45 | 46 - 47 - 48 - 49 - 50 | 51 - 52 - 53 - 54 - 55 | 56 - 57 - 58 - 59 - 60 | |
| 20 | 61 - 62 - 63 - 64 - 65 | 66 - 67 - 68 - 69 - 70 | 71 - 72 - 73 - 74 - 75 | 76 - 77 - 78 - 79 - 80 | |
| 50 | 81 - 82 - 83 - 84 - 85 | 86 - 87 - 88 - 89 - 90 | 91 - 92 - 93 - 94 - 95 | 96 - 97 - 98 - 99 - 100 | |
| Sparsity of the training sample | |||||
| 100% | 50% | 25% | 12.5% | ||
| Alphabet size | 2 | 1 - 2 - 3 - 4 - 5 | 6 - 7 - 8 - 9 - 10 | 11 - 12 - 13 - 14 - 15 | 16 - 17 - 18 - 19 - 20 |
| 5 | 21 - 22 - 23 - 24 - 25 | 26 - 27 - 28 - 29 - 30 | 31 - 32 - 33 - 34 - 35 | 36 - 37 - 38 - 39 - 40 | |
| 10 | 41 - 42 - 43 - 44 - 45 | 46 - 47 - 48 - 49 - 50 | 51 - 52 - 53 - 54 - 55 | 56 - 57 - 58 - 59 - 60 | |
| 20 | 61 - 62 - 63 - 64 - 65 | 66 - 67 - 68 - 69 - 70 | 71 - 72 - 73 - 74 - 75 | 76 - 77 - 78 - 79 - 80 | |
| 50 | 81 - 82 - 83 - 84 - 85 | 86 - 87 - 88 - 89 - 90 | 91 - 92 - 93 - 94 - 95 | 96 - 97 - 98 - 99 - 100 | |
File formats
The files in the grids above contain input strings, one per line. Training sets contain positive (starting with +) and negative strings (starting with -) in any order. Test sets contain test strings only (starting with ?). Symbols are always integer literals and are separated by one space:
For training sets:
+ # the empty positive string (lambda) - # the empty negative string + 1 23 5 49 # a positive string with 4 symbols - 2 1 # a negative string with 2 symbols
For test sets:
? # the empty string could of course be classified ? 21 5 6 # a test string to be classified as well (3 symbols)
