question stringlengths 51 696 | answer stringlengths 3 288 | metadata dict |
|---|---|---|
Your task is to unsramble words in a sentence.
For each word in a sentence, the letter may have been randomly shuffled. Your task is to unscramble the words.
The order of the words in the sentence is preserved. Moreover, the style of the sentence is preserved (i.e. punctuation, capitalization, new lines, etc.).
Your... | BREACH OF CONTRACT EXCEPT THOSE PROVIDED IN PARAGRAPH F YOU AGREE THAT THE FOUNDATION THE TRADEMARK OWNER AND ANY DISTRIBUTOR UNDER THIS AGREEMENT WILL NOT BE LIABLE TO YOU | {
"corruption_level": 0.4070813345548353,
"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": [
"BR... |
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: vain, permit, nations
| nations, permit, vain | {
"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": [
"vain",
"permit",
"nations"... |
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: map, Chinese, mission, story, ... | 799, Chinese, Listen, awaiting, coach, map, mission, nearly, reduced, story | {
"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": [
"map",
"Chinese",
"mission... |
Spell this word backward (example: sun -> nus): tupik | kiput | {
"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: granted, thirty, years, campa... | years, transformers, thirty, resultant, granted, campaign, 662 | {
"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": [
"granted",
"thirty",
"year... |
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... | Chronicle laboratory The second of the four successful applicants starting from experiments made so long ago as the nineteenth century | {
"corruption_level": 0.5662471345452386,
"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": [
"Ch... |
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: particularly, since, expend, p... | What, definitively, expend, folded, particularly, printed, proudly, silence, since, ten | {
"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": [
"particularly",
"since",
"... |
Spell this word backward (example: sun -> nus): inspreith | htierpsni | {
"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... | being a firm believer | {
"corruption_level": 0.8651067238252792,
"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": [
"bei... |
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 United States and most other parts of the world at no cost and with almost no restrictions whatsoever You may copy it give it away or re use it under the terms of the Project | {
"corruption_level": 0.5257418774464064,
"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": [
"in... |
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: lieu, Jackson, oppose
| Jackson, lieu, oppose | {
"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": [
"lieu",
"Jackson",
"oppose"... |
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... | surplus heat stored up during the | {
"corruption_level": 0.3595275559454735,
"difficulty": {
"corruption_level": [
0.1,
0.9
],
"num_words": null,
"word_len": [
1,
50
],
"word_length": null,
"words": [
3,
40
]
},
"direction": null,
"num_words": 6,
"original_words": [
"sur... |
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 practically ANYTHING in the United States with eBooks not protected by U S copyright law Redistribution is subject to the trademark license especially commercial redistribution START FULL LICENSE THE FULL PROJECT GUTENBERG LICENSE | {
"corruption_level": 0.3482786740795345,
"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": [
"do... |
Spell this word backward (example: sun -> nus): drainboard | draobniard | {
"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... | eBooks and how to subscribe to our | {
"corruption_level": 0.22366929609474281,
"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": [
"eB... |
Spell this word backward (example: sun -> nus): braker | rekarb | {
"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... | other parts of the world at no cost and with almost no restrictions whatsoever You may | {
"corruption_level": 0.1572049196841289,
"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": [
"ot... |
Spell this word backward (example: sun -> nus): tipping | gnippit | {
"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): spatheful | lufehtaps | {
"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... | fee for obtaining a copy of or access to a Project Gutenberg electronic work and you do not agree to be bound by the terms of this agreement you may | {
"corruption_level": 0.37035349967288467,
"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": [
"f... |
Spell this word backward (example: sun -> nus): sciential | laitneics | {
"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: yes, _ragoûts_, seated, criti... | yes, seated, critical, _ragoûts_ | {
"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": [
"yes",
"_ragoûts_",
"seate... |
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... | speech is an old story the transmission | {
"corruption_level": 0.533471981773692,
"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": [
"spee... |
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: Her, receive, annulment, comm... | receive, gives, eBooks, dress, communicate, annulment, Her, 2021 | {
"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": [
"Her",
"receive",
"annulme... |
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: Dead, Paris, islands
| Dead, Paris, islands | {
"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": [
"Dead",
"Paris",
"islands"
... |
Spell this word backward (example: sun -> nus): ponderment | tnemrednop | {
"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: name, marvels, commutators, o... | week, summer, punctuality, optics, name, marvels, commutators, acute, _viva, Simply | {
"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": [
"name",
"marvels",
"commu... |
Spell this word backward (example: sun -> nus): mistend | dnetsim | {
"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: erect, innumerable, hit, appea... | That, appeared, domain, erect, hit, innumerable | {
"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": [
"erect",
"innumerable",
"hi... |
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 subscriber to the Grand Alimentation Company which sends through a great network of tubes | {
"corruption_level": 0.6325230934220702,
"difficulty": {
"corruption_level": [
0.1,
0.9
],
"num_words": null,
"word_len": [
1,
50
],
"word_length": null,
"words": [
3,
40
]
},
"direction": null,
"num_words": 15,
"original_words": [
"a"... |
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: opened, images, leap, compute... | opened, leap, images, computer | {
"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": [
"opened",
"images",
"leap"... |
Spell this word backward (example: sun -> nus): caisson | nossiac | {
"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): tsadik | kidast | {
"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: time, grace, Heat, table, sto... | time, table, story, newspaperdom, grace, dress, Heat | {
"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": [
"time",
"grace",
"Heat",
... |
Your task is to unsramble words in a sentence.
For each word in a sentence, the letter may have been randomly shuffled. Your task is to unscramble the words.
The order of the words in the sentence is preserved. Moreover, the style of the sentence is preserved (i.e. punctuation, capitalization, new lines, etc.).
Your... | the simple pressure of a button gives it back to space in whatever form may be desired whether as heat light | {
"corruption_level": 0.49814935492298096,
"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": [
"t... |
Your task is to sort words in ascending or descending order using ASCII/Unicode ordering.
Your output should be a comma-separated list of words, e.g. word_1, word_2, word_3
Now, sort these words in ascending order (using ASCII/Unicode ordering) and return them as a comma-separated list: seemed, THOSE, flesh, shall, m... | Besides, THOSE, flesh, make, seemed, shall, thanks | {
"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": [
"seemed",
"THOSE",
"flesh",... |
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: instruments, fairyland, alter... | instruments, fairyland, alteration | {
"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": [
"instruments",
"fairyland",
... |
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 you there is | {
"corruption_level": 0.34519214184568936,
"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): Saho | ohaS | {
"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): grape | eparg | {
"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: permission, sixty, What, faire... | What, fairest, mile, permission, polar, shows, sixty | {
"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": [
"permission",
"sixty",
"Wha... |
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: Revenue, lace, RIGHT, Slavs, p... | RIGHT, Revenue, Slavs, belligerents, lace, organ, proof, provide, resolved, widest | {
"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": [
"Revenue",
"lace",
"RIGHT"... |
Spell this word backward (example: sun -> nus): muciform | mroficum | {
"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 revive painting an art fallen into desuetude owing to the progress made in color photography Another a physician boasted that he had discovered a cure for nasal catarrh These impracticables were dismissed in short order Of the | {
"corruption_level": 0.11999182291980448,
"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": [
"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... | KIND EXPRESS OR IMPLIED INCLUDING BUT NOT LIMITED TO WARRANTIES OF MERCHANTABILITY OR FITNESS FOR ANY PURPOSE F Some states do | {
"corruption_level": 0.8554362445654538,
"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": [
"KI... |
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 advertisement hall he passes to the reception chamber where the ambassadors accredited to the American government are awaiting | {
"corruption_level": 0.7482073288395624,
"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": [
"fr... |
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: transcribe, WARRANTIES, physi... | transcribe, supplying, physical, make, formats, folk, finishing, department, alternate, WARRANTIES | {
"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": [
"transcribe",
"WARRANTIES",
... |
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: houses, bodies, lifted, count... | lifted, library, houses, count, bodies | {
"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": [
"houses",
"bodies",
"lifte... |
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 was like the falling of a bomb among them Well gentlemen | {
"corruption_level": 0.7124599712630436,
"difficulty": {
"corruption_level": [
0.1,
0.9
],
"num_words": null,
"word_len": [
1,
50
],
"word_length": null,
"words": [
3,
40
]
},
"direction": null,
"num_words": 12,
"original_words": [
"Sm... |
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 olden time one room fitted with ingenious mechanical contrivances is enough Here he sleeps takes his meals in short lives He seats himself In the mirror of the phonotelephote is seen the | {
"corruption_level": 0.4757176465642826,
"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": [
"th... |
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: status, large, subscription, S... | NOTICE, Salt, equal, file, large, status, subscription | {
"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": [
"status",
"large",
"subscri... |
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 discover a defect in this electronic work within days of receiving it you can receive a refund of the money | {
"corruption_level": 0.7457753402560069,
"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": [
"yo... |
Spell this word backward (example: sun -> nus): muciform | mroficum | {
"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: whatsoever, concept, compound... | whatsoever, solution, sitting, lacks, concept, compounded | {
"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": [
"whatsoever",
"concept",
"... |
Spell this word backward (example: sun -> nus): ovationary | yranoitavo | {
"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... | of counsel or advice from the all powerful editor A discussion was going on when he entered Your Excellency will pardon me the French Ambassador was | {
"corruption_level": 0.573084120273398,
"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"... |
Spell this word backward (example: sun -> nus): Derotrema | amertoreD | {
"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... | variety of computers including obsolete old middle aged and new computers It exists because of the efforts of hundreds of volunteers and donations from people in all walks | {
"corruption_level": 0.6008343684639447,
"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": [
"va... |
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 United States and most other parts of the world at no cost and with almost no restrictions whatsoever You may copy it give it away or re use it under the terms of the Project Gutenberg | {
"corruption_level": 0.5312146775017305,
"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": [
"in... |
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... | How is it he asked | {
"corruption_level": 0.2921462474394068,
"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": [
"How... |
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: picture, has, viewing, commerc... | clock, commerce, has, picture, viewing | {
"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": [
"picture",
"has",
"viewing"... |
Spell this word backward (example: sun -> nus): Alogian | naigolA | {
"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): nounize | ezinuon | {
"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): sharecrop | porcerahs | {
"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 check the laws of your country in addition to the terms of this | {
"corruption_level": 0.21851654628999553,
"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": [
"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... | equal number of telephones are communicating to | {
"corruption_level": 0.337775272133505,
"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": [
"equa... |
Spell this word backward (example: sun -> nus): yalla | allay | {
"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): sophiology | ygoloihpos | {
"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... | the others should have remained undiscovered till less than a hundred years | {
"corruption_level": 0.6253047071806972,
"difficulty": {
"corruption_level": [
0.1,
0.9
],
"num_words": null,
"word_len": [
1,
50
],
"word_length": null,
"words": [
3,
40
]
},
"direction": null,
"num_words": 12,
"original_words": [
"th... |
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: simple, advertising, compilat... | simple, house, employees, compilation, advertising, 200 | {
"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": [
"simple",
"advertising",
"... |
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... | thousand projectors are constantly engaged in displaying upon the clouds these mammoth advertisements When Mr | {
"corruption_level": 0.46503762669244864,
"difficulty": {
"corruption_level": [
0.1,
0.9
],
"num_words": null,
"word_len": [
1,
50
],
"word_length": null,
"words": [
3,
40
]
},
"direction": null,
"num_words": 15,
"original_words": [
"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... | body and it resounds like a block of wood They are now applying heat now electricity No result These experiments are suspended for a moment while Dr Wilkins makes | {
"corruption_level": 0.6532264138097028,
"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": [
"bo... |
Spell this word backward (example: sun -> nus): paunchful | lufhcnuap | {
"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... | follow the terms of this agreement and help preserve free future access to Project Gutenberg electronic works See paragraph E below C The Project Gutenberg Literary Archive Foundation the Foundation or PGLAF | {
"corruption_level": 0.11595055881033921,
"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": [
"f... |
Spell this word backward (example: sun -> nus): agnoiology | ygoloionga | {
"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... | force from the accumulator and on the simple pressure of a button gives it | {
"corruption_level": 0.822188984862786,
"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": [
"for... |
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: pillows, appearing, organized... | sides, sated, pillows, organized, mean, existence, appearing | {
"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": [
"pillows",
"appearing",
"o... |
Spell this word backward (example: sun -> nus): trustably | ylbatsurt | {
"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... | 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.22482935824556424,
"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": [
"c... |
Spell this word backward (example: sun -> nus): Pyrularia | airaluryP | {
"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: anon, SEND, collapse, name, ex... | SEND, anon, collapse, examination, name | {
"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": [
"anon",
"SEND",
"collapse",... |
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: straightway, invention, Her, ... | straightway, spoken, invention, Her | {
"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": [
"straightway",
"invention",
... |
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... | back to space in whatever form may be desired | {
"corruption_level": 0.4784739155107842,
"difficulty": {
"corruption_level": [
0.1,
0.9
],
"num_words": null,
"word_len": [
1,
50
],
"word_length": null,
"words": [
3,
40
]
},
"direction": null,
"num_words": 9,
"original_words": [
"bac... |
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... | full refund of any money paid | {
"corruption_level": 0.7705902905309219,
"difficulty": {
"corruption_level": [
0.1,
0.9
],
"num_words": null,
"word_len": [
1,
50
],
"word_length": null,
"words": [
3,
40
]
},
"direction": null,
"num_words": 6,
"original_words": [
"ful... |
Spell this word backward (example: sun -> nus): tharm | mraht | {
"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: Kingdom, previous, Archive, m... | previous, machine, Kingdom, Archive | {
"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": [
"Kingdom",
"previous",
"Ar... |
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... | work in any country other than the | {
"corruption_level": 0.8477239134849442,
"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": [
"wor... |
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: visit, whatever, reading, play... | 000, complex, play, reading, visit, whatever | {
"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": [
"visit",
"whatever",
"readi... |
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: much, displayed, production, ... | word, wood, production, much, mean, happier, displayed, THIS | {
"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": [
"much",
"displayed",
"prod... |
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: part, receive, associated, new... | associated, millions, news, organ, part, receive | {
"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": [
"part",
"receive",
"associa... |
Spell this word backward (example: sun -> nus): sublimable | elbamilbus | {
"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... | provide in accordance with paragraph F a full refund of any money | {
"corruption_level": 0.10077825648482781,
"difficulty": {
"corruption_level": [
0.1,
0.9
],
"num_words": null,
"word_len": [
1,
50
],
"word_length": null,
"words": [
3,
40
]
},
"direction": null,
"num_words": 12,
"original_words": [
"p... |
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: took, viewing, newspaper, Add... | wheels, viewing, unpatriotic, took, newspaper, Additional | {
"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": [
"took",
"viewing",
"newspa... |
Spell this word backward (example: sun -> nus): ausu | usua | {
"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): silicyl | lycilis | {
"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): Rainer | reniaR | {
"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): biotite | etitoib | {
"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): muletress | ssertelum | {
"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... | length over which proudly floats the hundred starred flag of | {
"corruption_level": 0.2672050808884683,
"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": [
"le... |
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... | inhabitants That s it added Peer So then the moon is positively uninhabited asked Mr | {
"corruption_level": 0.49951295113849004,
"difficulty": {
"corruption_level": [
0.1,
0.9
],
"num_words": null,
"word_len": [
1,
50
],
"word_length": null,
"words": [
3,
40
]
},
"direction": null,
"num_words": 15,
"original_words": [
"i... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.