{"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":"5fe0923c-0409-515c-9465-91ca6be2263f","task_key":"bbeh~5fword~5fsorting--full--5fe0923c-0409-515c-9465-91ca6be2263f","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: prosopopoeia martin distinguish kay luger chairperson siege manipulate cyclic chen toby odometer stoat xerxes\\nThought 1: I should start by looking at the first letter of the words in the list. The first letter: \\\"prosopopoeia\\\": \\\"p\\\" (16). \\\"martin\\\": \\\"m\\\" (13). \\\"distinguish\\\": \\\"d\\\" (4). \\\"kay\\\": \\\"k\\\" (11). \\\"luger\\\": \\\"l\\\" (12). \\\"chairperson\\\": \\\"c\\\" (3). \\\"siege\\\": \\\"s\\\" (19). \\\"manipulate\\\": \\\"m\\\" (13). \\\"cyclic\\\": \\\"c\\\" (3). \\\"chen\\\": \\\"c\\\" (3). \\\"toby\\\": \\\"t\\\" (20). \\\"odometer\\\": \\\"o\\\" (15). \\\"stoat\\\": \\\"s\\\" (19). \\\"xerxes\\\": \\\"x\\\" (24).\\nThought 2: We now have: (3) [\\\"chairperson\\\" ? \\\"cyclic\\\" ? \\\"chen\\\"] < (4) \\\"distinguish\\\" < (11) \\\"kay\\\" < (12) \\\"luger\\\" < (13) [\\\"manipulate\\\" ? \\\"martin\\\"] < (15) \\\"odometer\\\" < (16) \\\"prosopopoeia\\\" < (19) [\\\"siege\\\" ? \\\"stoat\\\"] < (20) \\\"toby\\\" < (24) \\\"xerxes\\\".\\nThought 3: Now let's sort this subpart [\\\"chairperson\\\" ? \\\"cyclic\\\" ? \\\"chen\\\"] by looking at their second letters. The second letter: \\\"chairperson\\\": \\\"h\\\" (8). \\\"cyclic\\\": \\\"y\\\" (25). \\\"chen\\\": \\\"e\\\" (5).\\nThought 4: We now have: (5) \\\"chen\\\" < (8) \\\"chairperson\\\" < (25) \\\"cyclic\\\" for the subpart. Hence, we have \\\"chen\\\" < \\\"chairperson\\\" < \\\"cyclic\\\" < \\\"distinguish\\\" < \\\"kay\\\" < \\\"luger\\\" < [\\\"manipulate\\\" ? \\\"martin\\\"] < \\\"odometer\\\" < \\\"prosopopoeia\\\" < [\\\"siege\\\" ? \\\"stoat\\\"] < \\\"toby\\\" < \\\"xerxes\\\".\\nThought 5: Now let's sort this subpart [\\\"manipulate\\\" ? \\\"martin\\\"] by looking at their second letters. The second letter: \\\"manipulate\\\": \\\"a\\\" (1). \\\"martin\\\": \\\"a\\\" (1).\\nThought 6: We now have: (1) [\\\"manipulate\\\" ? \\\"martin\\\"] for the subpart. Hence, we have \\\"chen\\\" < \\\"chairperson\\\" < \\\"cyclic\\\" < \\\"distinguish\\\" < \\\"kay\\\" < \\\"luger\\\" < [\\\"manipulate\\\" ? \\\"martin\\\"] < \\\"odometer\\\" < \\\"prosopopoeia\\\" < [\\\"siege\\\" ? \\\"stoat\\\"] < \\\"toby\\\" < \\\"xerxes\\\".\\nThought 7: Now let's sort this subpart [\\\"siege\\\" ? \\\"stoat\\\"] by looking at their second letters. The second letter: \\\"siege\\\": \\\"i\\\" (9). \\\"stoat\\\": \\\"t\\\" (20).\\nThought 8: We now have: (9) \\\"siege\\\" < (20) \\\"stoat\\\" for the subpart. Hence, we have \\\"chen\\\" < \\\"chairperson\\\" < \\\"cyclic\\\" < \\\"distinguish\\\" < \\\"kay\\\" < \\\"luger\\\" < [\\\"manipulate\\\" ? \\\"martin\\\"] < \\\"odometer\\\" < \\\"prosopopoeia\\\" < \\\"siege\\\" < \\\"stoat\\\" < \\\"toby\\\" < \\\"xerxes\\\".\\nThought 9: I have now sorted all the words. The answer is chen chairperson cyclic distinguish kay luger manipulate martin odometer prosopopoeia siege stoat toby xerxes\\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":[]}