question stringlengths 51 740 | answer stringlengths 1 369 | metadata unknown |
|---|---|---|
Restore the correct order of words in the following sentence: is who so 3000 It away. thus or miles to take one _tête-à-tête_ with breakfast delightful is | It is is delightful thus to take breakfast _tête-à-tête_ with one who 3000 miles or so away. | {
"source_dataset": "sentence_reordering",
"source_index": 0,
"word_count": 19,
"difficulty": {
"words_in_sentence": [
3,
20
]
}
} |
Spell this word backward (example: sun -> nus): palpation | noitaplap | {
"source_dataset": "spell_backward",
"source_index": 1,
"word": "palpation",
"word_len": 9,
"difficulty": {
"word_len": [
3,
10
]
}
} |
How many times does the letter "r" appear in the text: "years ago its subscription list contained but a few hundred"? | 3 | {
"source_dataset": "letter_counting",
"source_index": 2,
"span_length": 10,
"target_letter": "r",
"span": [
"years",
"ago",
"its",
"subscription",
"list",
"contained",
"but",
"a",
"few",
"hundred"
],
"difficulty": {
"words": [
5,
15
]
}
} |
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: Once, replies, short, men, fib... | Once, fibers, men, performing, plans, replies, short, unimaginable | {
"source_dataset": "word_sorting",
"source_index": 3,
"original_words": [
"Once",
"replies",
"short",
"men",
"fibers",
"unimaginable",
"performing",
"plans"
],
"sorted_words": [
"Once",
"fibers",
"men",
"performing",
"plans",
"replies",
"short",
... |
Decrypt this Caesar cipher text: MVY MVYAF OL WYVKBJLK HUK KPZAYPIBALK WYVQLJA LIVVRZ DPAO VUSF H SVVZL ULADVYR VM CVSBUALLY ZBWWVYA. Provide only the decrypted text as your final answer. | FOR FORTY HE PRODUCED AND DISTRIBUTED PROJECT EBOOKS WITH ONLY A LOOSE NETWORK OF VOLUNTEER SUPPORT | {
"source_dataset": "caesar_cipher",
"source_index": 4,
"rotation": 7,
"cipher_text": "MVY MVYAF OL WYVKBJLK HUK KPZAYPIBALK WYVQLJA LIVVRZ DPAO VUSF H SVVZL ULADVYR VM CVSBUALLY ZBWWVYA",
"clear_text": "FOR FORTY HE PRODUCED AND DISTRIBUTED PROJECT EBOOKS WITH ONLY A LOOSE NETWORK OF VOLUNTEER SUPPORT",
"n... |
How many times does the letter "n" appear in the text: "these eight had only impracticable schemes to propose In fact one of"? | 3 | {
"source_dataset": "letter_counting",
"source_index": 5,
"span_length": 12,
"target_letter": "n",
"span": [
"these",
"eight",
"had",
"only",
"impracticable",
"schemes",
"to",
"propose",
"In",
"fact",
"one",
"of"
],
"difficulty": {
"words": [
5,
... |
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... | regulating charities and charitable donations in all states of the United | {
"source_dataset": "letter_jumble",
"source_index": 6,
"num_words": 11,
"corruption_level": 0.143618124,
"scrambled_words": [
"regulitang",
"iharitces",
"dna",
"charitable",
"donatnois",
"ni",
"all",
"ttases",
"fo",
"eht",
"Utined"
],
"original_words": [
"r... |
Spell this word backward (example: sun -> nus): gametogony | ynogotemag | {
"source_dataset": "spell_backward",
"source_index": 7,
"word": "gametogony",
"word_len": 10,
"difficulty": {
"word_len": [
3,
10
]
}
} |
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... | Faithburn was coffined and laid in a | {
"source_dataset": "letter_jumble",
"source_index": 8,
"num_words": 7,
"corruption_level": 0.4511501405,
"scrambled_words": [
"Faithnubr",
"saw",
"fdfconei",
"adn",
"ldia",
"ni",
"a"
],
"original_words": [
"Faithburn",
"was",
"coffined",
"and",
"laid",
... |
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: simplest, transactions, suspen... | next, side, simplest, suspended, transactions, vision | {
"source_dataset": "word_sorting",
"source_index": 9,
"original_words": [
"simplest",
"transactions",
"suspended",
"vision",
"next",
"side"
],
"sorted_words": [
"next",
"side",
"simplest",
"suspended",
"transactions",
"vision"
],
"transformed_words": [
... |
Decrypt this Caesar cipher text: DW UHJXODU LQWHUYDOV WKHB DUH HYHU DGGUHVVLQJ WR WKH DPHULFDQ JRYHUQPHQW YDLQ FRPSODLQWV. Provide only the decrypted text as your final answer. | AT REGULAR INTERVALS THEY ARE EVER ADDRESSING TO THE AMERICAN GOVERNMENT VAIN COMPLAINTS | {
"source_dataset": "caesar_cipher",
"source_index": 10,
"rotation": 3,
"cipher_text": "DW UHJXODU LQWHUYDOV WKHB DUH HYHU DGGUHVVLQJ WR WKH DPHULFDQ JRYHUQPHQW YDLQ FRPSODLQWV",
"clear_text": "AT REGULAR INTERVALS THEY ARE EVER ADDRESSING TO THE AMERICAN GOVERNMENT VAIN COMPLAINTS",
"num_words": 13,
"dif... |
Restore the correct order of words in the following sentence: alone, Left Mr. | Left alone, Mr. | {
"source_dataset": "sentence_reordering",
"source_index": 11,
"word_count": 3,
"difficulty": {
"words_in_sentence": [
3,
20
]
}
} |
Decrypt this Caesar cipher text: KDIRGOSY KBKXE UTK VXKYKTZ. Provide only the decrypted text as your final answer. | EXCLAIMS EVERY ONE PRESENT | {
"source_dataset": "caesar_cipher",
"source_index": 12,
"rotation": 6,
"cipher_text": "KDIRGOSY KBKXE UTK VXKYKTZ",
"clear_text": "EXCLAIMS EVERY ONE PRESENT",
"num_words": 4,
"difficulty": {
"words": [
3,
20
],
"rotation": [
1,
25
]
}
} |
Spell this word backward (example: sun -> nus): thrawcrook | koorcwarht | {
"source_dataset": "spell_backward",
"source_index": 13,
"word": "thrawcrook",
"word_len": 10,
"difficulty": {
"word_len": [
3,
10
]
}
} |
Decrypt this Caesar cipher text: HBXIW PH WT HTKTGTS RDBBJCXRPIXDC LXIW EPGXH. Provide only the decrypted text as your final answer. | SMITH AS HE SEVERED COMMUNICATION WITH PARIS | {
"source_dataset": "caesar_cipher",
"source_index": 14,
"rotation": 15,
"cipher_text": "HBXIW PH WT HTKTGTS RDBBJCXRPIXDC LXIW EPGXH",
"clear_text": "SMITH AS HE SEVERED COMMUNICATION WITH PARIS",
"num_words": 7,
"difficulty": {
"words": [
3,
20
],
"rotation": [
1,
25
... |
Spell this word backward (example: sun -> nus): roquist | tsiuqor | {
"source_dataset": "spell_backward",
"source_index": 15,
"word": "roquist",
"word_len": 7,
"difficulty": {
"word_len": [
3,
10
]
}
} |
Restore the correct order of words in the following sentence: what your outcome practical "And be will the discovery? of | "And what will be the practical outcome of your discovery? | {
"source_dataset": "sentence_reordering",
"source_index": 16,
"word_count": 10,
"difficulty": {
"words_in_sentence": [
3,
20
]
}
} |
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: confirmation, dissecting, lea... | taxed, never, near, leave, least, hundred, dissecting, confirmation, PROJECT, Donations | {
"source_dataset": "word_sorting",
"source_index": 17,
"original_words": [
"confirmation",
"dissecting",
"least",
"hundred",
"leave",
"Donations",
"taxed",
"near",
"never",
"PROJECT"
],
"sorted_words": [
"taxed",
"never",
"near",
"leave",
"least",
... |
How many times does the letter "k" appear in the text: "electronic works provided that You pay a royalty fee of 20 of"? | 1 | {
"source_dataset": "letter_counting",
"source_index": 18,
"span_length": 12,
"target_letter": "k",
"span": [
"electronic",
"works",
"provided",
"that",
"You",
"pay",
"a",
"royalty",
"fee",
"of",
"20",
"of"
],
"difficulty": {
"words": [
5,
15... |
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... | fees to meet and keep up with these requirements We do not solicit donations in locations | {
"source_dataset": "letter_jumble",
"source_index": 19,
"num_words": 16,
"corruption_level": 0.3310755747,
"scrambled_words": [
"fsee",
"ot",
"mete",
"nad",
"eekp",
"pu",
"wtih",
"shete",
"risueremqnte",
"eW",
"od",
"nto",
"sclioti",
"donotiasn",
"n... |
Decrypt this Caesar cipher text: JVMXD RETSPISR WQMXL FSYKLX MX JSV E QIVI ERH SVMKMREXIH XIPITLSRMG NSYVREPMWQ. Provide only the decrypted text as your final answer. | FRITZ NAPOLEON SMITH BOUGHT IT FOR A MERE AND ORIGINATED TELEPHONIC JOURNALISM | {
"source_dataset": "caesar_cipher",
"source_index": 20,
"rotation": 4,
"cipher_text": "JVMXD RETSPISR WQMXL FSYKLX MX JSV E QIVI ERH SVMKMREXIH XIPITLSRMG NSYVREPMWQ",
"clear_text": "FRITZ NAPOLEON SMITH BOUGHT IT FOR A MERE AND ORIGINATED TELEPHONIC JOURNALISM",
"num_words": 12,
"difficulty": {
"wor... |
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... | copy it give it away | {
"source_dataset": "letter_jumble",
"source_index": 21,
"num_words": 5,
"corruption_level": 0.1928746567,
"scrambled_words": [
"cypo",
"ti",
"giev",
"ti",
"away"
],
"original_words": [
"copy",
"it",
"give",
"it",
"away"
],
"difficulty": {
"word_len": [
... |
Your task is to unsramble words in a sentence.
For each word in a sentence, the letter may have been randomly shuffled. Your task is to unscramble the words.
The order of the words in the sentence is preserved. Moreover, the style of the sentence is preserved (i.e. punctuation, capitalization, new lines, etc.).
Your... | Project Gutenberg Literary Archive Foundation The Project Gutenberg Literary Archive Foundation is a non profit c educational | {
"source_dataset": "letter_jumble",
"source_index": 22,
"num_words": 17,
"corruption_level": 0.8526431065000001,
"scrambled_words": [
"ePctrjo",
"gbeunteGr",
"Lieratry",
"hAvcrie",
"ndotnaFiou",
"heT",
"Pjtoecr",
"rGtegenbu",
"rLieyrta",
"Acrhive",
"Fndtoiuaon",
... |
How many times does the letter "f" appear in the text: "the Mission of Project Gutenberg Project Gutenberg is synonymous with the free"? | 2 | {
"source_dataset": "letter_counting",
"source_index": 23,
"span_length": 12,
"target_letter": "f",
"span": [
"the",
"Mission",
"of",
"Project",
"Gutenberg",
"Project",
"Gutenberg",
"is",
"synonymous",
"with",
"the",
"free"
],
"difficulty": {
"words": [
... |
Spell this word backward (example: sun -> nus): caroba | aborac | {
"source_dataset": "spell_backward",
"source_index": 24,
"word": "caroba",
"word_len": 6,
"difficulty": {
"word_len": [
3,
10
]
}
} |
Spell this word backward (example: sun -> nus): archaistic | citsiahcra | {
"source_dataset": "spell_backward",
"source_index": 25,
"word": "archaistic",
"word_len": 10,
"difficulty": {
"word_len": [
3,
10
]
}
} |
An anagram is a word formed by rearranging the letters of a different word, using all the original letters exactly once.
Your job is to group the anagrams together. You can return the answer in any order.
The output is a list of lists of strings, where each outer list contains a group of anagrams, e.g. [["eat", "tea"... | [["ark", "kra"], ["ascebc", "ebcasc"], ["birks", "brisk"], ["calipers", "spiracle"], ["corrida", "ricardo"], ["cremona", "romance"], ["prosode", "spoored"], ["shutes", "tushes", "tusseh"], ["spignel", "spingel"], ["stract", "tracts"]] | {
"source_dataset": "group_anagrams",
"source_index": 26,
"words": [
"spignel",
"spingel",
"kra",
"ark",
"romance",
"cremona",
"ascebc",
"ebcasc",
"spoored",
"prosode",
"corrida",
"ricardo",
"brisk",
"birks",
"stract",
"tracts",
"tusseh",
"tu... |
Restore the correct order of words in the following sentence: for suspended a while moment These are experiments Dr. | These experiments are suspended for a moment while Dr. | {
"source_dataset": "sentence_reordering",
"source_index": 27,
"word_count": 9,
"difficulty": {
"words_in_sentence": [
3,
20
]
}
} |
Decrypt this Caesar cipher text: HSPCP ESP MPO DEZZO TY ESP XZCYTYR L ELMWP LWW DACPLO NZXPD FA ESCZFRS ESP QWZZC. Provide only the decrypted text as your final answer. | WHERE THE BED STOOD IN THE MORNING A TABLE ALL SPREAD COMES UP THROUGH THE FLOOR | {
"source_dataset": "caesar_cipher",
"source_index": 28,
"rotation": 11,
"cipher_text": "HSPCP ESP MPO DEZZO TY ESP XZCYTYR L ELMWP LWW DACPLO NZXPD FA ESCZFRS ESP QWZZC",
"clear_text": "WHERE THE BED STOOD IN THE MORNING A TABLE ALL SPREAD COMES UP THROUGH THE FLOOR",
"num_words": 16,
"difficulty": {
... |
How many times does the letter "5" appear in the text: "City UT 84116 801 596 1887 Email contact links and up to date contact"? | 1 | {
"source_dataset": "letter_counting",
"source_index": 29,
"span_length": 14,
"target_letter": "5",
"span": [
"City",
"UT",
"84116",
"801",
"596",
"1887",
"Email",
"contact",
"links",
"and",
"up",
"to",
"date",
"contact"
],
"difficulty": {
"words... |
Spell this word backward (example: sun -> nus): midwatch | hctawdim | {
"source_dataset": "spell_backward",
"source_index": 30,
"word": "midwatch",
"word_len": 8,
"difficulty": {
"word_len": [
3,
10
]
}
} |
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: return, shows, Here, unutiliz... | unutilized, straight, shows, return, methods, lack, facing, _naïveté_, The, Here | {
"source_dataset": "word_sorting",
"source_index": 31,
"original_words": [
"return",
"shows",
"Here",
"unutilized",
"straight",
"methods",
"_naïveté_",
"lack",
"The",
"facing"
],
"sorted_words": [
"unutilized",
"straight",
"shows",
"return",
"method... |
Decrypt this Caesar cipher text: HBXIW ID SG. Provide only the decrypted text as your final answer. | SMITH TO DR | {
"source_dataset": "caesar_cipher",
"source_index": 32,
"rotation": 15,
"cipher_text": "HBXIW ID SG",
"clear_text": "SMITH TO DR",
"num_words": 3,
"difficulty": {
"words": [
3,
20
],
"rotation": [
1,
25
]
}
} |
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... | moon about face Ah there s something | {
"source_dataset": "letter_jumble",
"source_index": 33,
"num_words": 7,
"corruption_level": 0.45000260080000004,
"scrambled_words": [
"omon",
"ouabt",
"eacf",
"hA",
"teher",
"s",
"oimenshtg"
],
"original_words": [
"moon",
"about",
"face",
"Ah",
"there",
... |
How many times does the letter "i" appear in the text: "at no additional cost fee or expense"? | 2 | {
"source_dataset": "letter_counting",
"source_index": 34,
"span_length": 7,
"target_letter": "i",
"span": [
"at",
"no",
"additional",
"cost",
"fee",
"or",
"expense"
],
"difficulty": {
"words": [
5,
15
]
}
} |
An anagram is a word formed by rearranging the letters of a different word, using all the original letters exactly once.
Your job is to group the anagrams together. You can return the answer in any order.
The output is a list of lists of strings, where each outer list contains a group of anagrams, e.g. [["eat", "tea"... | [["ag", "ga"], ["antar", "antra", "ratan"], ["asta", "sata"], ["daler", "lader", "readl"], ["diopside", "dipodies"], ["evictors", "vortices"], ["lovers", "solver"], ["sanes", "sensa"], ["sidewalk", "walkside"]] | {
"source_dataset": "group_anagrams",
"source_index": 35,
"words": [
"sanes",
"sensa",
"sidewalk",
"walkside",
"evictors",
"vortices",
"ratan",
"antar",
"antra",
"sata",
"asta",
"diopside",
"dipodies",
"ga",
"ag",
"lader",
"daler",
"readl",
... |
An anagram is a word formed by rearranging the letters of a different word, using all the original letters exactly once.
Your job is to group the anagrams together. You can return the answer in any order.
The output is a list of lists of strings, where each outer list contains a group of anagrams, e.g. [["eat", "tea"... | [["ableness", "blaeness", "sensable"], ["agnate", "tanega"], ["freshet", "hefters"], ["gravures", "verrugas"], ["pyosepticemic", "septicopyemic"], ["velout", "volute"]] | {
"source_dataset": "group_anagrams",
"source_index": 36,
"words": [
"velout",
"volute",
"septicopyemic",
"pyosepticemic",
"tanega",
"agnate",
"freshet",
"hefters",
"ableness",
"sensable",
"blaeness",
"verrugas",
"gravures"
],
"solution": [
[
"able... |
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: map, whom, past, suffice, Ave... | whom, suffice, service, past, map, lacks, captivated, bleus_, Avenue, 150 | {
"source_dataset": "word_sorting",
"source_index": 37,
"original_words": [
"map",
"whom",
"past",
"suffice",
"Avenue",
"captivated",
"bleus_",
"service",
"150",
"lacks"
],
"sorted_words": [
"whom",
"suffice",
"service",
"past",
"map",
"lacks",
... |
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: territory, tried, house, conc... | tried, territory, house, conceived, cities | {
"source_dataset": "word_sorting",
"source_index": 38,
"original_words": [
"territory",
"tried",
"house",
"conceived",
"cities"
],
"sorted_words": [
"tried",
"territory",
"house",
"conceived",
"cities"
],
"transformed_words": [
"territory",
"tried",
"ho... |
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... | talking pronouncing a name his name Fritz The delightful | {
"source_dataset": "letter_jumble",
"source_index": 39,
"num_words": 9,
"corruption_level": 0.6610451854,
"scrambled_words": [
"tiglkna",
"ngonouripcn",
"a",
"anem",
"hsi",
"neam",
"tizFr",
"hTe",
"lgidefthlu"
],
"original_words": [
"talking",
"pronouncing",
... |
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: GIVE, ten, 2792, voce_, later... | voce_, ten, small, later, current, GIVE, 2792 | {
"source_dataset": "word_sorting",
"source_index": 40,
"original_words": [
"GIVE",
"ten",
"2792",
"voce_",
"later",
"current",
"small"
],
"sorted_words": [
"voce_",
"ten",
"small",
"later",
"current",
"GIVE",
"2792"
],
"transformed_words": [
"GI... |
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... | this morning was not niggard of blessings | {
"source_dataset": "letter_jumble",
"source_index": 41,
"num_words": 7,
"corruption_level": 0.6903320562,
"scrambled_words": [
"tish",
"norginm",
"was",
"tno",
"giragdn",
"fo",
"gbeilsnss"
],
"original_words": [
"this",
"morning",
"was",
"not",
"niggard",
... |
An anagram is a word formed by rearranging the letters of a different word, using all the original letters exactly once.
Your job is to group the anagrams together. You can return the answer in any order.
The output is a list of lists of strings, where each outer list contains a group of anagrams, e.g. [["eat", "tea"... | [["antimeric", "carminite", "criminate", "metrician"], ["flook", "kloof"], ["incisure", "sciurine"], ["manitos", "stamnoi"], ["norselled", "rondelles"]] | {
"source_dataset": "group_anagrams",
"source_index": 42,
"words": [
"rondelles",
"norselled",
"criminate",
"carminite",
"metrician",
"antimeric",
"flook",
"kloof",
"stamnoi",
"manitos",
"incisure",
"sciurine"
],
"solution": [
[
"antimeric",
"car... |
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: copies, wrought, able, gutenb... | wrought, maintaining, gutenberg, copies, able | {
"source_dataset": "word_sorting",
"source_index": 43,
"original_words": [
"copies",
"wrought",
"able",
"gutenberg",
"maintaining"
],
"sorted_words": [
"wrought",
"maintaining",
"gutenberg",
"copies",
"able"
],
"transformed_words": [
"copies",
"wrought",
... |
An anagram is a word formed by rearranging the letters of a different word, using all the original letters exactly once.
Your job is to group the anagrams together. You can return the answer in any order.
The output is a list of lists of strings, where each outer list contains a group of anagrams, e.g. [["eat", "tea"... | [["choreoid", "ochidore"], ["golder", "lodger"], ["hipline", "philine"], ["hotpresses", "prostheses"], ["interposure", "neuropteris"], ["predental", "replanted"], ["protreaty", "reptatory"], ["tailored", "tolderia"]] | {
"source_dataset": "group_anagrams",
"source_index": 44,
"words": [
"lodger",
"golder",
"tolderia",
"tailored",
"hipline",
"philine",
"hotpresses",
"prostheses",
"replanted",
"predental",
"interposure",
"neuropteris",
"ochidore",
"choreoid",
"protreaty"... |
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: find, based, mere, PLEASE
| PLEASE, based, find, mere | {
"source_dataset": "word_sorting",
"source_index": 45,
"original_words": [
"find",
"based",
"mere",
"PLEASE"
],
"sorted_words": [
"PLEASE",
"based",
"find",
"mere"
],
"transformed_words": [
"find",
"based",
"mere",
"PLEASE"
],
"direction": "ascending",
... |
How many times does the letter "t" appear in the text: "the reporters of this straightway You"? | 5 | {
"source_dataset": "letter_counting",
"source_index": 46,
"span_length": 6,
"target_letter": "t",
"span": [
"the",
"reporters",
"of",
"this",
"straightway",
"You"
],
"difficulty": {
"words": [
5,
15
]
}
} |
Spell this word backward (example: sun -> nus): soldier | reidlos | {
"source_dataset": "spell_backward",
"source_index": 47,
"word": "soldier",
"word_len": 7,
"difficulty": {
"word_len": [
3,
10
]
}
} |
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: usually, format, Who, waiting,... | Ocean, Simply, Who, capital, format, marked, stone, usually, waiting | {
"source_dataset": "word_sorting",
"source_index": 48,
"original_words": [
"usually",
"format",
"Who",
"waiting",
"stone",
"capital",
"Simply",
"marked",
"Ocean"
],
"sorted_words": [
"Ocean",
"Simply",
"Who",
"capital",
"format",
"marked",
"ston... |
Spell this word backward (example: sun -> nus): rascalize | ezilacsar | {
"source_dataset": "spell_backward",
"source_index": 49,
"word": "rascalize",
"word_len": 9,
"difficulty": {
"word_len": [
3,
10
]
}
} |
How many times does the letter "f" appear in the text: "by U S federal laws and your state s laws The Foundation s"? | 2 | {
"source_dataset": "letter_counting",
"source_index": 50,
"span_length": 13,
"target_letter": "f",
"span": [
"by",
"U",
"S",
"federal",
"laws",
"and",
"your",
"state",
"s",
"laws",
"The",
"Foundation",
"s"
],
"difficulty": {
"words": [
5,
... |
Decrypt this Caesar cipher text: LXIW IWTXG WTPSH QTCI SDLC DKTG IWTXG TATRIGXR IWXGIN HRXTCIXUXR BTC LTGT PQHDGQTS XC IGPCHRTCSTCIPA RPARJAPIXDCH. Provide only the decrypted text as your final answer. | WITH THEIR HEADS BENT DOWN OVER THEIR ELECTRIC THIRTY SCIENTIFIC MEN WERE ABSORBED IN TRANSCENDENTAL CALCULATIONS | {
"source_dataset": "caesar_cipher",
"source_index": 51,
"rotation": 15,
"cipher_text": "LXIW IWTXG WTPSH QTCI SDLC DKTG IWTXG TATRIGXR IWXGIN HRXTCIXUXR BTC LTGT PQHDGQTS XC IGPCHRTCSTCIPA RPARJAPIXDCH",
"clear_text": "WITH THEIR HEADS BENT DOWN OVER THEIR ELECTRIC THIRTY SCIENTIFIC MEN WERE ABSORBED IN TRAN... |
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 day when these two instruments were contrived is to be dated the | {
"source_dataset": "letter_jumble",
"source_index": 52,
"num_words": 14,
"corruption_level": 0.5599734535,
"scrambled_words": [
"oFrm",
"hte",
"ady",
"ehnw",
"shete",
"wto",
"inntmusetrs",
"were",
"cvrtoedin",
"si",
"ot",
"eb",
"dated",
"eht"
],
"or... |
An anagram is a word formed by rearranging the letters of a different word, using all the original letters exactly once.
Your job is to group the anagrams together. You can return the answer in any order.
The output is a list of lists of strings, where each outer list contains a group of anagrams, e.g. [["eat", "tea"... | [["alchitran", "clathrina"], ["depit", "tepid"], ["farcilite", "laticifer", "telfairic"], ["headmen", "needham"], ["unmantle", "unmental"]] | {
"source_dataset": "group_anagrams",
"source_index": 53,
"words": [
"unmantle",
"unmental",
"headmen",
"needham",
"depit",
"tepid",
"farcilite",
"telfairic",
"laticifer",
"alchitran",
"clathrina"
],
"solution": [
[
"alchitran",
"clathrina"
],
... |
How many times does the letter "g" appear in the text: "Project Gutenberg electronic works in your possession If you paid a"? | 2 | {
"source_dataset": "letter_counting",
"source_index": 54,
"span_length": 11,
"target_letter": "g",
"span": [
"Project",
"Gutenberg",
"electronic",
"works",
"in",
"your",
"possession",
"If",
"you",
"paid",
"a"
],
"difficulty": {
"words": [
5,
15
... |
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: paperwork, dear, compressed, e... | Toward, asphyxiating, compressed, dear, efforts, explained, facing, paperwork, passably | {
"source_dataset": "word_sorting",
"source_index": 55,
"original_words": [
"paperwork",
"dear",
"compressed",
"efforts",
"explained",
"asphyxiating",
"Toward",
"facing",
"passably"
],
"sorted_words": [
"Toward",
"asphyxiating",
"compressed",
"dear",
"ef... |
How many times does the letter "v" appear in the text: "Besides my government as you must know will firmly oppose every movement not only"? | 3 | {
"source_dataset": "letter_counting",
"source_index": 56,
"span_length": 14,
"target_letter": "v",
"span": [
"Besides",
"my",
"government",
"as",
"you",
"must",
"know",
"will",
"firmly",
"oppose",
"every",
"movement",
"not",
"only"
],
"difficulty": ... |
How many times does the letter "h" appear in the text: "by Jules Verne and Michel Verne END"? | 1 | {
"source_dataset": "letter_counting",
"source_index": 57,
"span_length": 7,
"target_letter": "h",
"span": [
"by",
"Jules",
"Verne",
"and",
"Michel",
"Verne",
"END"
],
"difficulty": {
"words": [
5,
15
]
}
} |
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: need, coachman, connect, pay,... | pay, need, human, connect, coachman | {
"source_dataset": "word_sorting",
"source_index": 58,
"original_words": [
"need",
"coachman",
"connect",
"pay",
"human"
],
"sorted_words": [
"pay",
"need",
"human",
"connect",
"coachman"
],
"transformed_words": [
"need",
"coachman",
"connect",
"pay... |
Restore the correct order of words in the following sentence: in law Gutenberg™ creating Project the copyright collection. | copyright law in creating the Project Gutenberg™ collection. | {
"source_dataset": "sentence_reordering",
"source_index": 59,
"word_count": 8,
"difficulty": {
"words_in_sentence": [
3,
20
]
}
} |
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, eastern, pillows
| pillows, eastern, danger | {
"source_dataset": "word_sorting",
"source_index": 60,
"original_words": [
"danger",
"eastern",
"pillows"
],
"sorted_words": [
"pillows",
"eastern",
"danger"
],
"transformed_words": [
"danger",
"eastern",
"pillows"
],
"direction": "descending",
"num_words": 3,
... |
Decrypt this Caesar cipher text: FYZN NI ZYYFCHA BY FUS XIQH IH UH YRNYHMCIH WBUCL. Provide only the decrypted text as your final answer. | LEFT TO FEELING HE LAY DOWN ON AN EXTENSION CHAIR | {
"source_dataset": "caesar_cipher",
"source_index": 61,
"rotation": 20,
"cipher_text": "FYZN NI ZYYFCHA BY FUS XIQH IH UH YRNYHMCIH WBUCL",
"clear_text": "LEFT TO FEELING HE LAY DOWN ON AN EXTENSION CHAIR",
"num_words": 10,
"difficulty": {
"words": [
3,
20
],
"rotation": [
1... |
Decrypt this Caesar cipher text: ESP LEEPYETZY ZQ ESP NSTYPDP RZGPCYXPYE DSLWW MP NLWWPO EZ ESP XLEEPC. Provide only the decrypted text as your final answer. | THE ATTENTION OF THE CHINESE GOVERNMENT SHALL BE CALLED TO THE MATTER | {
"source_dataset": "caesar_cipher",
"source_index": 62,
"rotation": 11,
"cipher_text": "ESP LEEPYETZY ZQ ESP NSTYPDP RZGPCYXPYE DSLWW MP NLWWPO EZ ESP XLEEPC",
"clear_text": "THE ATTENTION OF THE CHINESE GOVERNMENT SHALL BE CALLED TO THE MATTER",
"num_words": 12,
"difficulty": {
"words": [
3,
... |
Decrypt this Caesar cipher text: WNA KLAJEJC PDA DA ATLHWEJAZ. Provide only the decrypted text as your final answer. | ARE OPENING THE HE EXPLAINED | {
"source_dataset": "caesar_cipher",
"source_index": 63,
"rotation": 22,
"cipher_text": "WNA KLAJEJC PDA DA ATLHWEJAZ",
"clear_text": "ARE OPENING THE HE EXPLAINED",
"num_words": 5,
"difficulty": {
"words": [
3,
20
],
"rotation": [
1,
25
]
}
} |
Restore the correct order of words in the following sentence: "Could Smith, "that one but--" musingly, what? could if | Smith, musingly, "that if one could but--" "Could what? | {
"source_dataset": "sentence_reordering",
"source_index": 64,
"word_count": 9,
"difficulty": {
"words_in_sentence": [
3,
20
]
}
} |
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: editions, sleep, serves, Napo... | transcribe, sleep, serves, editions, eastern, abating, Napoleon | {
"source_dataset": "word_sorting",
"source_index": 65,
"original_words": [
"editions",
"sleep",
"serves",
"Napoleon",
"abating",
"eastern",
"transcribe"
],
"sorted_words": [
"transcribe",
"sleep",
"serves",
"editions",
"eastern",
"abating",
"Napoleon"
... |
Spell this word backward (example: sun -> nus): metewand | dnawetem | {
"source_dataset": "spell_backward",
"source_index": 66,
"word": "metewand",
"word_len": 8,
"difficulty": {
"word_len": [
3,
10
]
}
} |
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: labor, things, creation, power... | coach, creation, labor, power, rays, things | {
"source_dataset": "word_sorting",
"source_index": 67,
"original_words": [
"labor",
"things",
"creation",
"power",
"rays",
"coach"
],
"sorted_words": [
"coach",
"creation",
"labor",
"power",
"rays",
"things"
],
"transformed_words": [
"labor",
"thing... |
Decrypt this Caesar cipher text: ATOZKJ QOTMJUS LGRRY ZU ZNK YNGXK UL ZNK ZNK OTJOKY ZU ZNGZ YGOJ SX. Provide only the decrypted text as your final answer. | UNITED KINGDOM FALLS TO THE SHARE OF THE THE INDIES TO THAT SAID MR | {
"source_dataset": "caesar_cipher",
"source_index": 68,
"rotation": 6,
"cipher_text": "ATOZKJ QOTMJUS LGRRY ZU ZNK YNGXK UL ZNK ZNK OTJOKY ZU ZNGZ YGOJ SX",
"clear_text": "UNITED KINGDOM FALLS TO THE SHARE OF THE THE INDIES TO THAT SAID MR",
"num_words": 14,
"difficulty": {
"words": [
3,
... |
An anagram is a word formed by rearranging the letters of a different word, using all the original letters exactly once.
Your job is to group the anagrams together. You can return the answer in any order.
The output is a list of lists of strings, where each outer list contains a group of anagrams, e.g. [["eat", "tea"... | [["bede", "debe"], ["bird", "brid", "drib"], ["bushfires", "furbishes"], ["drapable", "parabled"], ["salvers", "servals", "slavers"]] | {
"source_dataset": "group_anagrams",
"source_index": 69,
"words": [
"drib",
"brid",
"bird",
"debe",
"bede",
"bushfires",
"furbishes",
"drapable",
"parabled",
"servals",
"slavers",
"salvers"
],
"solution": [
[
"bede",
"debe"
],
[
"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... | Year was first published in the February p It was published in France the next year Although published under the | {
"source_dataset": "letter_jumble",
"source_index": 70,
"num_words": 20,
"corruption_level": 0.6777072328,
"scrambled_words": [
"arYe",
"asw",
"tirsf",
"eshlibpdu",
"ni",
"eth",
"rebuaryF",
"p",
"tI",
"asw",
"epsibluhd",
"ni",
"Fnerca",
"het",
"tnxe... |
Spell this word backward (example: sun -> nus): chylemia | aimelyhc | {
"source_dataset": "spell_backward",
"source_index": 71,
"word": "chylemia",
"word_len": 8,
"difficulty": {
"word_len": [
3,
10
]
}
} |
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: 800, annexing, artists, suppl... | synonymous, supplying, gentlemen, existence, artists, annexing, 800 | {
"source_dataset": "word_sorting",
"source_index": 72,
"original_words": [
"800",
"annexing",
"artists",
"supplying",
"synonymous",
"existence",
"gentlemen"
],
"sorted_words": [
"synonymous",
"supplying",
"gentlemen",
"existence",
"artists",
"annexing",
... |
Decrypt this Caesar cipher text: TBJO MVY AOHA LEWLYPTLUA. Provide only the decrypted text as your final answer. | MUCH FOR THAT EXPERIMENT | {
"source_dataset": "caesar_cipher",
"source_index": 73,
"rotation": 7,
"cipher_text": "TBJO MVY AOHA LEWLYPTLUA",
"clear_text": "MUCH FOR THAT EXPERIMENT",
"num_words": 4,
"difficulty": {
"words": [
3,
20
],
"rotation": [
1,
25
]
}
} |
An anagram is a word formed by rearranging the letters of a different word, using all the original letters exactly once.
Your job is to group the anagrams together. You can return the answer in any order.
The output is a list of lists of strings, where each outer list contains a group of anagrams, e.g. [["eat", "tea"... | [["caesuric", "curacies"], ["camoodie", "comoedia"], ["contoise", "cooniest", "coonties"], ["details", "dilates", "distale", "salited"], ["isabella", "sailable"], ["masonite", "somniate"], ["outerness", "outreness"], ["perfectas", "praefects"], ["staurolitic", "touristical"], ["unpursuing", "unusurping"]] | {
"source_dataset": "group_anagrams",
"source_index": 74,
"words": [
"caesuric",
"curacies",
"sailable",
"isabella",
"touristical",
"staurolitic",
"cooniest",
"coonties",
"contoise",
"unpursuing",
"unusurping",
"somniate",
"masonite",
"outerness",
"outre... |
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: concept, works, required, adde... | Smith, added, concept, everywhere, removing, required, works | {
"source_dataset": "word_sorting",
"source_index": 75,
"original_words": [
"concept",
"works",
"required",
"added",
"Smith",
"removing",
"everywhere"
],
"sorted_words": [
"Smith",
"added",
"concept",
"everywhere",
"removing",
"required",
"works"
],
... |
Restore the correct order of words in the following sentence: is a he. king Yes, | Yes, a king is he. | {
"source_dataset": "sentence_reordering",
"source_index": 76,
"word_count": 5,
"difficulty": {
"words_in_sentence": [
3,
20
]
}
} |
Decrypt this Caesar cipher text: RTQLGEV IWVGPDGTI XQNWPVGGTU CPF GORNQAGGU GZRGPF EQPUKFGTCDNG GHHQTV VQ FQ EQRATKIJV TGUGCTEJ VTCPUETKDG CPF RTQQHTGCF YQTMU PQV RTQVGEVGF DA W. Provide only the decrypted text as your final answer. | PROJECT GUTENBERG VOLUNTEERS AND EMPLOYEES EXPEND CONSIDERABLE EFFORT TO DO COPYRIGHT RESEARCH TRANSCRIBE AND PROOFREAD WORKS NOT PROTECTED BY U | {
"source_dataset": "caesar_cipher",
"source_index": 77,
"rotation": 2,
"cipher_text": "RTQLGEV IWVGPDGTI XQNWPVGGTU CPF GORNQAGGU GZRGPF EQPUKFGTCDNG GHHQTV VQ FQ EQRATKIJV TGUGCTEJ VTCPUETKDG CPF RTQQHTGCF YQTMU PQV RTQVGEVGF DA W",
"clear_text": "PROJECT GUTENBERG VOLUNTEERS AND EMPLOYEES EXPEND CONSIDERAB... |
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... | department he found the operators sitting with folded arms at their | {
"source_dataset": "letter_jumble",
"source_index": 78,
"num_words": 11,
"corruption_level": 0.5386042476,
"scrambled_words": [
"redapmtent",
"eh",
"ofudn",
"eht",
"oprtoaers",
"istnigt",
"hwti",
"ofledd",
"samr",
"ta",
"thire"
],
"original_words": [
"depar... |
Spell this word backward (example: sun -> nus): kabaragoya | ayogarabak | {
"source_dataset": "spell_backward",
"source_index": 79,
"word": "kabaragoya",
"word_len": 10,
"difficulty": {
"word_len": [
3,
10
]
}
} |
Your task is to unsramble words in a sentence.
For each word in a sentence, the letter may have been randomly shuffled. Your task is to unscramble the words.
The order of the words in the sentence is preserved. Moreover, the style of the sentence is preserved (i.e. punctuation, capitalization, new lines, etc.).
Your... | below F F Project | {
"source_dataset": "letter_jumble",
"source_index": 80,
"num_words": 4,
"corruption_level": 0.5624511158000001,
"scrambled_words": [
"bwleo",
"F",
"F",
"Pcotejr"
],
"original_words": [
"below",
"F",
"F",
"Project"
],
"difficulty": {
"word_len": [
1,
64
... |
Spell this word backward (example: sun -> nus): Maoridom | modiroaM | {
"source_dataset": "spell_backward",
"source_index": 81,
"word": "Maoridom",
"word_len": 8,
"difficulty": {
"word_len": [
3,
10
]
}
} |
Decrypt this Caesar cipher text: TUE HUEUF FA FTQ IADWE FAAW YADQ FUYQ FTMZ TQ TMP MZFUOUBMFQP. Provide only the decrypted text as your final answer. | HIS VISIT TO THE WORKS TOOK MORE TIME THAN HE HAD ANTICIPATED | {
"source_dataset": "caesar_cipher",
"source_index": 82,
"rotation": 12,
"cipher_text": "TUE HUEUF FA FTQ IADWE FAAW YADQ FUYQ FTMZ TQ TMP MZFUOUBMFQP",
"clear_text": "HIS VISIT TO THE WORKS TOOK MORE TIME THAN HE HAD ANTICIPATED",
"num_words": 12,
"difficulty": {
"words": [
3,
20
],
... |
Decrypt this Caesar cipher text: BJ RZXY YMNSP FGTZY NY. Provide only the decrypted text as your final answer. | WE MUST THINK ABOUT IT | {
"source_dataset": "caesar_cipher",
"source_index": 83,
"rotation": 5,
"cipher_text": "BJ RZXY YMNSP FGTZY NY",
"clear_text": "WE MUST THINK ABOUT IT",
"num_words": 5,
"difficulty": {
"words": [
3,
20
],
"rotation": [
1,
25
]
}
} |
Restore the correct order of words in the following sentence: will You well received! be | You will be well received! | {
"source_dataset": "sentence_reordering",
"source_index": 84,
"word_count": 5,
"difficulty": {
"words_in_sentence": [
3,
20
]
}
} |
Spell this word backward (example: sun -> nus): bunemost | tsomenub | {
"source_dataset": "spell_backward",
"source_index": 85,
"word": "bunemost",
"word_len": 8,
"difficulty": {
"word_len": [
3,
10
]
}
} |
Decrypt this Caesar cipher text: MZYPXZY OJ OCZ XJIYDODJI JA V YM. Provide only the decrypted text as your final answer. | REDUCED TO THE CONDITION OF A DR | {
"source_dataset": "caesar_cipher",
"source_index": 86,
"rotation": 21,
"cipher_text": "MZYPXZY OJ OCZ XJIYDODJI JA V YM",
"clear_text": "REDUCED TO THE CONDITION OF A DR",
"num_words": 7,
"difficulty": {
"words": [
3,
20
],
"rotation": [
1,
25
]
}
} |
Restore the correct order of words in the following sentence: resurrection, the set day 25th, proposed it Mr. September 2889, to was being his for | September 25th, 2889, being the day set for his resurrection, it was proposed to Mr. | {
"source_dataset": "sentence_reordering",
"source_index": 87,
"word_count": 15,
"difficulty": {
"words_in_sentence": [
3,
20
]
}
} |
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... | as you know You have simply to make use of hypnotism electrical or human which gives one a | {
"source_dataset": "letter_jumble",
"source_index": 88,
"num_words": 18,
"corruption_level": 0.5185029280000001,
"scrambled_words": [
"sa",
"oyu",
"kown",
"Yuo",
"eahv",
"lispym",
"ot",
"make",
"sue",
"fo",
"yhiptonsm",
"erlctiecal",
"ro",
"hmaun",
... |
How many times does the letter "i" appear in the text: "United States Compliance requirements are not uniform and it takes a considerable"? | 6 | {
"source_dataset": "letter_counting",
"source_index": 89,
"span_length": 12,
"target_letter": "i",
"span": [
"United",
"States",
"Compliance",
"requirements",
"are",
"not",
"uniform",
"and",
"it",
"takes",
"a",
"considerable"
],
"difficulty": {
"words":... |
How many times does the letter "k" appear in the text: "by using or distributing this work or any other work associated in any way with"? | 2 | {
"source_dataset": "letter_counting",
"source_index": 90,
"span_length": 15,
"target_letter": "k",
"span": [
"by",
"using",
"or",
"distributing",
"this",
"work",
"or",
"any",
"other",
"work",
"associated",
"in",
"any",
"way",
"with"
],
"difficul... |
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... | vast magnitude having to do | {
"source_dataset": "letter_jumble",
"source_index": 91,
"num_words": 5,
"corruption_level": 0.2452733124,
"scrambled_words": [
"avst",
"uagnidmte",
"hanivg",
"ot",
"od"
],
"original_words": [
"vast",
"magnitude",
"having",
"to",
"do"
],
"difficulty": {
"wor... |
Your task is to unsramble words in a sentence.
For each word in a sentence, the letter may have been randomly shuffled. Your task is to unscramble the words.
The order of the words in the sentence is preserved. Moreover, the style of the sentence is preserved (i.e. punctuation, capitalization, new lines, etc.).
Your... | s audience was closed Left to himself feeling tired | {
"source_dataset": "letter_jumble",
"source_index": 92,
"num_words": 9,
"corruption_level": 0.4055222419,
"scrambled_words": [
"s",
"adieunce",
"aws",
"solced",
"tefL",
"ot",
"mihsefl",
"efeling",
"teird"
],
"original_words": [
"s",
"audience",
"was",
"... |
Restore the correct order of words in the following sentence: thoughts. Smith's | Smith's thoughts. | {
"source_dataset": "sentence_reordering",
"source_index": 93,
"word_count": 3,
"difficulty": {
"words_in_sentence": [
3,
20
]
}
} |
Restore the correct order of words in the following sentence: stomach. "Yes, the " | " "Yes, the stomach. | {
"source_dataset": "sentence_reordering",
"source_index": 94,
"word_count": 3,
"difficulty": {
"words_in_sentence": [
3,
20
]
}
} |
Spell this word backward (example: sun -> nus): quoniam | mainouq | {
"source_dataset": "spell_backward",
"source_index": 95,
"word": "quoniam",
"word_len": 7,
"difficulty": {
"word_len": [
3,
10
]
}
} |
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: Eleven, forth, BUT, whom
| BUT, Eleven, forth, whom | {
"source_dataset": "word_sorting",
"source_index": 96,
"original_words": [
"Eleven",
"forth",
"BUT",
"whom"
],
"sorted_words": [
"BUT",
"Eleven",
"forth",
"whom"
],
"transformed_words": [
"Eleven",
"forth",
"BUT",
"whom"
],
"direction": "ascending",
"... |
Spell this word backward (example: sun -> nus): Kluxer | rexulK | {
"source_dataset": "spell_backward",
"source_index": 97,
"word": "Kluxer",
"word_len": 6,
"difficulty": {
"word_len": [
3,
10
]
}
} |
An anagram is a word formed by rearranging the letters of a different word, using all the original letters exactly once.
Your job is to group the anagrams together. You can return the answer in any order.
The output is a list of lists of strings, where each outer list contains a group of anagrams, e.g. [["eat", "tea"... | [["aval", "lava"], ["cureless", "recluses"], ["lapsed", "pedals"], ["pierlike", "ripelike"]] | {
"source_dataset": "group_anagrams",
"source_index": 98,
"words": [
"aval",
"lava",
"pedals",
"lapsed",
"recluses",
"cureless",
"pierlike",
"ripelike"
],
"solution": [
[
"aval",
"lava"
],
[
"cureless",
"recluses"
],
[
"lapsed",... |
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... | world at no cost and with almost no restrictions whatsoever You may copy it give it | {
"source_dataset": "letter_jumble",
"source_index": 99,
"num_words": 16,
"corruption_level": 0.8293605538000001,
"scrambled_words": [
"dolrw",
"ta",
"on",
"soct",
"and",
"ithw",
"alotsm",
"on",
"iernoirtssct",
"atweohresv",
"ouY",
"may",
"ycop",
"ti",
... |
End of preview. Expand in Data Studio
No dataset card yet
- Downloads last month
- 39