{"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":"b943eeac-636c-5ff9-807e-dd5dd11a46a6","task_key":"bbeh~5fword~5fsorting--full--b943eeac-636c-5ff9-807e-dd5dd11a46a6","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: shrewish crux surtout pretoria rowboat drunken junta blackmail mbabane autocollimate embargoes lexicographer pork dobbs morpheme celery symbiotic scrutable protean nitric\\nThought 1: I should start by looking at the first letter of the words in the list. The first letter: \\\"shrewish\\\": \\\"s\\\" (19). \\\"crux\\\": \\\"c\\\" (3). \\\"surtout\\\": \\\"s\\\" (19). \\\"pretoria\\\": \\\"p\\\" (16). \\\"rowboat\\\": \\\"r\\\" (18). \\\"drunken\\\": \\\"d\\\" (4). \\\"junta\\\": \\\"j\\\" (10). \\\"blackmail\\\": \\\"b\\\" (2). \\\"mbabane\\\": \\\"m\\\" (13). \\\"autocollimate\\\": \\\"a\\\" (1). \\\"embargoes\\\": \\\"e\\\" (5). \\\"lexicographer\\\": \\\"l\\\" (12). \\\"pork\\\": \\\"p\\\" (16). \\\"dobbs\\\": \\\"d\\\" (4). \\\"morpheme\\\": \\\"m\\\" (13). \\\"celery\\\": \\\"c\\\" (3). \\\"symbiotic\\\": \\\"s\\\" (19). \\\"scrutable\\\": \\\"s\\\" (19). \\\"protean\\\": \\\"p\\\" (16). \\\"nitric\\\": \\\"n\\\" (14).\\nThought 2: We now have: (1) \\\"autocollimate\\\" < (2) \\\"blackmail\\\" < (3) [\\\"celery\\\" ? \\\"crux\\\" ? \\\"surtout\\\"] < (4) [\\\"drunken\\\" ? \\\"dobbs\\\"] < (5) \\\"embargoes\\\" < (10) \\\"junta\\\" < (12) \\\"lexicographer\\\" < (13) [\\\"mbabane\\\" ? \\\"morpheme\\\"] < (14) \\\"nitric\\\" < (16) [\\\"pork\\\" ? \\\"pretoria\\\" ? \\\"protean\\\"] < (18) \\\"rowboat\\\" < (19) [\\\"scrutable\\\" ? \\\"shrewish\\\" ? \\\"symbiotic\\\"].\\nThought 3: Now let's sort this subpart [\\\"celery\\\" ? \\\"crux\\\" ? \\\"surtout\\\"] by looking at their second letters. The second letter: \\\"celery\\\": \\\"e\\\" (5). \\\"crux\\\": \\\"r\\\" (18). \\\"surtout\\\": \\\"u\\\" (21).\\nThought 4: We now have: (5) \\\"celery\\\" < (18) \\\"crux\\\" < (21) \\\"surtout\\\" for the subpart. Hence, we have \\\"autocollimate\\\" < \\\"blackmail\\\" < \\\"celery\\\" < \\\"crux\\\" < \\\"drunken\\\" < \\\"dobbs\\\" < \\\"embargoes\\\" < \\\"junta\\\" < \\\"lexicographer\\\" < \\\"mbabane\\\" < \\\"morpheme\\\" < \\\"nitric\\\" < \\\"pork\\\" < \\\"pretoria\\\" < \\\"protean\\\" < \\\"rowboat\\\" < \\\"scrutable\\\" < \\\"shrewish\\\" < \\\"symbiotic\\\".\\nThought 5: I have now sorted all the words. The answer is autocollimate blackmail celery crux drunken dobbs embargoes junta lexicographer mbabane morpheme nitric pork pretoria protean rowboat scrutable shrewish symbiotic\\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":[]}