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... | have succumbed under the overpowering stress of the toil which Mr Smith has to perform Very fortunately for him thanks to the progress of hygiene which abating all the old sources | {
"corruption_level": 0.1282248166465479,
"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": [
"ha... |
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: bad, little, PROJECT, capricio... | PROJECT, bad, capricious, happens, little | {
"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": [
"bad",
"little",
"PROJECT",... |
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... | be made in a few seconds In two hours Mr Smith | {
"corruption_level": 0.21186845674110355,
"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": [
"b... |
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: Grand, project, modified, hav... | times, project, modified, having, gathered, creation, accords, Shall, Grand | {
"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": [
"Grand",
"project",
"modif... |
Spell this word backward (example: sun -> nus): coeloma | amoleoc | {
"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... | a fee for obtaining a copy of | {
"corruption_level": 0.17848604471517052,
"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": [
"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... | all powerful editor A discussion was going on when he entered Your Excellency will pardon me the French Ambassador was saying to the | {
"corruption_level": 0.8161673271593344,
"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": [
"al... |
Spell this word backward (example: sun -> nus): unflower | rewolfnu | {
"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: Samuel, GUTENBERG, first, quer... | GUTENBERG, Samuel, exclusion, first, labor, lack, queried, regard, understands, unprotected | {
"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": [
"Samuel",
"GUTENBERG",
"fi... |
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: others, taxes, determine, sch... | twelve, taxes, schemes, others, determine, 300 | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": [
3,
10
],
"word_len": null,
"word_length": [
3,
12
],
"words": null
},
"direction": "descending",
"num_words": 6,
"original_words": [
"others",
"taxes",
"determ... |
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: random, wrap, wished, question... | Ocean, countenance, given, questions, random, wished, wrap | {
"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": [
"random",
"wrap",
"wished",... |
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: reaching, expense, near, bound... | atmosphere, bound, campaign, drawn, expense, little, near, out, reaching, seasons | {
"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": [
"reaching",
"expense",
"ne... |
Spell this word backward (example: sun -> nus): hippiatric | cirtaippih | {
"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... | made How much fairer they would find our modern towns with populations amounting sometimes to souls their streets feet wide their houses feet in height with a temperature the same in all seasons with | {
"corruption_level": 0.27984034514789546,
"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": [
"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... | not niggard of blessings for the inventor when by its aid he was able distinctly to see | {
"corruption_level": 0.8474889626239376,
"difficulty": {
"corruption_level": [
0.1,
0.9
],
"num_words": null,
"word_len": [
1,
50
],
"word_length": null,
"words": [
3,
40
]
},
"direction": null,
"num_words": 17,
"original_words": [
"no... |
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... | of and all access to other copies of Project Gutenberg works You provide in accordance with paragraph F a full refund of any money paid for a work | {
"corruption_level": 0.236494282916411,
"difficulty": {
"corruption_level": [
0.1,
0.9
],
"num_words": null,
"word_len": [
1,
50
],
"word_length": null,
"words": [
3,
40
]
},
"direction": null,
"num_words": 28,
"original_words": [
"of"... |
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: clearly, editors, sun, Finally... | Finally, clearly, editors, sun, support, telephonic | {
"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": [
"clearly",
"editors",
"sun"... |
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... | to traverse its vast orbit takes years days hours minutes seconds Why didn t you tell me that sooner cried Mr Smith Now inform the reporters of this straightway You know how eager is the curiosity | {
"corruption_level": 0.2633309933563058,
"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": [
"to... |
Spell this word backward (example: sun -> nus): monomaniac | cainamonom | {
"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... | Every one has noticed those enormous advertisements reflected from the clouds so large that they may be seen by the populations of whole cities or even of entire countries This too is one of Mr Fritz Napoleon | {
"corruption_level": 0.5970091548985518,
"difficulty": {
"corruption_level": [
0.1,
0.9
],
"num_words": null,
"word_len": [
1,
50
],
"word_length": null,
"words": [
3,
40
]
},
"direction": null,
"num_words": 37,
"original_words": [
"Ev... |
Spell this word backward (example: sun -> nus): reconvince | ecnivnocer | {
"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... | ASCII or other format | {
"corruption_level": 0.14942492223874684,
"difficulty": {
"corruption_level": [
0.1,
0.9
],
"num_words": null,
"word_len": [
1,
50
],
"word_length": null,
"words": [
3,
40
]
},
"direction": null,
"num_words": 4,
"original_words": [
"AS... |
Spell this word backward (example: sun -> nus): neth | hten | {
"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): microhm | mhorcim | {
"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): aspidate | etadipsa | {
"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): secure | eruces | {
"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: quarter, ambassadors, somethin... | ambassadors, committed, common, continues, items, led, owed, quarter, something | {
"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": [
"quarter",
"ambassadors",
"... |
Spell this word backward (example: sun -> nus): auxoblast | tsalboxua | {
"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: telephones, turning, observati... | 000, 365, exclaimed, mode, observation, projectors, telephones, turning | {
"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": [
"telephones",
"turning",
"o... |
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: satisfied, Credits, three
| three, satisfied, Credits | {
"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": [
"satisfied",
"Credits",
"t... |
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... | Singularly enough all | {
"corruption_level": 0.4537422298385362,
"difficulty": {
"corruption_level": [
0.1,
0.9
],
"num_words": null,
"word_len": [
1,
50
],
"word_length": null,
"words": [
3,
40
]
},
"direction": null,
"num_words": 3,
"original_words": [
"Sin... |
Spell this word backward (example: sun -> nus): vag | gav | {
"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: toil, receive, countries, pro... | toil, renounce, receive, problems, countries, INDEMNITY | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": [
3,
10
],
"word_len": null,
"word_length": [
3,
12
],
"words": null
},
"direction": "descending",
"num_words": 6,
"original_words": [
"toil",
"receive",
"countr... |
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... | against Paris our capital or our two great prefectures Rome and Madrid but also against the | {
"corruption_level": 0.4988290275348207,
"difficulty": {
"corruption_level": [
0.1,
0.9
],
"num_words": null,
"word_len": [
1,
50
],
"word_length": null,
"words": [
3,
40
]
},
"direction": null,
"num_words": 16,
"original_words": [
"ag... |
Spell this word backward (example: sun -> nus): uprouse | esuorpu | {
"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: Special, About, forehead, ans... | trouble, forehead, answer, Special, About | {
"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": [
"Special",
"About",
"foreh... |
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: NOTICE, main, marvels, count
| marvels, main, count, NOTICE | {
"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": [
"NOTICE",
"main",
"marvels... |
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: muddy, embryonic, lay, missio... | trusty, sorts, muddy, mission, lay, having, forth, embryonic, Service, Every | {
"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": [
"muddy",
"embryonic",
"la... |
Spell this word backward (example: sun -> nus): paroli | ilorap | {
"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... | and most other parts of the world at no | {
"corruption_level": 0.17299469558859829,
"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": [
"an... |
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 | {
"corruption_level": 0.10624003553683653,
"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": [
"c... |
Spell this word backward (example: sun -> nus): logicize | ezicigol | {
"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): rundle | eldnur | {
"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: forgotten, 253d, even, Reckon... | places, freed, forgotten, even, Reckon, 253d | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": [
3,
10
],
"word_len": null,
"word_length": [
3,
12
],
"words": null
},
"direction": "descending",
"num_words": 6,
"original_words": [
"forgotten",
"253d",
"even... |
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... | online at www gutenberg org If you are not located in the United States you will have | {
"corruption_level": 0.31246045181057236,
"difficulty": {
"corruption_level": [
0.1,
0.9
],
"num_words": null,
"word_len": [
1,
50
],
"word_length": null,
"words": [
3,
40
]
},
"direction": null,
"num_words": 17,
"original_words": [
"o... |
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... | practical outcome Why that we shall be able to produce easily all bodies whatever stone wood metal fibers And flesh and blood queried Mr Smith interrupting him Do you pretend that you expect | {
"corruption_level": 0.7560668632034842,
"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": [
"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 descending order (using ASCII/Unicode ordering) and return them as a comma-separated list: prize, sufficiently, NEGLIGEN... | sufficiently, prize, ages, NEGLIGENCE, John | {
"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": [
"prize",
"sufficiently",
"... |
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 Compliance requirements are not uniform and it takes a considerable effort much paperwork and many fees to meet and keep up with these requirements We do not solicit donations in locations where we have not | {
"corruption_level": 0.7296523901991747,
"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": [
"St... |
Spell this word backward (example: sun -> nus): panophobia | aibohponap | {
"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: boxes, motive, perhaps, faint... | perhaps, motive, faint, boxes | {
"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": [
"boxes",
"motive",
"perhap... |
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... | leap years and then of days for | {
"corruption_level": 0.565105004027199,
"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": [
"leap... |
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... | shells capable of being projected a distance of miles an electric spark of miles that can at one stroke annihilate a battalion to say nothing of the plague | {
"corruption_level": 0.133713738006806,
"difficulty": {
"corruption_level": [
0.1,
0.9
],
"num_words": null,
"word_len": [
1,
50
],
"word_length": null,
"words": [
3,
40
]
},
"direction": null,
"num_words": 28,
"original_words": [
"she... |
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: ask, character, Chinese
| Chinese, ask, character | {
"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": [
"ask",
"character",
"Chines... |
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... | something in that cried the two men at once And indeed so confident was their air they seemed to have no doubt as to the possibility of success in such an undertaking Meanwhile asked Mr Smith after | {
"corruption_level": 0.112271416977232,
"difficulty": {
"corruption_level": [
0.1,
0.9
],
"num_words": null,
"word_len": [
1,
50
],
"word_length": null,
"words": [
3,
40
]
},
"direction": null,
"num_words": 37,
"original_words": [
"som... |
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... | TO WARRANTIES OF MERCHANTABILITY OR FITNESS | {
"corruption_level": 0.5579358143298112,
"difficulty": {
"corruption_level": [
0.1,
0.9
],
"num_words": null,
"word_len": [
1,
50
],
"word_length": null,
"words": [
3,
40
]
},
"direction": null,
"num_words": 6,
"original_words": [
"TO"... |
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... | to manufacture a human being out and out Why not Mr Smith advanced to the young chemist and engaged his services for the Earth Chronicle | {
"corruption_level": 0.6954246484829111,
"difficulty": {
"corruption_level": [
0.1,
0.9
],
"num_words": null,
"word_len": [
1,
50
],
"word_length": null,
"words": [
3,
40
]
},
"direction": null,
"num_words": 25,
"original_words": [
"to... |
Spell this word backward (example: sun -> nus): athenaeum | mueanehta | {
"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... | terms imposed by the copyright holder Additional | {
"corruption_level": 0.6714842279291127,
"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": [
"ter... |
Spell this word backward (example: sun -> nus): aplomb | bmolpa | {
"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): idiograph | hpargoidi | {
"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: sure, _cuisine_, witness, thro... | _cuisine_, _entrées_, confident, during, starred, sure, through, version, witness | {
"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": [
"sure",
"_cuisine_",
"witne... |
Spell this word backward (example: sun -> nus): metabolon | nolobatem | {
"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... | United Kingdom falls | {
"corruption_level": 0.163080533177184,
"difficulty": {
"corruption_level": [
0.1,
0.9
],
"num_words": null,
"word_len": [
1,
50
],
"word_length": null,
"words": [
3,
40
]
},
"direction": null,
"num_words": 3,
"original_words": [
"Unit... |
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... | France generously to renounce possession of Africa that magnificent colony the complete conquest of which cost her the labor of years You will be well received You decline All is over then murmured the British | {
"corruption_level": 0.6272162358109069,
"difficulty": {
"corruption_level": [
0.1,
0.9
],
"num_words": null,
"word_len": [
1,
50
],
"word_length": null,
"words": [
3,
40
]
},
"direction": null,
"num_words": 35,
"original_words": [
"Fr... |
Spell this word backward (example: sun -> nus): imprisoner | renosirpmi | {
"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... | Smith Now inform the reporters of this straightway You know how eager is the curiosity of the public with regard to these astronomical questions That news must go into to day s issue Then the two men bowing | {
"corruption_level": 0.625759565969473,
"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": [
"Smi... |
Spell this word backward (example: sun -> nus): synaxarion | noiraxanys | {
"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... | system has this advantage that it does away with the pestering race of the Mr Smith received and ate all alone the d and that constituted the repast He was just finishing the dessert when Mrs Smith appeared in | {
"corruption_level": 0.38589504802691965,
"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": [
"s... |
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 button gives it back to space in whatever form may be desired whether as heat light electricity or mechanical force after having first obtained from it the | {
"corruption_level": 0.5874649106405523,
"difficulty": {
"corruption_level": [
0.1,
0.9
],
"num_words": null,
"word_len": [
1,
50
],
"word_length": null,
"words": [
3,
40
]
},
"direction": null,
"num_words": 28,
"original_words": [
"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... | you are aware sir began applicant No by the aid of our | {
"corruption_level": 0.4254976166516421,
"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": [
"yo... |
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... | 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 of paragraphs E through E | {
"corruption_level": 0.6828406057080585,
"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": [
"or... |
Spell this word backward (example: sun -> nus): misdateful | lufetadsim | {
"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... | FOR ANY PURPOSE F Some states do not allow disclaimers of certain implied warranties or the | {
"corruption_level": 0.6135700713667204,
"difficulty": {
"corruption_level": [
0.1,
0.9
],
"num_words": null,
"word_len": [
1,
50
],
"word_length": null,
"words": [
3,
40
]
},
"direction": null,
"num_words": 16,
"original_words": [
"FO... |
Spell this word backward (example: sun -> nus): Sylphon | nohplyS | {
"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: well, Hall, lived, absorb, he... | well, return, matter, lived, heretofore, hearers, absorb, Hall | {
"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": [
"well",
"Hall",
"lived",
... |
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: extensive, side, going, previo... | extensive, going, previous, question, side, texts | {
"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": [
"extensive",
"side",
"going... |
Spell this word backward (example: sun -> nus): amphioxus | suxoihpma | {
"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: ended, having, instead, Europe... | Europe, ended, having, instead | {
"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": [
"ended",
"having",
"instead... |
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: nearly, royalty, conveyance, p... | and, conveyance, nearly, plague, royalty, transcribe, widest, wires | {
"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": [
"nearly",
"royalty",
"conve... |
Spell this word backward (example: sun -> nus): Portia | aitroP | {
"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: component, astonish, copying, ... | 799, astonish, become, component, copying, occupant | {
"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": [
"component",
"astonish",
"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... | reporter as the reader is aware has in front of him a set of commutators which enable him | {
"corruption_level": 0.2422897024630163,
"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": [
"re... |
Spell this word backward (example: sun -> nus): cerebrum | murberec | {
"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: eBooks, doctor, spread, silenc... | She, best, doctor, eBooks, silence, spread | {
"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": [
"eBooks",
"doctor",
"spread... |
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... | do you want Besides we will pay for what we ask Indeed answered Mr Smith without manifesting | {
"corruption_level": 0.5590867294433087,
"difficulty": {
"corruption_level": [
0.1,
0.9
],
"num_words": null,
"word_len": [
1,
50
],
"word_length": null,
"words": [
3,
40
]
},
"direction": null,
"num_words": 17,
"original_words": [
"do... |
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... | other than Plain Vanilla ASCII or other format used in the official version posted on the official Project Gutenberg website www gutenberg org you must at no additional cost fee or expense to the user provide | {
"corruption_level": 0.21145578160999134,
"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": [
"o... |
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: appeared, palace, learn
| appeared, learn, palace | {
"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": [
"appeared",
"palace",
"lear... |
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... | paragraph E B Project | {
"corruption_level": 0.8696737058485233,
"difficulty": {
"corruption_level": [
0.1,
0.9
],
"num_words": null,
"word_len": [
1,
50
],
"word_length": null,
"words": [
3,
40
]
},
"direction": null,
"num_words": 4,
"original_words": [
"par... |
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: ways, either, system, depends,... | Thanks, depends, either, system, ways | {
"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": [
"ways",
"either",
"system",... |
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: forehead, NOTICE, province, t... | trifling, supply, province, mile, forehead, fleeting, editions, NOTICE | {
"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": [
"forehead",
"NOTICE",
"pro... |
Spell this word backward (example: sun -> nus): Laudist | tsiduaL | {
"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: though, movement, South, para... | though, paragraphs, movement, individual, famous, capital, brightest, South | {
"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": [
"though",
"movement",
"Sou... |
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... | means has been found of increasing the length of the terrestrial year Jules Verne End of Project Gutenberg s In the Year by Jules Verne and | {
"corruption_level": 0.49624818557633144,
"difficulty": {
"corruption_level": [
0.1,
0.9
],
"num_words": null,
"word_len": [
1,
50
],
"word_length": null,
"words": [
3,
40
]
},
"direction": null,
"num_words": 26,
"original_words": [
"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... | Smith as he turned the tap for the first dish For like all wealthy folk in our day Mr Smith has done away with the domestic kitchen and is a subscriber to the Grand | {
"corruption_level": 0.8240494797739523,
"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": [
"Sm... |
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: counsel, boasted, rays, absol... | rays, counsel, boasted, absolute | {
"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": [
"counsel",
"boasted",
"ray... |
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... | coming of Mr Smith was like the falling of a | {
"corruption_level": 0.2532283832287626,
"difficulty": {
"corruption_level": [
0.1,
0.9
],
"num_words": null,
"word_len": [
1,
50
],
"word_length": null,
"words": [
3,
40
]
},
"direction": null,
"num_words": 10,
"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 descending order (using ASCII/Unicode ordering) and return them as a comma-separated list: murmured, PGLAF, engineer, ch... | murmured, engineer, checks, PGLAF | {
"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": [
"murmured",
"PGLAF",
"engi... |
Spell this word backward (example: sun -> nus): tempi | ipmet | {
"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: regions, Literary, set, instru... | 253d, Literary, answered, choose, folded, instrument, regions, set | {
"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": [
"regions",
"Literary",
"set... |
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: passing, spoken, PUNITIVE, mul... | PUNITIVE, _tête, broke, give, globe, lived, multifarious, passing, spoken | {
"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": [
"passing",
"spoken",
"PUNIT... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.