question stringlengths 51 696 | answer stringlengths 3 288 | metadata dict |
|---|---|---|
Your task is to unsramble words in a sentence.
For each word in a sentence, the letter may have been randomly shuffled. Your task is to unscramble the words.
The order of the words in the sentence is preserved. Moreover, the style of the sentence is preserved (i.e. punctuation, capitalization, new lines, etc.).
Your... | your appetite Only passably good Yes the stomach There s the rub You are over worked If your stomach is out of | {
"corruption_level": 0.3302517593695969,
"difficulty": {
"corruption_level": [
0.1,
0.9
],
"num_words": null,
"word_len": [
1,
50
],
"word_length": null,
"words": [
3,
40
]
},
"direction": null,
"num_words": 22,
"original_words": [
"yo... |
Your task is to sort words in ascending or descending order using ASCII/Unicode ordering.
Your output should be a comma-separated list of words, e.g. word_1, word_2, word_3
Now, sort these words in ascending order (using ASCII/Unicode ordering) and return them as a comma-separated list: year, disk, continuous, bad, r... | 6221541, bad, continuous, dated, disk, downcast, given, pay, rest, year | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": [
3,
10
],
"word_len": null,
"word_length": [
3,
12
],
"words": null
},
"direction": "ascending",
"num_words": 10,
"original_words": [
"year",
"disk",
"continuou... |
Spell this word backward (example: sun -> nus): solidiform | mrofidilos | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": null,
"word_len": [
3,
10
],
"word_length": null,
"words": null
},
"direction": null,
"num_words": null,
"original_words": null,
"scrambled_words": null,
"sorted_words": null,
"source... |
Your task is to unsramble words in a sentence.
For each word in a sentence, the letter may have been randomly shuffled. Your task is to unscramble the words.
The order of the words in the sentence is preserved. Moreover, the style of the sentence is preserved (i.e. punctuation, capitalization, new lines, etc.).
Your... | could they but compare the present with the past and so better comprehend the advance we have made How much fairer they would find our modern towns with populations | {
"corruption_level": 0.6439138264972675,
"difficulty": {
"corruption_level": [
0.1,
0.9
],
"num_words": null,
"word_len": [
1,
50
],
"word_length": null,
"words": [
3,
40
]
},
"direction": null,
"num_words": 29,
"original_words": [
"co... |
Your task is to sort words in ascending or descending order using ASCII/Unicode ordering.
Your output should be a comma-separated list of words, e.g. word_1, word_2, word_3
Now, sort these words in ascending order (using ASCII/Unicode ordering) and return them as a comma-separated list: did, costs, performed, apartme... | apartment, costs, did, discovery, performed, telephony | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": [
3,
10
],
"word_len": null,
"word_length": [
3,
12
],
"words": null
},
"direction": "ascending",
"num_words": 6,
"original_words": [
"did",
"costs",
"performed"... |
Your task is to unsramble words in a sentence.
For each word in a sentence, the letter may have been randomly shuffled. Your task is to unscramble the words.
The order of the words in the sentence is preserved. Moreover, the style of the sentence is preserved (i.e. punctuation, capitalization, new lines, etc.).
Your... | below C The Project Gutenberg Literary Archive Foundation the Foundation or PGLAF owns a compilation | {
"corruption_level": 0.2675704132982853,
"difficulty": {
"corruption_level": [
0.1,
0.9
],
"num_words": null,
"word_len": [
1,
50
],
"word_length": null,
"words": [
3,
40
]
},
"direction": null,
"num_words": 15,
"original_words": [
"be... |
Spell this word backward (example: sun -> nus): popadam | madapop | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": null,
"word_len": [
3,
10
],
"word_length": null,
"words": null
},
"direction": null,
"num_words": null,
"original_words": null,
"scrambled_words": null,
"sorted_words": null,
"source... |
Spell this word backward (example: sun -> nus): leasow | wosael | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": null,
"word_len": [
3,
10
],
"word_length": null,
"words": null
},
"direction": null,
"num_words": null,
"original_words": null,
"scrambled_words": null,
"sorted_words": null,
"source... |
Spell this word backward (example: sun -> nus): Hienz | zneiH | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": null,
"word_len": [
3,
10
],
"word_length": null,
"words": null
},
"direction": null,
"num_words": null,
"original_words": null,
"scrambled_words": null,
"sorted_words": null,
"source... |
Spell this word backward (example: sun -> nus): annodated | detadonna | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": null,
"word_len": [
3,
10
],
"word_length": null,
"words": null
},
"direction": null,
"num_words": null,
"original_words": null,
"scrambled_words": null,
"sorted_words": null,
"source... |
Your task is to unsramble words in a sentence.
For each word in a sentence, the letter may have been randomly shuffled. Your task is to unscramble the words.
The order of the words in the sentence is preserved. Moreover, the style of the sentence is preserved (i.e. punctuation, capitalization, new lines, etc.).
Your... | with transactions which involve a daily expenditure of upward of Fortunately indeed the stupendous progress of mechanic art in modern times makes | {
"corruption_level": 0.5699922069743807,
"difficulty": {
"corruption_level": [
0.1,
0.9
],
"num_words": null,
"word_len": [
1,
50
],
"word_length": null,
"words": [
3,
40
]
},
"direction": null,
"num_words": 22,
"original_words": [
"wi... |
Spell this word backward (example: sun -> nus): rhapsode | edospahr | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": null,
"word_len": [
3,
10
],
"word_length": null,
"words": null
},
"direction": null,
"num_words": null,
"original_words": null,
"scrambled_words": null,
"sorted_words": null,
"source... |
Spell this word backward (example: sun -> nus): Zend | dneZ | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": null,
"word_len": [
3,
10
],
"word_length": null,
"words": null
},
"direction": null,
"num_words": null,
"original_words": null,
"scrambled_words": null,
"sorted_words": null,
"source... |
Your task is to sort words in ascending or descending order using ASCII/Unicode ordering.
Your output should be a comma-separated list of words, e.g. word_1, word_2, word_3
Now, sort these words in descending order (using ASCII/Unicode ordering) and return them as a comma-separated list: who, round, PURPOSE, Union
| who, round, Union, PURPOSE | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": [
3,
10
],
"word_len": null,
"word_length": [
3,
12
],
"words": null
},
"direction": "descending",
"num_words": 4,
"original_words": [
"who",
"round",
"PURPOSE",... |
Your task is to sort words in ascending or descending order using ASCII/Unicode ordering.
Your output should be a comma-separated list of words, e.g. word_1, word_2, word_3
Now, sort these words in descending order (using ASCII/Unicode ordering) and return them as a comma-separated list: presents, Author, combustion,... | sated, production, presents, combustion, Author | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": [
3,
10
],
"word_len": null,
"word_length": [
3,
12
],
"words": null
},
"direction": "descending",
"num_words": 5,
"original_words": [
"presents",
"Author",
"com... |
Your task is to sort words in ascending or descending order using ASCII/Unicode ordering.
Your output should be a comma-separated list of words, e.g. word_1, word_2, word_3
Now, sort these words in descending order (using ASCII/Unicode ordering) and return them as a comma-separated list: suppose, Archibald, powerful,... | suppose, shells, reasonable, powerful, line, Archibald, 2792 | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": [
3,
10
],
"word_len": null,
"word_length": [
3,
12
],
"words": null
},
"direction": "descending",
"num_words": 7,
"original_words": [
"suppose",
"Archibald",
"p... |
Spell this word backward (example: sun -> nus): coopery | yrepooc | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": null,
"word_len": [
3,
10
],
"word_length": null,
"words": null
},
"direction": null,
"num_words": null,
"original_words": null,
"scrambled_words": null,
"sorted_words": null,
"source... |
Your task is to sort words in ascending or descending order using ASCII/Unicode ordering.
Your output should be a comma-separated list of words, e.g. word_1, word_2, word_3
Now, sort these words in ascending order (using ASCII/Unicode ordering) and return them as a comma-separated list: performing, considerable, Dead... | Dead, Why, considerable, performing | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": [
3,
10
],
"word_len": null,
"word_length": [
3,
12
],
"words": null
},
"direction": "ascending",
"num_words": 4,
"original_words": [
"performing",
"considerable",
... |
Spell this word backward (example: sun -> nus): spathous | suohtaps | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": null,
"word_len": [
3,
10
],
"word_length": null,
"words": null
},
"direction": null,
"num_words": null,
"original_words": null,
"scrambled_words": null,
"sorted_words": null,
"source... |
Your task is to sort words in ascending or descending order using ASCII/Unicode ordering.
Your output should be a comma-separated list of words, e.g. word_1, word_2, word_3
Now, sort these words in ascending order (using ASCII/Unicode ordering) and return them as a comma-separated list: charities, equipment, efforts,... | charities, chemical, efforts, equipment, great, mended, varied | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": [
3,
10
],
"word_len": null,
"word_length": [
3,
12
],
"words": null
},
"direction": "ascending",
"num_words": 7,
"original_words": [
"charities",
"equipment",
"... |
Your task is to unsramble words in a sentence.
For each word in a sentence, the letter may have been randomly shuffled. Your task is to unscramble the words.
The order of the words in the sentence is preserved. Moreover, the style of the sentence is preserved (i.e. punctuation, capitalization, new lines, etc.).
Your... | has done away with the domestic kitchen and is a subscriber to the Grand Alimentation Company which sends through a | {
"corruption_level": 0.23133679358841325,
"difficulty": {
"corruption_level": [
0.1,
0.9
],
"num_words": null,
"word_len": [
1,
50
],
"word_length": null,
"words": [
3,
40
]
},
"direction": null,
"num_words": 20,
"original_words": [
"h... |
Spell this word backward (example: sun -> nus): katakana | anakatak | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": null,
"word_len": [
3,
10
],
"word_length": null,
"words": null
},
"direction": null,
"num_words": null,
"original_words": null,
"scrambled_words": null,
"sorted_words": null,
"source... |
Spell this word backward (example: sun -> nus): Proavis | sivaorP | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": null,
"word_len": [
3,
10
],
"word_length": null,
"words": null
},
"direction": null,
"num_words": null,
"original_words": null,
"scrambled_words": null,
"sorted_words": null,
"source... |
Spell this word backward (example: sun -> nus): ruche | ehcur | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": null,
"word_len": [
3,
10
],
"word_length": null,
"words": null
},
"direction": null,
"num_words": null,
"original_words": null,
"scrambled_words": null,
"sorted_words": null,
"source... |
Your task is to sort words in ascending or descending order using ASCII/Unicode ordering.
Your output should be a comma-separated list of words, e.g. word_1, word_2, word_3
Now, sort these words in ascending order (using ASCII/Unicode ordering) and return them as a comma-separated list: incessant, favorably, reaches,... | NOTICE, Where, eye, favorably, incessant, page, reaches | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": [
3,
10
],
"word_len": null,
"word_length": [
3,
12
],
"words": null
},
"direction": "ascending",
"num_words": 7,
"original_words": [
"incessant",
"favorably",
"... |
Spell this word backward (example: sun -> nus): spurtle | eltrups | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": null,
"word_len": [
3,
10
],
"word_length": null,
"words": null
},
"direction": null,
"num_words": null,
"original_words": null,
"scrambled_words": null,
"sorted_words": null,
"source... |
Your task is to sort words in ascending or descending order using ASCII/Unicode ordering.
Your output should be a comma-separated list of words, e.g. word_1, word_2, word_3
Now, sort these words in ascending order (using ASCII/Unicode ordering) and return them as a comma-separated list: implied, sooner, licensed, mut... | implied, licensed, mutually, sooner | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": [
3,
10
],
"word_len": null,
"word_length": [
3,
12
],
"words": null
},
"direction": "ascending",
"num_words": 4,
"original_words": [
"implied",
"sooner",
"licen... |
Spell this word backward (example: sun -> nus): imshi | ihsmi | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": null,
"word_len": [
3,
10
],
"word_length": null,
"words": null
},
"direction": null,
"num_words": null,
"original_words": null,
"scrambled_words": null,
"sorted_words": null,
"source... |
Spell this word backward (example: sun -> nus): apices | secipa | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": null,
"word_len": [
3,
10
],
"word_length": null,
"words": null
},
"direction": null,
"num_words": null,
"original_words": null,
"scrambled_words": null,
"sorted_words": null,
"source... |
Your task is to sort words in ascending or descending order using ASCII/Unicode ordering.
Your output should be a comma-separated list of words, e.g. word_1, word_2, word_3
Now, sort these words in descending order (using ASCII/Unicode ordering) and return them as a comma-separated list: Korum, proof, bad, inaccurate... | proof, inaccurate, bad, Korum | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": [
3,
10
],
"word_len": null,
"word_length": [
3,
12
],
"words": null
},
"direction": "descending",
"num_words": 4,
"original_words": [
"Korum",
"proof",
"bad",
... |
Your task is to sort words in ascending or descending order using ASCII/Unicode ordering.
Your output should be a comma-separated list of words, e.g. word_1, word_2, word_3
Now, sort these words in ascending order (using ASCII/Unicode ordering) and return them as a comma-separated list: 100, sally, limitation, added
| 100, added, limitation, sally | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": [
3,
10
],
"word_len": null,
"word_length": [
3,
12
],
"words": null
},
"direction": "ascending",
"num_words": 4,
"original_words": [
"100",
"sally",
"limitation... |
Your task is to unsramble words in a sentence.
For each word in a sentence, the letter may have been randomly shuffled. Your task is to unscramble the words.
The order of the words in the sentence is preserved. Moreover, the style of the sentence is preserved (i.e. punctuation, capitalization, new lines, etc.).
Your... | must be paid within days following each | {
"corruption_level": 0.10030675413401431,
"difficulty": {
"corruption_level": [
0.1,
0.9
],
"num_words": null,
"word_len": [
1,
50
],
"word_length": null,
"words": [
3,
40
]
},
"direction": null,
"num_words": 7,
"original_words": [
"mu... |
Spell this word backward (example: sun -> nus): Adrian | nairdA | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": null,
"word_len": [
3,
10
],
"word_length": null,
"words": null
},
"direction": null,
"num_words": null,
"original_words": null,
"scrambled_words": null,
"sorted_words": null,
"source... |
Your task is to sort words in ascending or descending order using ASCII/Unicode ordering.
Your output should be a comma-separated list of words, e.g. word_1, word_2, word_3
Now, sort these words in descending order (using ASCII/Unicode ordering) and return them as a comma-separated list: bomb, air, vital, Chronicle, ... | vital, pillows, learn, hope, bomb, air, Peer, Chronicle | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": [
3,
10
],
"word_len": null,
"word_length": [
3,
12
],
"words": null
},
"direction": "descending",
"num_words": 8,
"original_words": [
"bomb",
"air",
"vital",
... |
Your task is to unsramble words in a sentence.
For each word in a sentence, the letter may have been randomly shuffled. Your task is to unscramble the words.
The order of the words in the sentence is preserved. Moreover, the style of the sentence is preserved (i.e. punctuation, capitalization, new lines, etc.).
Your... | interesting philosophical problems with her lover shows your very acute power of observation Never have the ways of country folk been better portrayed | {
"corruption_level": 0.769396800701784,
"difficulty": {
"corruption_level": [
0.1,
0.9
],
"num_words": null,
"word_len": [
1,
50
],
"word_length": null,
"words": [
3,
40
]
},
"direction": null,
"num_words": 23,
"original_words": [
"int... |
Your task is to unsramble words in a sentence.
For each word in a sentence, the letter may have been randomly shuffled. Your task is to unscramble the words.
The order of the words in the sentence is preserved. Moreover, the style of the sentence is preserved (i.e. punctuation, capitalization, new lines, etc.).
Your... | upon and cannot survive without widespread public support and donations to carry out its mission of increasing the number of public domain and licensed works that can be freely | {
"corruption_level": 0.5357590349253007,
"difficulty": {
"corruption_level": [
0.1,
0.9
],
"num_words": null,
"word_len": [
1,
50
],
"word_length": null,
"words": [
3,
40
]
},
"direction": null,
"num_words": 29,
"original_words": [
"up... |
Your task is to sort words in ascending or descending order using ASCII/Unicode ordering.
Your output should be a comma-separated list of words, e.g. word_1, word_2, word_3
Now, sort these words in descending order (using ASCII/Unicode ordering) and return them as a comma-separated list: regular, awoke, solicitation,... | sorts, solicitation, regular, means, into, harmony, covered, awoke, annulment, Give | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": [
3,
10
],
"word_len": null,
"word_length": [
3,
12
],
"words": null
},
"direction": "descending",
"num_words": 10,
"original_words": [
"regular",
"awoke",
"soli... |
Your task is to sort words in ascending or descending order using ASCII/Unicode ordering.
Your output should be a comma-separated list of words, e.g. word_1, word_2, word_3
Now, sort these words in descending order (using ASCII/Unicode ordering) and return them as a comma-separated list: reaching, whose, anon, you, f... | you, whose, reaching, face, earlier, commercial, anon | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": [
3,
10
],
"word_len": null,
"word_length": [
3,
12
],
"words": null
},
"direction": "descending",
"num_words": 7,
"original_words": [
"reaching",
"whose",
"anon... |
Your task is to unsramble words in a sentence.
For each word in a sentence, the letter may have been randomly shuffled. Your task is to unscramble the words.
The order of the words in the sentence is preserved. Moreover, the style of the sentence is preserved (i.e. punctuation, capitalization, new lines, etc.).
Your... | Project Gutenberg trademark as set forth in paragraphs E or E E If an individual Project Gutenberg electronic work is posted with the permission of the copyright holder your use and distribution must comply with both | {
"corruption_level": 0.5763251739775314,
"difficulty": {
"corruption_level": [
0.1,
0.9
],
"num_words": null,
"word_len": [
1,
50
],
"word_length": null,
"words": [
3,
40
]
},
"direction": null,
"num_words": 36,
"original_words": [
"Pr... |
Your task is to sort words in ascending or descending order using ASCII/Unicode ordering.
Your output should be a comma-separated list of words, e.g. word_1, word_2, word_3
Now, sort these words in ascending order (using ASCII/Unicode ordering) and return them as a comma-separated list: scene, life, Heat, William, si... | Heat, William, life, scene, sitting | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": [
3,
10
],
"word_len": null,
"word_length": [
3,
12
],
"words": null
},
"direction": "ascending",
"num_words": 5,
"original_words": [
"scene",
"life",
"Heat",
... |
Your task is to unsramble words in a sentence.
For each word in a sentence, the letter may have been randomly shuffled. Your task is to unscramble the words.
The order of the words in the sentence is preserved. Moreover, the style of the sentence is preserved (i.e. punctuation, capitalization, new lines, etc.).
Your... | come back answered Dr Wilkins Left alone Mr Smith busied himself with examining his accounts a task of vast magnitude having to do with transactions which involve a daily expenditure of upward of Fortunately indeed the stupendous progress of | {
"corruption_level": 0.22561720873845187,
"difficulty": {
"corruption_level": [
0.1,
0.9
],
"num_words": null,
"word_len": [
1,
50
],
"word_length": null,
"words": [
3,
40
]
},
"direction": null,
"num_words": 39,
"original_words": [
"c... |
Your task is to unsramble words in a sentence.
For each word in a sentence, the letter may have been randomly shuffled. Your task is to unscramble the words.
The order of the words in the sentence is preserved. Moreover, the style of the sentence is preserved (i.e. punctuation, capitalization, new lines, etc.).
Your... | lay the blame on the science of optics The moon is | {
"corruption_level": 0.2185356900699909,
"difficulty": {
"corruption_level": [
0.1,
0.9
],
"num_words": null,
"word_len": [
1,
50
],
"word_length": null,
"words": [
3,
40
]
},
"direction": null,
"num_words": 11,
"original_words": [
"la... |
Your task is to unsramble words in a sentence.
For each word in a sentence, the letter may have been randomly shuffled. Your task is to unscramble the words.
The order of the words in the sentence is preserved. Moreover, the style of the sentence is preserved (i.e. punctuation, capitalization, new lines, etc.).
Your... | a window Where do you wish to go sir inquired the coachman Let me | {
"corruption_level": 0.2393163590995383,
"difficulty": {
"corruption_level": [
0.1,
0.9
],
"num_words": null,
"word_len": [
1,
50
],
"word_length": null,
"words": [
3,
40
]
},
"direction": null,
"num_words": 14,
"original_words": [
"a"... |
Spell this word backward (example: sun -> nus): Karling | gnilraK | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": null,
"word_len": [
3,
10
],
"word_length": null,
"words": null
},
"direction": null,
"num_words": null,
"original_words": null,
"scrambled_words": null,
"sorted_words": null,
"source... |
Spell this word backward (example: sun -> nus): Excalibur | rubilacxE | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": null,
"word_len": [
3,
10
],
"word_length": null,
"words": null
},
"direction": null,
"num_words": null,
"original_words": null,
"scrambled_words": null,
"sorted_words": null,
"source... |
Your task is to sort words in ascending or descending order using ASCII/Unicode ordering.
Your output should be a comma-separated list of words, e.g. word_1, word_2, word_3
Now, sort these words in descending order (using ASCII/Unicode ordering) and return them as a comma-separated list: young, stress, Secretary, her... | young, wealthy, usually, thoughts, stress, race, made, heretofore, expectant, Secretary | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": [
3,
10
],
"word_len": null,
"word_length": [
3,
12
],
"words": null
},
"direction": "descending",
"num_words": 10,
"original_words": [
"young",
"stress",
"Secre... |
Spell this word backward (example: sun -> nus): moleism | msielom | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": null,
"word_len": [
3,
10
],
"word_length": null,
"words": null
},
"direction": null,
"num_words": null,
"original_words": null,
"scrambled_words": null,
"sorted_words": null,
"source... |
Your task is to sort words in ascending or descending order using ASCII/Unicode ordering.
Your output should be a comma-separated list of words, e.g. word_1, word_2, word_3
Now, sort these words in ascending order (using ASCII/Unicode ordering) and return them as a comma-separated list: obtaining, help, English, Excu... | English, Excuse, help, obtaining | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": [
3,
10
],
"word_len": null,
"word_length": [
3,
12
],
"words": null
},
"direction": "ascending",
"num_words": 4,
"original_words": [
"obtaining",
"help",
"Engli... |
Your task is to sort words in ascending or descending order using ASCII/Unicode ordering.
Your output should be a comma-separated list of words, e.g. word_1, word_2, word_3
Now, sort these words in descending order (using ASCII/Unicode ordering) and return them as a comma-separated list: indemnify, fifteen, musingly,... | trips, thoughts, musingly, maximum, indemnify, fifteen, INCLUDING | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": [
3,
10
],
"word_len": null,
"word_length": [
3,
12
],
"words": null
},
"direction": "descending",
"num_words": 7,
"original_words": [
"indemnify",
"fifteen",
"m... |
Your task is to unsramble words in a sentence.
For each word in a sentence, the letter may have been randomly shuffled. Your task is to unscramble the words.
The order of the words in the sentence is preserved. Moreover, the style of the sentence is preserved (i.e. punctuation, capitalization, new lines, etc.).
Your... | with that the day s audience was closed Left to himself feeling tired he lay down on an extension | {
"corruption_level": 0.6466791984116675,
"difficulty": {
"corruption_level": [
0.1,
0.9
],
"num_words": null,
"word_len": [
1,
50
],
"word_length": null,
"words": [
3,
40
]
},
"direction": null,
"num_words": 19,
"original_words": [
"wi... |
Your task is to sort words in ascending or descending order using ASCII/Unicode ordering.
Your output should be a comma-separated list of words, e.g. word_1, word_2, word_3
Now, sort these words in descending order (using ASCII/Unicode ordering) and return them as a comma-separated list: contrived, wish, With, demand... | wish, most, demand, contrived, With | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": [
3,
10
],
"word_len": null,
"word_length": [
3,
12
],
"words": null
},
"direction": "descending",
"num_words": 5,
"original_words": [
"contrived",
"wish",
"With... |
Your task is to sort words in ascending or descending order using ASCII/Unicode ordering.
Your output should be a comma-separated list of words, e.g. word_1, word_2, word_3
Now, sort these words in descending order (using ASCII/Unicode ordering) and return them as a comma-separated list: outer, anon, last, estimate, ... | twelve, trouble, outer, least, last, estimate, donate, composite, been, anon | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": [
3,
10
],
"word_len": null,
"word_length": [
3,
12
],
"words": null
},
"direction": "descending",
"num_words": 10,
"original_words": [
"outer",
"anon",
"last",
... |
Your task is to unsramble words in a sentence.
For each word in a sentence, the letter may have been randomly shuffled. Your task is to unscramble the words.
The order of the words in the sentence is preserved. Moreover, the style of the sentence is preserved (i.e. punctuation, capitalization, new lines, etc.).
Your... | tube or by air train Oh by tube Yes and at what hour will you arrive About eleven I suppose Eleven by Centropolis time you mean Yes Good by then for | {
"corruption_level": 0.40169220639180414,
"difficulty": {
"corruption_level": [
0.1,
0.9
],
"num_words": null,
"word_len": [
1,
50
],
"word_length": null,
"words": [
3,
40
]
},
"direction": null,
"num_words": 31,
"original_words": [
"t... |
Your task is to sort words in ascending or descending order using ASCII/Unicode ordering.
Your output should be a comma-separated list of words, e.g. word_1, word_2, word_3
Now, sort these words in descending order (using ASCII/Unicode ordering) and return them as a comma-separated list: rails, expenses, explanation,... | surplus, serves, rails, paragraphs, old, food, explanation, expenses, approbation, American | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": [
3,
10
],
"word_len": null,
"word_length": [
3,
12
],
"words": null
},
"direction": "descending",
"num_words": 10,
"original_words": [
"rails",
"expenses",
"exp... |
Your task is to sort words in ascending or descending order using ASCII/Unicode ordering.
Your output should be a comma-separated list of words, e.g. word_1, word_2, word_3
Now, sort these words in descending order (using ASCII/Unicode ordering) and return them as a comma-separated list: complex, too, indemnify, take... | too, take, indemnify, complex | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": [
3,
10
],
"word_len": null,
"word_length": [
3,
12
],
"words": null
},
"direction": "descending",
"num_words": 4,
"original_words": [
"complex",
"too",
"indemni... |
Spell this word backward (example: sun -> nus): coustumier | reimutsuoc | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": null,
"word_len": [
3,
10
],
"word_length": null,
"words": null
},
"direction": null,
"num_words": null,
"original_words": null,
"scrambled_words": null,
"sorted_words": null,
"source... |
Your task is to unsramble words in a sentence.
For each word in a sentence, the letter may have been randomly shuffled. Your task is to unscramble the words.
The order of the words in the sentence is preserved. Moreover, the style of the sentence is preserved (i.e. punctuation, capitalization, new lines, etc.).
Your... | INDIRECT CONSEQUENTIAL PUNITIVE OR INCIDENTAL DAMAGES EVEN IF YOU GIVE NOTICE OF THE POSSIBILITY OF SUCH DAMAGE F LIMITED RIGHT OF REPLACEMENT OR REFUND If you discover a defect in this electronic | {
"corruption_level": 0.8595740349693205,
"difficulty": {
"corruption_level": [
0.1,
0.9
],
"num_words": null,
"word_len": [
1,
50
],
"word_length": null,
"words": [
3,
40
]
},
"direction": null,
"num_words": 32,
"original_words": [
"IN... |
Spell this word backward (example: sun -> nus): advocatrix | xirtacovda | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": null,
"word_len": [
3,
10
],
"word_length": null,
"words": null
},
"direction": null,
"num_words": null,
"original_words": null,
"scrambled_words": null,
"sorted_words": null,
"source... |
Your task is to sort words in ascending or descending order using ASCII/Unicode ordering.
Your output should be a comma-separated list of words, e.g. word_1, word_2, word_3
Now, sort these words in ascending order (using ASCII/Unicode ordering) and return them as a comma-separated list: bought, mummy, count, over, is... | bought, count, islands, mummy, over | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": [
3,
10
],
"word_len": null,
"word_length": [
3,
12
],
"words": null
},
"direction": "ascending",
"num_words": 5,
"original_words": [
"bought",
"mummy",
"count",... |
Your task is to unsramble words in a sentence.
For each word in a sentence, the letter may have been randomly shuffled. Your task is to unscramble the words.
The order of the words in the sentence is preserved. Moreover, the style of the sentence is preserved (i.e. punctuation, capitalization, new lines, etc.).
Your... | know will firmly oppose every movement not only against Paris our capital or | {
"corruption_level": 0.22140228363248077,
"difficulty": {
"corruption_level": [
0.1,
0.9
],
"num_words": null,
"word_len": [
1,
50
],
"word_length": null,
"words": [
3,
40
]
},
"direction": null,
"num_words": 13,
"original_words": [
"k... |
Your task is to unsramble words in a sentence.
For each word in a sentence, the letter may have been randomly shuffled. Your task is to unscramble the words.
The order of the words in the sentence is preserved. Moreover, the style of the sentence is preserved (i.e. punctuation, capitalization, new lines, etc.).
Your... | Redistribution is subject to the trademark license especially commercial redistribution START FULL LICENSE THE FULL PROJECT GUTENBERG LICENSE PLEASE READ THIS BEFORE YOU DISTRIBUTE OR USE THIS WORK To protect the Project | {
"corruption_level": 0.7586595569304578,
"difficulty": {
"corruption_level": [
0.1,
0.9
],
"num_words": null,
"word_len": [
1,
50
],
"word_length": null,
"words": [
3,
40
]
},
"direction": null,
"num_words": 32,
"original_words": [
"Re... |
Spell this word backward (example: sun -> nus): alloplasty | ytsalpolla | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": null,
"word_len": [
3,
10
],
"word_length": null,
"words": null
},
"direction": null,
"num_words": null,
"original_words": null,
"scrambled_words": null,
"sorted_words": null,
"source... |
Your task is to unsramble words in a sentence.
For each word in a sentence, the letter may have been randomly shuffled. Your task is to unscramble the words.
The order of the words in the sentence is preserved. Moreover, the style of the sentence is preserved (i.e. punctuation, capitalization, new lines, etc.).
Your... | paying any fees or charges If you are redistributing or providing access to a work with the phrase Project Gutenberg associated with or appearing on the work you must comply either with the requirements | {
"corruption_level": 0.31463793744685764,
"difficulty": {
"corruption_level": [
0.1,
0.9
],
"num_words": null,
"word_len": [
1,
50
],
"word_length": null,
"words": [
3,
40
]
},
"direction": null,
"num_words": 34,
"original_words": [
"p... |
Spell this word backward (example: sun -> nus): embryonary | yranoyrbme | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": null,
"word_len": [
3,
10
],
"word_length": null,
"words": null
},
"direction": null,
"num_words": null,
"original_words": null,
"scrambled_words": null,
"sorted_words": null,
"source... |
Your task is to sort words in ascending or descending order using ASCII/Unicode ordering.
Your output should be a comma-separated list of words, e.g. word_1, word_2, word_3
Now, sort these words in descending order (using ASCII/Unicode ordering) and return them as a comma-separated list: differences, check, associate... | permitted, inventions, invalidity, galvanized, differences, check, associated, apparent, Latins | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": [
3,
10
],
"word_len": null,
"word_length": [
3,
12
],
"words": null
},
"direction": "descending",
"num_words": 9,
"original_words": [
"differences",
"check",
"a... |
Your task is to unsramble words in a sentence.
For each word in a sentence, the letter may have been randomly shuffled. Your task is to unscramble the words.
The order of the words in the sentence is preserved. Moreover, the style of the sentence is preserved (i.e. punctuation, capitalization, new lines, etc.).
Your... | no doubt as to the possibility of success in such an undertaking Meanwhile asked Mr Smith after a moment s silence have you no news of interest to day | {
"corruption_level": 0.26809210739850187,
"difficulty": {
"corruption_level": [
0.1,
0.9
],
"num_words": null,
"word_len": [
1,
50
],
"word_length": null,
"words": [
3,
40
]
},
"direction": null,
"num_words": 29,
"original_words": [
"n... |
Your task is to unsramble words in a sentence.
For each word in a sentence, the letter may have been randomly shuffled. Your task is to unscramble the words.
The order of the words in the sentence is preserved. Moreover, the style of the sentence is preserved (i.e. punctuation, capitalization, new lines, etc.).
Your... | distribution must comply with both paragraphs E through E and any additional terms imposed by the copyright holder Additional terms will be linked to the Project Gutenberg License for all works posted with the permission of the copyright | {
"corruption_level": 0.3284407303554371,
"difficulty": {
"corruption_level": [
0.1,
0.9
],
"num_words": null,
"word_len": [
1,
50
],
"word_length": null,
"words": [
3,
40
]
},
"direction": null,
"num_words": 38,
"original_words": [
"di... |
Your task is to sort words in ascending or descending order using ASCII/Unicode ordering.
Your output should be a comma-separated list of words, e.g. word_1, word_2, word_3
Now, sort these words in descending order (using ASCII/Unicode ordering) and return them as a comma-separated list: round, because, long
| round, long, because | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": [
3,
10
],
"word_len": null,
"word_length": [
3,
12
],
"words": null
},
"direction": "descending",
"num_words": 3,
"original_words": [
"round",
"because",
"long"... |
Your task is to sort words in ascending or descending order using ASCII/Unicode ordering.
Your output should be a comma-separated list of words, e.g. word_1, word_2, word_3
Now, sort these words in descending order (using ASCII/Unicode ordering) and return them as a comma-separated list: derivative, article, confiden... | derivative, confident, article | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": [
3,
10
],
"word_len": null,
"word_length": [
3,
12
],
"words": null
},
"direction": "descending",
"num_words": 3,
"original_words": [
"derivative",
"article",
"... |
Spell this word backward (example: sun -> nus): ramp | pmar | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": null,
"word_len": [
3,
10
],
"word_length": null,
"words": null
},
"direction": null,
"num_words": null,
"original_words": null,
"scrambled_words": null,
"sorted_words": null,
"source... |
Spell this word backward (example: sun -> nus): munt | tnum | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": null,
"word_len": [
3,
10
],
"word_length": null,
"words": null
},
"direction": null,
"num_words": null,
"original_words": null,
"scrambled_words": null,
"sorted_words": null,
"source... |
Spell this word backward (example: sun -> nus): compasser | ressapmoc | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": null,
"word_len": [
3,
10
],
"word_length": null,
"words": null
},
"direction": null,
"num_words": null,
"original_words": null,
"scrambled_words": null,
"sorted_words": null,
"source... |
Your task is to unsramble words in a sentence.
For each word in a sentence, the letter may have been randomly shuffled. Your task is to unscramble the words.
The order of the words in the sentence is preserved. Moreover, the style of the sentence is preserved (i.e. punctuation, capitalization, new lines, etc.).
Your... | not necessarily keep eBooks in compliance with any particular paper edition Most people start at our website which | {
"corruption_level": 0.532095550266185,
"difficulty": {
"corruption_level": [
0.1,
0.9
],
"num_words": null,
"word_len": [
1,
50
],
"word_length": null,
"words": [
3,
40
]
},
"direction": null,
"num_words": 18,
"original_words": [
"not... |
Spell this word backward (example: sun -> nus): Capparis | sirappaC | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": null,
"word_len": [
3,
10
],
"word_length": null,
"words": null
},
"direction": null,
"num_words": null,
"original_words": null,
"scrambled_words": null,
"sorted_words": null,
"source... |
Your task is to sort words in ascending or descending order using ASCII/Unicode ordering.
Your output should be a comma-separated list of words, e.g. word_1, word_2, word_3
Now, sort these words in ascending order (using ASCII/Unicode ordering) and return them as a comma-separated list: EIN, loneliness, ensuring, ari... | EIN, Nay, arise, being, discontinue, drama, ensuring, images, loneliness, photographs | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": [
3,
10
],
"word_len": null,
"word_length": [
3,
12
],
"words": null
},
"direction": "ascending",
"num_words": 10,
"original_words": [
"EIN",
"loneliness",
"ensu... |
Your task is to sort words in ascending or descending order using ASCII/Unicode ordering.
Your output should be a comma-separated list of words, e.g. word_1, word_2, word_3
Now, sort these words in ascending order (using ASCII/Unicode ordering) and return them as a comma-separated list: Norm, portion, prize
| Norm, portion, prize | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": [
3,
10
],
"word_len": null,
"word_length": [
3,
12
],
"words": null
},
"direction": "ascending",
"num_words": 3,
"original_words": [
"Norm",
"portion",
"prize"
... |
Your task is to sort words in ascending or descending order using ASCII/Unicode ordering.
Your output should be a comma-separated list of words, e.g. word_1, word_2, word_3
Now, sort these words in ascending order (using ASCII/Unicode ordering) and return them as a comma-separated list: 100, invented, fact, proprieta... | 100, fact, invented, proprietary | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": [
3,
10
],
"word_len": null,
"word_length": [
3,
12
],
"words": null
},
"direction": "ascending",
"num_words": 4,
"original_words": [
"100",
"invented",
"fact",
... |
Your task is to unsramble words in a sentence.
For each word in a sentence, the letter may have been randomly shuffled. Your task is to unscramble the words.
The order of the words in the sentence is preserved. Moreover, the style of the sentence is preserved (i.e. punctuation, capitalization, new lines, etc.).
Your... | right Your pulse Regular And your appetite Only passably | {
"corruption_level": 0.10028833066440974,
"difficulty": {
"corruption_level": [
0.1,
0.9
],
"num_words": null,
"word_len": [
1,
50
],
"word_length": null,
"words": [
3,
40
]
},
"direction": null,
"num_words": 9,
"original_words": [
"ri... |
Your task is to sort words in ascending or descending order using ASCII/Unicode ordering.
Your output should be a comma-separated list of words, e.g. word_1, word_2, word_3
Now, sort these words in descending order (using ASCII/Unicode ordering) and return them as a comma-separated list: watering, outer, came, status... | witness, watering, status, outer, colony, came, 809 | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": [
3,
10
],
"word_len": null,
"word_length": [
3,
12
],
"words": null
},
"direction": "descending",
"num_words": 7,
"original_words": [
"watering",
"outer",
"came... |
Spell this word backward (example: sun -> nus): clawed | dewalc | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": null,
"word_len": [
3,
10
],
"word_length": null,
"words": null
},
"direction": null,
"num_words": null,
"original_words": null,
"scrambled_words": null,
"sorted_words": null,
"source... |
Spell this word backward (example: sun -> nus): opprobry | yrborppo | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": null,
"word_len": [
3,
10
],
"word_length": null,
"words": null
},
"direction": null,
"num_words": null,
"original_words": null,
"scrambled_words": null,
"sorted_words": null,
"source... |
Your task is to sort words in ascending or descending order using ASCII/Unicode ordering.
Your output should be a comma-separated list of words, e.g. word_1, word_2, word_3
Now, sort these words in descending order (using ASCII/Unicode ordering) and return them as a comma-separated list: discovery, consume, Monroe, i... | paying, images, discovery, consume, Monroe | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": [
3,
10
],
"word_len": null,
"word_length": [
3,
12
],
"words": null
},
"direction": "descending",
"num_words": 5,
"original_words": [
"discovery",
"consume",
"M... |
Spell this word backward (example: sun -> nus): santoninic | cininotnas | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": null,
"word_len": [
3,
10
],
"word_length": null,
"words": null
},
"direction": null,
"num_words": null,
"original_words": null,
"scrambled_words": null,
"sorted_words": null,
"source... |
Your task is to sort words in ascending or descending order using ASCII/Unicode ordering.
Your output should be a comma-separated list of words, e.g. word_1, word_2, word_3
Now, sort these words in descending order (using ASCII/Unicode ordering) and return them as a comma-separated list: innovation, With, starting
| starting, innovation, With | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": [
3,
10
],
"word_len": null,
"word_length": [
3,
12
],
"words": null
},
"direction": "descending",
"num_words": 3,
"original_words": [
"innovation",
"With",
"sta... |
Your task is to sort words in ascending or descending order using ASCII/Unicode ordering.
Your output should be a comma-separated list of words, e.g. word_1, word_2, word_3
Now, sort these words in descending order (using ASCII/Unicode ordering) and return them as a comma-separated list: enough, small, departments, r... | small, remaining, enough, duly, departments | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": [
3,
10
],
"word_len": null,
"word_length": [
3,
12
],
"words": null
},
"direction": "descending",
"num_words": 5,
"original_words": [
"enough",
"small",
"depart... |
Your task is to sort words in ascending or descending order using ASCII/Unicode ordering.
Your output should be a comma-separated list of words, e.g. word_1, word_2, word_3
Now, sort these words in ascending order (using ASCII/Unicode ordering) and return them as a comma-separated list: accordance, dry, terms, Very, ... | FULL, Very, accordance, collects, dry, phonographs, pleasure, terms | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": [
3,
10
],
"word_len": null,
"word_length": [
3,
12
],
"words": null
},
"direction": "ascending",
"num_words": 8,
"original_words": [
"accordance",
"dry",
"terms... |
Your task is to sort words in ascending or descending order using ASCII/Unicode ordering.
Your output should be a comma-separated list of words, e.g. word_1, word_2, word_3
Now, sort these words in ascending order (using ASCII/Unicode ordering) and return them as a comma-separated list: scene, moral, rest, with, Use
| Use, moral, rest, scene, with | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": [
3,
10
],
"word_len": null,
"word_length": [
3,
12
],
"words": null
},
"direction": "ascending",
"num_words": 5,
"original_words": [
"scene",
"moral",
"rest",
... |
Your task is to unsramble words in a sentence.
For each word in a sentence, the letter may have been randomly shuffled. Your task is to unscramble the words.
The order of the words in the sentence is preserved. Moreover, the style of the sentence is preserved (i.e. punctuation, capitalization, new lines, etc.).
Your... | sent to the Project Gutenberg Literary Archive Foundation at the address | {
"corruption_level": 0.894984839775557,
"difficulty": {
"corruption_level": [
0.1,
0.9
],
"num_words": null,
"word_len": [
1,
50
],
"word_length": null,
"words": [
3,
40
]
},
"direction": null,
"num_words": 11,
"original_words": [
"sen... |
Your task is to sort words in ascending or descending order using ASCII/Unicode ordering.
Your output should be a comma-separated list of words, e.g. word_1, word_2, word_3
Now, sort these words in descending order (using ASCII/Unicode ordering) and return them as a comma-separated list: collection, ones, find, publi... | telescopes, published, ones, nasal, harmony, find, continuous, collection, Lake | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": [
3,
10
],
"word_len": null,
"word_length": [
3,
12
],
"words": null
},
"direction": "descending",
"num_words": 9,
"original_words": [
"collection",
"ones",
"fin... |
Your task is to sort words in ascending or descending order using ASCII/Unicode ordering.
Your output should be a comma-separated list of words, e.g. word_1, word_2, word_3
Now, sort these words in ascending order (using ASCII/Unicode ordering) and return them as a comma-separated list: date, skies, utmost, but, exte... | All, authors, but, date, extent, name, remote, skies, utmost | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": [
3,
10
],
"word_len": null,
"word_length": [
3,
12
],
"words": null
},
"direction": "ascending",
"num_words": 9,
"original_words": [
"date",
"skies",
"utmost",
... |
Spell this word backward (example: sun -> nus): generalia | ailareneg | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": null,
"word_len": [
3,
10
],
"word_length": null,
"words": null
},
"direction": null,
"num_words": null,
"original_words": null,
"scrambled_words": null,
"sorted_words": null,
"source... |
Your task is to unsramble words in a sentence.
For each word in a sentence, the letter may have been randomly shuffled. Your task is to unscramble the words.
The order of the words in the sentence is preserved. Moreover, the style of the sentence is preserved (i.e. punctuation, capitalization, new lines, etc.).
Your... | prevent you from copying distributing performing displaying or creating derivative works based | {
"corruption_level": 0.7914730514224962,
"difficulty": {
"corruption_level": [
0.1,
0.9
],
"num_words": null,
"word_len": [
1,
50
],
"word_length": null,
"words": [
3,
40
]
},
"direction": null,
"num_words": 12,
"original_words": [
"pr... |
Your task is to unsramble words in a sentence.
For each word in a sentence, the letter may have been randomly shuffled. Your task is to unscramble the words.
The order of the words in the sentence is preserved. Moreover, the style of the sentence is preserved (i.e. punctuation, capitalization, new lines, etc.).
Your... | States and most other parts of the world at no cost and with almost no | {
"corruption_level": 0.6042896719728281,
"difficulty": {
"corruption_level": [
0.1,
0.9
],
"num_words": null,
"word_len": [
1,
50
],
"word_length": null,
"words": [
3,
40
]
},
"direction": null,
"num_words": 15,
"original_words": [
"St... |
Spell this word backward (example: sun -> nus): preloan | naolerp | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": null,
"word_len": [
3,
10
],
"word_length": null,
"words": null
},
"direction": null,
"num_words": null,
"original_words": null,
"scrambled_words": null,
"sorted_words": null,
"source... |
Your task is to sort words in ascending or descending order using ASCII/Unicode ordering.
Your output should be a comma-separated list of words, e.g. word_1, word_2, word_3
Now, sort these words in ascending order (using ASCII/Unicode ordering) and return them as a comma-separated list: counsel, IRS, beginning, ones,... | IRS, Pardon, Pressed, beginning, counsel, engineer, ones | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": [
3,
10
],
"word_len": null,
"word_length": [
3,
12
],
"words": null
},
"direction": "ascending",
"num_words": 7,
"original_words": [
"counsel",
"IRS",
"beginnin... |
Your task is to sort words in ascending or descending order using ASCII/Unicode ordering.
Your output should be a comma-separated list of words, e.g. word_1, word_2, word_3
Now, sort these words in ascending order (using ASCII/Unicode ordering) and return them as a comma-separated list: EXCEPT, star, late, shells, pr... | EXCEPT, UNDER, follow, late, phonograph, presents, shells, star | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": [
3,
10
],
"word_len": null,
"word_length": [
3,
12
],
"words": null
},
"direction": "ascending",
"num_words": 8,
"original_words": [
"EXCEPT",
"star",
"late",
... |
Spell this word backward (example: sun -> nus): prefixed | dexiferp | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": null,
"word_len": [
3,
10
],
"word_length": null,
"words": null
},
"direction": null,
"num_words": null,
"original_words": null,
"scrambled_words": null,
"sorted_words": null,
"source... |
Spell this word backward (example: sun -> nus): euphemous | suomehpue | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": null,
"word_len": [
3,
10
],
"word_length": null,
"words": null
},
"direction": null,
"num_words": null,
"original_words": null,
"scrambled_words": null,
"sorted_words": null,
"source... |
Your task is to unsramble words in a sentence.
For each word in a sentence, the letter may have been randomly shuffled. Your task is to unscramble the words.
The order of the words in the sentence is preserved. Moreover, the style of the sentence is preserved (i.e. punctuation, capitalization, new lines, etc.).
Your... | Gutenberg License for all works posted with the permission of the copyright holder found at the beginning of this work E Do not unlink or detach or remove the full Project Gutenberg License | {
"corruption_level": 0.1898547778256366,
"difficulty": {
"corruption_level": [
0.1,
0.9
],
"num_words": null,
"word_len": [
1,
50
],
"word_length": null,
"words": [
3,
40
]
},
"direction": null,
"num_words": 33,
"original_words": [
"Gu... |
Your task is to unsramble words in a sentence.
For each word in a sentence, the letter may have been randomly shuffled. Your task is to unscramble the words.
The order of the words in the sentence is preserved. Moreover, the style of the sentence is preserved (i.e. punctuation, capitalization, new lines, etc.).
Your... | daily tour through the several departments of his newspaper is now | {
"corruption_level": 0.17241604009816047,
"difficulty": {
"corruption_level": [
0.1,
0.9
],
"num_words": null,
"word_len": [
1,
50
],
"word_length": null,
"words": [
3,
40
]
},
"direction": null,
"num_words": 11,
"original_words": [
"d... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.