question stringlengths 51 696 | answer stringlengths 3 288 | metadata dict |
|---|---|---|
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: 300, wonders, RIGHT
| wonders, RIGHT, 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": 3,
"original_words": [
"300",
"wonders",
"RIGHT"
... |
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... | s innovation galvanized the | {
"corruption_level": 0.10410955941138421,
"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": [
"s"... |
Spell this word backward (example: sun -> nus): scab | bacs | {
"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: appreciate, gives, lips
| appreciate, gives, lips | {
"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": [
"appreciate",
"gives",
"lip... |
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: PGLAF, copy, before, well, Co... | well, disregarded, copy, being, before, Though, PGLAF, Company | {
"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": [
"PGLAF",
"copy",
"before",... |
Spell this word backward (example: sun -> nus): purga | agrup | {
"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): aftercast | tsacretfa | {
"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... | be modified and printed and given away you may do practically ANYTHING in the United States with eBooks not protected by U S copyright law Redistribution is | {
"corruption_level": 0.5179765961420711,
"difficulty": {
"corruption_level": [
0.1,
0.9
],
"num_words": null,
"word_len": [
1,
50
],
"word_length": null,
"words": [
3,
40
]
},
"direction": null,
"num_words": 27,
"original_words": [
"be... |
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... | often been described Besides his telephone each reporter as the reader is aware has in front of him a set of commutators which enable him to | {
"corruption_level": 0.8674834095690163,
"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": [
"of... |
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... | electronic work you indicate that you have read understand agree to and accept all the terms of this license and intellectual property trademark copyright agreement | {
"corruption_level": 0.27820526598071577,
"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": [
"e... |
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: invented, Norm, swarm, Most, s... | Most, Norm, color, invented, states, swarm | {
"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": [
"invented",
"Norm",
"swarm"... |
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... | modern type it was continually in danger of collapse Twenty years ago its subscription list contained | {
"corruption_level": 0.34706913681221063,
"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": [
"m... |
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: print, accredited, Singularly... | print, please, comes, advanced, accredited, Singularly | {
"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": [
"print",
"accredited",
"Si... |
Spell this word backward (example: sun -> nus): fogramite | etimargof | {
"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... | history of days every year except leap years and then of days for as yet no means has been found of increasing the length of the terrestrial year Jules Verne End of Project Gutenberg s | {
"corruption_level": 0.8579402437357182,
"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": [
"hi... |
Spell this word backward (example: sun -> nus): Italically | yllacilatI | {
"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 that constituted the repast He was just finishing the dessert when Mrs Smith appeared in the mirror | {
"corruption_level": 0.7200402801603663,
"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": [
"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... | requires study We must think about it In | {
"corruption_level": 0.220345588750948,
"difficulty": {
"corruption_level": [
0.1,
0.9
],
"num_words": null,
"word_len": [
1,
50
],
"word_length": null,
"words": [
3,
40
]
},
"direction": null,
"num_words": 8,
"original_words": [
"requ... |
Spell this word backward (example: sun -> nus): Grizel | lezirG | {
"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: flag, Internal, fact, sitting,... | Internal, busied, fact, flag, 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": [
"flag",
"Internal",
"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... | giving back to the atmosphere the surplus heat stored up during the summer | {
"corruption_level": 0.30859511840376197,
"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": [
"g... |
Spell this word backward (example: sun -> nus): hogfish | hsifgoh | {
"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): nobby | ybbon | {
"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): Gerres | serreG | {
"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: LIABLE, Redactor, synonymous
| synonymous, Redactor, LIABLE | {
"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": [
"LIABLE",
"Redactor",
"syn... |
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: profits, remained, ones, somet... | Service, boasted, declared, ones, profits, remained, returned, she, sometimes | {
"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": [
"profits",
"remained",
"one... |
Spell this word backward (example: sun -> nus): propodiale | elaidoporp | {
"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: since, inaction, highly, direc... | alone, cannot, directed, hard, highly, inaction, issue, sells, since | {
"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": [
"since",
"inaction",
"highl... |
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... | expend considerable effort to identify do copyright research on transcribe and proofread works not protected by U S copyright law in creating the Project Gutenberg collection Despite these efforts Project | {
"corruption_level": 0.6071934569500781,
"difficulty": {
"corruption_level": [
0.1,
0.9
],
"num_words": null,
"word_len": [
1,
50
],
"word_length": null,
"words": [
3,
40
]
},
"direction": null,
"num_words": 30,
"original_words": [
"ex... |
Spell this word backward (example: sun -> nus): splenauxe | exuanelps | {
"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... | addressing to the American government vain complaints A campaign against the annexation that has been an accomplished fact for | {
"corruption_level": 0.49191951006384704,
"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": [
"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... | do not claim a right to prevent you from copying distributing performing displaying or creating derivative works based on the work as long as all references to Project Gutenberg | {
"corruption_level": 0.33705729072344204,
"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": [
"d... |
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... | that can be freely distributed in machine readable form accessible by the widest array of equipment | {
"corruption_level": 0.4586924433408611,
"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": [
"th... |
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 day from the date of his apparent death he unhesitatingly put the theory to the proof in his own person Reduced to the condition of a mummy Dr Faithburn was coffined and laid in a tomb | {
"corruption_level": 0.22752971333442717,
"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": [
"a... |
Spell this word backward (example: sun -> nus): presentive | evitneserp | {
"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: unutilized, kinds, concerning,... | 84116, DONATIONS, Now, amounting, concerning, kinds, projects, single, there, unutilized | {
"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": [
"unutilized",
"kinds",
"co... |
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 with Paris Smith saw his wife seated alone at the dinner table looking anything but pleased at her loneliness Pardon me my dear for having left you alone he said through the | {
"corruption_level": 0.8800128073340941,
"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": [
"ma... |
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: falls, version, locomotion
| version, locomotion, falls | {
"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": [
"falls",
"version",
"locom... |
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... | Niagara For Mr Smith has | {
"corruption_level": 0.6754608788936498,
"difficulty": {
"corruption_level": [
0.1,
0.9
],
"num_words": null,
"word_len": [
1,
50
],
"word_length": null,
"words": [
3,
40
]
},
"direction": null,
"num_words": 5,
"original_words": [
"Nia... |
Spell this word backward (example: sun -> nus): Jahve | evhaJ | {
"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): busybody | ydobysub | {
"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): epigene | enegipe | {
"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: Except, specially, globe, sent... | Except, globe, instrument, middle, sentence, specially | {
"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": [
"Except",
"specially",
"glo... |
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... | one without the others should have remained undiscovered till less than a hundred years ago Nevertheless such was the course of events for it was not till the year that the famous Oswald Nier made this great discovery Truly | {
"corruption_level": 0.2532292220103064,
"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": [
"on... |
Spell this word backward (example: sun -> nus): primacy | ycamirp | {
"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... | to life to day what would he think were he to be told that this palace of marble and gold belongs to his remote descendant Fritz Napoleon Smith who after thirty | {
"corruption_level": 0.5610524128307901,
"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": [
"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... | by all the terms of this agreement you must cease using and return or destroy all copies of Project Gutenberg electronic works in your possession If you paid a fee for obtaining a copy of or access | {
"corruption_level": 0.7492346634088487,
"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": [
"by... |
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... | building in Avenue which was dedicated the other day If George Washington Smith the founder of | {
"corruption_level": 0.3550954971729562,
"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": [
"bu... |
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... | Reckoner the most complex calculations can be made in a few seconds In two hours Mr Smith completed his task Just | {
"corruption_level": 0.5772089067884643,
"difficulty": {
"corruption_level": [
0.1,
0.9
],
"num_words": null,
"word_len": [
1,
50
],
"word_length": null,
"words": [
3,
40
]
},
"direction": null,
"num_words": 21,
"original_words": [
"Re... |
Spell this word backward (example: sun -> nus): muriatic | citairum | {
"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: sated, second, pillows, Olymp... | second, sated, pillows, people, equal, door, developed, Olympus, But, ANY | {
"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": [
"sated",
"second",
"pillo... |
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 or cause to occur a distribution of this or any Project Gutenberg work b alteration modification or additions or deletions to any Project Gutenberg work and c any Defect you cause Section Information about the Mission of Project Gutenberg | {
"corruption_level": 0.5782822173244527,
"difficulty": {
"corruption_level": [
0.1,
0.9
],
"num_words": null,
"word_len": [
1,
50
],
"word_length": null,
"words": [
3,
40
]
},
"direction": null,
"num_words": 40,
"original_words": [
"do... |
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: recondite, duly, unsolicited,... | unsolicited, specified, search, references, recondite, houses, high, duly | {
"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": [
"recondite",
"duly",
"unso... |
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 that of The Russians said Mr Smith completing the sentence Australia Has an independent government Then nothing at all remains for us sighed Sir John downcast Nothing asked Mr Smith laughing Well now there s Gibraltar With this sally | {
"corruption_level": 0.3602955187658823,
"difficulty": {
"corruption_level": [
0.1,
0.9
],
"num_words": null,
"word_len": [
1,
50
],
"word_length": null,
"words": [
3,
40
]
},
"direction": null,
"num_words": 40,
"original_words": [
"to... |
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: deal, carry, louder, successfu... | Celestial, IMPLIED, Madrid, carry, deal, free, louder, successful, tour | {
"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": [
"deal",
"carry",
"louder",
... |
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... | Peer So then the moon is positively uninhabited asked Mr Smith At least answered Cooley on the face which she presents to us As for the opposite side who | {
"corruption_level": 0.2598342705450021,
"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": [
"Pe... |
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: list, returns, tired, Reckone... | withal, tired, sun, returns, note, list, happens, Reckoner | {
"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": [
"list",
"returns",
"tired"... |
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 permanent future for Project Gutenberg and future generations To learn more about the Project Gutenberg Literary Archive Foundation and how your efforts | {
"corruption_level": 0.362294306976333,
"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": [
"and... |
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... | THAT YOU HAVE NO REMEDIES FOR NEGLIGENCE STRICT LIABILITY BREACH OF WARRANTY OR BREACH OF CONTRACT EXCEPT THOSE PROVIDED IN PARAGRAPH F | {
"corruption_level": 0.5656321166059717,
"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": [
"TH... |
Spell this word backward (example: sun -> nus): soapbush | hsubpaos | {
"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): tymp | pmyt | {
"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: 1000, arise, lace
| 1000, arise, lace | {
"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": [
"1000",
"arise",
"lace"
]... |
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: However, possession, EBOOK, l... | possession, legal, inventors, However, EBOOK | {
"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": [
"However",
"possession",
"... |
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: left, wrap, become, 366, ANYT... | wrap, portrayed, left, invented, become, Project, Great, Excuse, ANYTHING, 366 | {
"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": [
"left",
"wrap",
"become",... |
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: commenced, planet, obsolete, b... | brightest, commenced, equal, obsolete, planet, possession, visionary | {
"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": [
"commenced",
"planet",
"obs... |
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, Avenue, performing, ... | performing, murmured, discovery, approach, Special, Revenue, Let, Avenue | {
"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": [
"Special",
"Avenue",
"perf... |
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... | streets feet wide their houses feet in height with a temperature the same in all seasons with their lines of aërial locomotion crossing | {
"corruption_level": 0.16396980052468785,
"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": [
"s... |
Spell this word backward (example: sun -> nus): spadroon | noordaps | {
"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... | Good by then for a little while said Mr Smith as he severed communication with Paris | {
"corruption_level": 0.762961508943067,
"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": [
"Goo... |
Spell this word backward (example: sun -> nus): umbella | allebmu | {
"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): combine | enibmoc | {
"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: fortunately, ours, mirror
| fortunately, mirror, ours | {
"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": [
"fortunately",
"ours",
"mir... |
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: BUT, damage, fix, man, secure... | secure, man, lives, latest, fix, damage, BUT | {
"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": [
"BUT",
"damage",
"fix",
... |
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... | the same in all seasons with their lines of aërial locomotion crossing the sky in every direction If they would but picture to themselves the state of things that once existed when through muddy streets rumbling | {
"corruption_level": 0.33449990018465964,
"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": [
"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... | The hats are just lovely this season I suppose I forgot | {
"corruption_level": 0.8778116970926891,
"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": [
"Th... |
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 given to commerce a mighty impetus To them we are indebted for the continuous production of electricity without batteries | {
"corruption_level": 0.7886045876378488,
"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": [
"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 descending order (using ASCII/Unicode ordering) and return them as a comma-separated list: must, flesh, distance, counse... | must, flesh, distance, counsel, consequence, 801 | {
"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": [
"must",
"flesh",
"distance... |
Spell this word backward (example: sun -> nus): Tulkepaia | aiapekluT | {
"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... | contributions from states where we have not met the solicitation requirements we know of no prohibition against | {
"corruption_level": 0.4598770064974057,
"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": [
"co... |
Spell this word backward (example: sun -> nus): autosign | ngisotua | {
"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): loka | akol | {
"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): bated | detab | {
"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... | to maintain itself at | {
"corruption_level": 0.5294263219708304,
"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": [
"to"... |
Spell this word backward (example: sun -> nus): poly | ylop | {
"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: clearly, etheric, observation... | observation, etheric, clearly, Imitate | {
"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": [
"clearly",
"etheric",
"obs... |
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: discovered, prepare, Thanks, d... | Listen, Thanks, direction, discovered, multifarious, outcome, prepare, stored | {
"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": [
"discovered",
"prepare",
"T... |
Spell this word backward (example: sun -> nus): pingle | elgnip | {
"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): thionate | etanoiht | {
"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: except, bed, destroy, chemical... | bed, believe, chemical, compare, destroy, except, lips, small, successful | {
"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": [
"except",
"bed",
"destroy",... |
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... | next addresses one of the ten reporters in the astronomical department a department still in the embryonic stage but which will yet play an important part in journalism Well Cash | {
"corruption_level": 0.29562776422275716,
"difficulty": {
"corruption_level": [
0.1,
0.9
],
"num_words": null,
"word_len": [
1,
50
],
"word_length": null,
"words": [
3,
40
]
},
"direction": null,
"num_words": 30,
"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... | derived from texts not protected by U S copyright law does not contain a notice indicating that it is | {
"corruption_level": 0.17675034819503832,
"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": [
"d... |
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 copying and distributing Project Gutenberg electronic works to protect the PROJECT GUTENBERG concept and trademark Project Gutenberg is a registered trademark and may not be used if you charge | {
"corruption_level": 0.4683309423057519,
"difficulty": {
"corruption_level": [
0.1,
0.9
],
"num_words": null,
"word_len": [
1,
50
],
"word_length": null,
"words": [
3,
40
]
},
"direction": null,
"num_words": 30,
"original_words": [
"to... |
Spell this word backward (example: sun -> nus): sauriasis | sisairuas | {
"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... | human life from up to years men have | {
"corruption_level": 0.7467936808993434,
"difficulty": {
"corruption_level": [
0.1,
0.9
],
"num_words": null,
"word_len": [
1,
50
],
"word_length": null,
"words": [
3,
40
]
},
"direction": null,
"num_words": 8,
"original_words": [
"hum... |
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... | recount to the public in daily installments a hundred novels Addressing one of these authors who was waiting his turn Capital Capital | {
"corruption_level": 0.8419487369881146,
"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": [
"re... |
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: addresses, Ambassador, unifor... | uniform, optics, house, door, dedicated, credit, bent, addresses, Fritz, Ambassador | {
"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": [
"addresses",
"Ambassador",
... |
Spell this word backward (example: sun -> nus): Myzostoma | amotsozyM | {
"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... | bold experiment made a hundred years ago by Dr Nathaniel Faithburn The doctor being a firm believer in human hibernation in other words in the possibility of our suspending our vital functions and of calling them into action | {
"corruption_level": 0.5198656444719719,
"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": [
"bo... |
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: chorus, sentence, name
| sentence, name, chorus | {
"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": [
"chorus",
"sentence",
"nam... |
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: commercial, instead, photograp... | commercial, instead, mail, photography | {
"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": [
"commercial",
"instead",
"p... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.