{"kind":"task","effective_mode":"full","benchmark":{"kind":"benchmark","effective_mode":"full","slug":"bbeh","formal_name":"BIG-Bench Extra Hard (BBEH)","introduction":"BIG-Bench Extra Hard evaluates language-model reasoning through challenging task categories. It offers full and mini distributions; this import contains the full distribution: 4,520 questions across all 23 task categories.","introduction_ja":"","introduction_en":"","category":"Category not supplied","task_count":null,"acquisition_status":"Acquisition status not supplied","official_url":"https://github.com/google-deepmind/bbeh","indexing_mode":"index","profile":{"resources":[],"task_format":"","scoring":"","metric":"","size":"","answer_access":"","license":"","citation":"","maintainer":"","released":"","why_hard":"","related":[],"history":"","construction":"","limitations":"","saturation":"","scores":[]}},"task_id":"ca2b800c-50de-58ec-b819-5565999b3e75","task_key":"bbeh~5fword~5fsorting--full--ca2b800c-50de-58ec-b819-5565999b3e75","task_revision_id":"1","upstream_id":"","short_description":"You are an expert in word sorting. You will be provided with a list of words and…","config":"bbeh_word_sorting","split":"full","body":"{\"input\":\"\\nYou are an expert in word sorting. You will be provided with a list of words and the steps taken, in the form of thoughts, to arrange them in alphabetical order.\\nYour job is to identify the first step that was a mistake in reasoning about the order of the words. This can be misunderstanding the order of\\nthe alphabet or getting the word or letter wrong or missing a word entirely.\\nQ: Sort the following words alphabetically: List: prestige road snivel dachshund pyrolyse we've conspecific shadbush yaw lockheed israelite quixote threaten epistemology uracil describe ciliate coventry sting gadolinium\\nThought 1: I should start by looking at the first letter of the words in the list. The first letter: \\\"prestige\\\": \\\"p\\\" (16). \\\"road\\\": \\\"r\\\" (18). \\\"snivel\\\": \\\"s\\\" (19). \\\"dachshund\\\": \\\"d\\\" (4). \\\"pyrolyse\\\": \\\"p\\\" (16). \\\"we've\\\": \\\"w\\\" (23). \\\"conspecific\\\": \\\"c\\\" (3). \\\"shadbush\\\": \\\"s\\\" (19). \\\"yaw\\\": \\\"y\\\" (25). \\\"lockheed\\\": \\\"l\\\" (12). \\\"israelite\\\": \\\"i\\\" (9). \\\"quixote\\\": \\\"q\\\" (17). \\\"threaten\\\": \\\"t\\\" (20). \\\"epistemology\\\": \\\"e\\\" (5). \\\"uracil\\\": \\\"u\\\" (21). \\\"describe\\\": \\\"d\\\" (4). \\\"ciliate\\\": \\\"c\\\" (3). \\\"coventry\\\": \\\"c\\\" (3). \\\"sting\\\": \\\"s\\\" (19). \\\"gadolinium\\\": \\\"g\\\" (7).\\nThought 2: We now have: (3) [\\\"ciliate\\\" ? \\\"coventry\\\" ? \\\"conspecific\\\"] < (4) [\\\"dachshund\\\" ? \\\"describe\\\"] < (5) \\\"epistemology\\\" < (7) \\\"gadolinium\\\" < (9) \\\"israelite\\\" < (12) \\\"lockheed\\\" < (16) [\\\"prestige\\\" ? \\\"pyrolyse\\\"] < (17) \\\"quixote\\\" < (18) \\\"road\\\" < (19) [\\\"shadbush\\\" ? \\\"snivel\\\" ? \\\"sting\\\"] < (20) \\\"threaten\\\" < (21) \\\"uracil\\\" < (23) \\\"we've\\\" < (25) \\\"yaw\\\".\\nThought 3: Now let's sort this subpart [\\\"ciliate\\\" ? \\\"coventry\\\" ? \\\"conspecific\\\"] by looking at their second letters. The second letter: \\\"ciliate\\\": \\\"i\\\" (9). \\\"coventry\\\": \\\"o\\\" (15). \\\"conspecific\\\": \\\"o\\\" (15).\\nThought 4: We now have: (3) \\\"ciliate\\\" < (9) \\\"conspecific\\\" < (15) \\\"coventry\\\" for the subpart. Hence, we have \\\"ciliate\\\" < \\\"conspecific\\\" < \\\"coventry\\\" < [\\\"dachshund\\\" ? \\\"describe\\\"] < \\\"epistemology\\\" < \\\"gadolinium\\\" < \\\"israelite\\\" < \\\"lockheed\\\" < [\\\"prestige\\\" ? \\\"pyrolyse\\\"] < \\\"quixote\\\" < \\\"road\\\" < [\\\"shadbush\\\" ? \\\"snivel\\\" ? \\\"sting\\\"] < \\\"threaten\\\" < \\\"uracil\\\" < \\\"we've\\\" < \\\"yaw\\\".\\nThought 5: Now let's sort this subpart [\\\"dachshund\\\" ? \\\"describe\\\"] by looking at their second letters. The second letter: \\\"dachshund\\\": \\\"a\\\" (1). \\\"describe\\\": \\\"e\\\" (5).\\nThought 6: We now have: (1) \\\"dachshund\\\" < (5) \\\"describe\\\" for the subpart. Hence, we have \\\"ciliate\\\" < \\\"conspecific\\\" < \\\"coventry\\\" < \\\"dachshund\\\" < \\\"describe\\\" < \\\"epistemology\\\" < \\\"gadolinium\\\" < \\\"israelite\\\" < \\\"lockheed\\\" < [\\\"prestige\\\" ? \\\"pyrolyse\\\"] < \\\"quixote\\\" < \\\"road\\\" < [\\\"shadbush\\\" ? \\\"snivel\\\" ? \\\"sting\\\"] < \\\"threaten\\\" < \\\"uracil\\\" < \\\"we've\\\" < \\\"yaw\\\".\\nThought 7: Now let's sort this subpart [\\\"prestige\\\" ? \\\"pyrolyse\\\"] by looking at their second letters. The second letter: \\\"prestige\\\": \\\"r\\\" (18). \\\"pyrolyse\\\": \\\"y\\\" (25).\\nThought 8: We now have: (18) \\\"prestige\\\" < (25) \\\"pyrolyse\\\" for the subpart. Hence, we have \\\"ciliate\\\" < \\\"conspecific\\\" < \\\"coventry\\\" < \\\"dachshund\\\" < \\\"describe\\\" < \\\"epistemology\\\" < \\\"gadolinium\\\" < \\\"israelite\\\" < \\\"lockheed\\\" < \\\"prestige\\\" < \\\"pyrolyse\\\" < \\\"quixote\\\" < \\\"road\\\" < [\\\"shadbush\\\" ? \\\"snivel\\\" ? \\\"sting\\\"] < \\\"threaten\\\" < \\\"uracil\\\" < \\\"we've\\\" < \\\"yaw\\\".\\nThought 9: Now let's sort this subpart [\\\"shadbush\\\" ? \\\"snivel\\\" ? \\\"sting\\\"] by looking at their second letters. The second letter: \\\"shadbush\\\": \\\"h\\\" (8). \\\"snivel\\\": \\\"n\\\" (14). \\\"sting\\\": \\\"t\\\" (20).\\nThought 10: We now have: (8) \\\"shadbush\\\" < (14) \\\"snivel\\\" < (20) \\\"sting\\\" for the subpart. Hence, we have \\\"ciliate\\\" < \\\"conspecific\\\" < \\\"coventry\\\" < \\\"dachshund\\\" < \\\"describe\\\" < \\\"epistemology\\\" < \\\"gadolinium\\\" < \\\"israelite\\\" < \\\"lockheed\\\" < \\\"prestige\\\" < \\\"pyrolyse\\\" < \\\"quixote\\\" < \\\"road\\\" < \\\"shadbush\\\" < \\\"snivel\\\" < \\\"sting\\\" < \\\"threaten\\\" < \\\"uracil\\\" < \\\"we've\\\" < \\\"yaw\\\".\\nThought 11: I have now sorted all the words. The answer is ciliate conspecific coventry dachshund describe epistemology gadolinium israeli lockheed prestige pyrolyse quixote road shadbush snivel sting threaten uracil we've yaw\\nQ: Is there a mistake in this sequence? Write \\\"No\\\" if there are no mistakes, or the number N if there is a mistake in Thought N.\\n\"}","display_format":"text","language":"","answer_status":"published","assets":[],"source_url":"https://github.com/google-deepmind/bbeh","history":"initial import","indexing_mode":"index","subproblems":[],"grids":[]}