question stringlengths 51 696 | answer stringlengths 3 288 | metadata dict |
|---|---|---|
Spell this word backward (example: sun -> nus): Pehlevi | ivelheP | {
"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): fritterer | rerettirf | {
"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... | states who approach us with offers to donate International donations are gratefully accepted but we cannot make any statements concerning tax treatment of donations received from outside the United States U S laws alone swamp our small staff | {
"corruption_level": 0.25336218242582276,
"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": [
"s... |
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: consequence, directed, every, ... | United, consequence, convert, directed, every, nothing, receive, signals | {
"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": [
"consequence",
"directed",
... |
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... | me to go to work in earnest on the question of artificial clouds It will never do for us to be always thus | {
"corruption_level": 0.714665853292213,
"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": [
"me"... |
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... | resolved to subject the theory to a practical test To this end having first made his last will and pointed out the proper method of awakening him having also | {
"corruption_level": 0.5018173481711362,
"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": [
"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: legally, future, law, images,... | since, preserve, pestering, legally, law, images, future, doctor | {
"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": [
"legally",
"future",
"law"... |
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... | solving the problem Indeed it may take only a few days And then Then sir I shall simply have determined the absolute All I want is money enough to carry my research to a successful issue Very well said | {
"corruption_level": 0.37738437248528445,
"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 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: Union, outside, time, printed
| Union, outside, printed, time | {
"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": [
"Union",
"outside",
"time",... |
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: danger, Toward, YEAR, bore, 1... | danger, bore, according, YEAR, Toward, 1887 | {
"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": [
"danger",
"Toward",
"YEAR"... |
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: admirable, owns, manufacture, ... | Last, admirable, between, manufacture, owns | {
"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": [
"admirable",
"owns",
"manuf... |
Spell this word backward (example: sun -> nus): unbless | sselbnu | {
"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): exegete | etegexe | {
"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): imshi | ihsmi | {
"corruption_level": null,
"difficulty": {
"corruption_level": null,
"num_words": null,
"word_len": [
3,
10
],
"word_length": null,
"words": null
},
"direction": null,
"num_words": null,
"original_words": null,
"scrambled_words": null,
"sorted_words": null,
"source... |
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... | In the meantime said Mr Smith you will dine with me As in the morning the table rose | {
"corruption_level": 0.2656687879041508,
"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": [
"In... |
Spell this word backward (example: sun -> nus): chafewax | xawefahc | {
"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: pray, right, CONTRACT, referen... | CONTRACT, applying, pray, references, right | {
"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": [
"pray",
"right",
"CONTRACT"... |
Spell this word backward (example: sun -> nus): bailiery | yreiliab | {
"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: French, witness, can, inaction... | French, Produced, can, inaction, 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": 5,
"original_words": [
"French",
"witness",
"can",... |
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: WILL, times, 642
| 642, WILL, times | {
"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": [
"WILL",
"times",
"642"
],... |
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: blessings, help, create, turn,... | blessings, compressed, create, help, permanent, permission, turn | {
"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": [
"blessings",
"help",
"creat... |
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: telephony, annihilate, below,... | wealthy, telephony, below, annihilate | {
"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": [
"telephony",
"annihilate",
... |
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: where, telephotic, Come
| where, telephotic, Come | {
"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": [
"where",
"telephotic",
"Co... |
Your task is to sort words in ascending or descending order using ASCII/Unicode ordering.
Your output should be a comma-separated list of words, e.g. word_1, word_2, word_3
Now, sort these words in ascending order (using ASCII/Unicode ordering) and return them as a comma-separated list: Leave, George, dead, absent, s... | George, Leave, absent, astounding, dead, gratefully, maintaining, passably, situated, subject | {
"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": [
"Leave",
"George",
"dead",... |
Spell this word backward (example: sun -> nus): diamb | bmaid | {
"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): cheiropody | ydoporiehc | {
"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: question, province, YEAR, esta... | Korum, YEAR, derive, established, lack, province, question | {
"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": [
"question",
"province",
"YE... |
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: often, ever, Very, where
| Very, ever, often, where | {
"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": [
"often",
"ever",
"Very",
... |
Spell this word backward (example: sun -> nus): skimback | kcabmiks | {
"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): smiris | sirims | {
"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): dashy | yhsad | {
"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): ventrine | enirtnev | {
"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... | that if one could but Could what Why turn the moon about face Ah there s something in that cried the two men at once And indeed so | {
"corruption_level": 0.4770367341682672,
"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": [
"th... |
Spell this word backward (example: sun -> nus): ooplasmic | cimsalpoo | {
"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: crowned, works, undertaking
| works, undertaking, crowned | {
"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": [
"crowned",
"works",
"under... |
Spell this word backward (example: sun -> nus): trag | gart | {
"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): caman | namac | {
"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): affable | elbaffa | {
"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: believed, electronic, sun, ad... | sun, official, includes, electronic, declares, cupola, believed, additions, Two | {
"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": [
"believed",
"electronic",
... |
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 or other immediate access to the full Project Gutenberg License must appear prominently whenever any copy of a Project Gutenberg work any work on which the phrase Project Gutenberg appears or with which the phrase | {
"corruption_level": 0.7902552636339105,
"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): metapepsis | sispepatem | {
"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... | agreement by keeping this work in the | {
"corruption_level": 0.7624835520817675,
"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": [
"agr... |
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 prepare or are legally required to prepare your periodic tax returns Royalty payments should be clearly marked as such and sent | {
"corruption_level": 0.6503780865815433,
"difficulty": {
"corruption_level": [
0.1,
0.9
],
"num_words": null,
"word_len": [
1,
50
],
"word_length": null,
"words": [
3,
40
]
},
"direction": null,
"num_words": 22,
"original_words": [
"yo... |
Your task is to sort words in ascending or descending order using ASCII/Unicode ordering.
Your output should be a comma-separated list of words, e.g. word_1, word_2, word_3
Now, sort these words in ascending order (using ASCII/Unicode ordering) and return them as a comma-separated list: ministers, noticed, concerning... | TRADEMARK, concerning, delightful, entered, ministers, noticed, occur, saying | {
"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": [
"ministers",
"noticed",
"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... | bad but what s to be done Shall we produce rain That we might do but is it of any use What we need is clouds | {
"corruption_level": 0.37803998210139367,
"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": [
"b... |
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... | 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 | {
"corruption_level": 0.5595409261816393,
"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": [
"If... |
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: clouds, events, betokened, ch... | this, take, events, entreating, easy, clouds, change, betokened, Internal, Frozen | {
"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": [
"clouds",
"events",
"beto... |
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 | {
"corruption_level": 0.23536694621391777,
"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": [
"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... | the west O is that all In that case said Mr Smith the thing can be arranged I will speak to the Secretary of State about it The attention of the Chinese | {
"corruption_level": 0.4680991268714506,
"difficulty": {
"corruption_level": [
0.1,
0.9
],
"num_words": null,
"word_len": [
1,
50
],
"word_length": null,
"words": [
3,
40
]
},
"direction": null,
"num_words": 32,
"original_words": [
"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... | www gutenberg org If you are not located in the United States you will have to check the laws of the country where you are located | {
"corruption_level": 0.3515971551460335,
"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": [
"ww... |
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... | applied the whole of America belongs to the Americans What more do you want Besides we will pay | {
"corruption_level": 0.2970497509837906,
"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": [
"ap... |
Your task is to unsramble words in a sentence.
For each word in a sentence, the letter may have been randomly shuffled. Your task is to unscramble the words.
The order of the words in the sentence is preserved. Moreover, the style of the sentence is preserved (i.e. punctuation, capitalization, new lines, etc.).
Your... | must know them must be able to follow them in their capricious meanderings Why any child can do that as you know You have simply to | {
"corruption_level": 0.36932221067570414,
"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 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: Vanilla, poles, solar, 150
| solar, poles, Vanilla, 150 | {
"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": [
"Vanilla",
"poles",
"solar... |
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... | infringement a defective or damaged disk or other medium a | {
"corruption_level": 0.17222646114039197,
"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": [
"i... |
Spell this word backward (example: sun -> nus): tallit | tillat | {
"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): organical | lacinagro | {
"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: abating, remove, group, plans,... | abating, apartments, continuous, group, intervals, laws, plans, remove, rival, surely | {
"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": [
"abating",
"remove",
"grou... |
Spell this word backward (example: sun -> nus): segolate | etaloges | {
"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): gasifiable | elbaifisag | {
"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... | another Hence is sprung a pleiad of inventors its brightest star being our great Joseph Jackson To Jackson | {
"corruption_level": 0.5992799242851675,
"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 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: constitution, sleep, _potage_
| _potage_, constitution, sleep | {
"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": [
"constitution",
"sleep",
"_... |
Spell this word backward (example: sun -> nus): gaupus | supuag | {
"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): Lamba | abmaL | {
"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): rapturist | tsirutpar | {
"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 s chamber has no occupant She is late Woman s punctuality Progress everywhere except there muttered Mr Smith as he turned the tap for the first dish For like all | {
"corruption_level": 0.31200458372882506,
"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": [
"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... | like the falling of a bomb among them Well gentlemen what is this I hear No answer from Jupiter Is it always to be thus Come Cooley you have been at work now twenty years on | {
"corruption_level": 0.5379019169757138,
"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": [
"li... |
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: DONATIONS, linked, crossing, ... | study, linked, employee, curiosity, crossing, DONATIONS | {
"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": [
"DONATIONS",
"linked",
"cr... |
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: Nathaniel, accredited, danger... | improvement, danger, crowding, counsels, agreement, accredited, Nathaniel | {
"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": [
"Nathaniel",
"accredited",
... |
Spell this word backward (example: sun -> nus): unwrite | etirwnu | {
"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): outbowed | dewobtuo | {
"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): auditorium | muirotidua | {
"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: 6221541, topics, hundred, twe... | twelve, topics, say, kinship, hundred, Grand, 6221541 | {
"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": [
"6221541",
"topics",
"hund... |
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... | Foundation information page at www gutenberg org Section Information about the Project Gutenberg Literary Archive Foundation The Project Gutenberg | {
"corruption_level": 0.7702911973464619,
"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": [
"Fo... |
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: mused, aged, increasing, becam... | aged, became, empire, given, gold, increasing, mused, undertaking | {
"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": [
"mused",
"aged",
"increasin... |
Spell this word backward (example: sun -> nus): deasil | lisaed | {
"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: novels, gathered, printed
| gathered, novels, printed | {
"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": [
"novels",
"gathered",
"prin... |
Spell this word backward (example: sun -> nus): uphill | llihpu | {
"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... | computers It exists because of the efforts of hundreds of volunteers and donations from people in all walks of | {
"corruption_level": 0.792632364527986,
"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": [
"com... |
Spell this word backward (example: sun -> nus): escobita | atibocse | {
"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... | We do not solicit donations in locations where we have not received written confirmation of compliance To SEND DONATIONS or determine the status | {
"corruption_level": 0.2307853015672836,
"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": [
"We... |
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... | just like the different stories and all the other component parts of the journal are classified automatically according to an ingenious system and reach the hearer in due succession Furthermore the hearers are free to listen only to | {
"corruption_level": 0.4718320715542593,
"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": [
"ju... |
Spell this word backward (example: sun -> nus): trenchmore | eromhcnert | {
"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... | Earth Chronicle And the history of that one day is the history of | {
"corruption_level": 0.3665651662977717,
"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": [
"Ea... |
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 production promotion and distribution of Project Gutenberg electronic works harmless from all | {
"corruption_level": 0.5906301070184526,
"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": [
"th... |
Spell this word backward (example: sun -> nus): Gekkota | atokkeG | {
"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): eulogium | muigolue | {
"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): tinger | regnit | {
"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... | discovery Truly was he a great benefactor of the human race His admirable discovery led to many another Hence is sprung | {
"corruption_level": 0.7218273402684744,
"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": [
"di... |
Spell this word backward (example: sun -> nus): persicot | tocisrep | {
"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: READ, virus, current, physici... | virus, triumphs, physician, hundred, current, carry, READ, Centropolis | {
"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": [
"READ",
"virus",
"current"... |
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... | from the banks of the Rhine to the Celestial Mountains and the Kara Korum whose shores are washed by the Frozen Ocean the Atlantic the Mediterranean | {
"corruption_level": 0.15546564769972726,
"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": [
"f... |
Spell this word backward (example: sun -> nus): cymoscope | epocsomyc | {
"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... | countries are in a constant state of change If you are outside the United States check the laws of your country in addition to the terms of | {
"corruption_level": 0.48447207676578763,
"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": [
"c... |
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: tried, Thanks, hearer, world, ... | KIND, Thanks, hearer, returns, tried, world | {
"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": [
"tried",
"Thanks",
"hearer"... |
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... | state s laws The Foundation s business office is located at North West Salt Lake City | {
"corruption_level": 0.5454157267571644,
"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": [
"st... |
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 Project Gutenberg License included with this eBook or online at www gutenberg org If you are not located in the United States you will have to check | {
"corruption_level": 0.363236667581711,
"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": [
"the... |
Spell this word backward (example: sun -> nus): nutrition | noitirtun | {
"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... | makes no representations concerning the copyright status of any work in any country other | {
"corruption_level": 0.8365689325540461,
"difficulty": {
"corruption_level": [
0.1,
0.9
],
"num_words": null,
"word_len": [
1,
50
],
"word_length": null,
"words": [
3,
40
]
},
"direction": null,
"num_words": 14,
"original_words": [
"ma... |
Spell this word backward (example: sun -> nus): mastman | namtsam | {
"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): disuniter | retinusid | {
"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... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.