{"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":"dd345736-ac22-5e9c-842f-3d314112a1e0","task_key":"bbeh~5fword~5fsorting--full--dd345736-ac22-5e9c-842f-3d314112a1e0","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: patrolman arabesque novel spearmint arkansan bend brassiere diagnosable ytterbium sheep bedroom yen planeload deterrent fossiliferous alveolar trident fluke curvilinear\\nThought 1: I should start by looking at the first letter of the words in the list. The first letter: \\\"patrolman\\\": \\\"p\\\" (16). \\\"arabesque\\\": \\\"a\\\" (1). \\\"novel\\\": \\\"n\\\" (14). \\\"spearmint\\\": \\\"s\\\" (19). \\\"arkansan\\\": \\\"a\\\" (1). \\\"bend\\\": \\\"b\\\" (2). \\\"brassiere\\\": \\\"b\\\" (2). \\\"diagnosable\\\": \\\"d\\\" (4). \\\"ytterbium\\\": \\\"y\\\" (25). \\\"sheep\\\": \\\"s\\\" (19). \\\"bedroom\\\": \\\"b\\\" (2). \\\"yen\\\": \\\"y\\\" (25). \\\"planeload\\\": \\\"p\\\" (16). \\\"deterrent\\\": \\\"d\\\" (4). \\\"fossiliferous\\\": \\\"f\\\" (6). \\\"alveolar\\\": \\\"a\\\" (1). \\\"trident\\\": \\\"t\\\" (20). \\\"fluke\\\": \\\"f\\\" (6). \\\"curvilinear\\\": \\\"c\\\" (3).\\nThought 2: We now have: (1) [\\\"alveolar\\\" ? \\\"arabesque\\\" ? \\\"arkansan\\\" ? \\\"bend\\\" ? \\\"brassiere\\\"] < (2) [\\\"bedroom\\\" ? \\\"bend\\\" ? \\\"brassiere\\\"] < (3) \\\"curvilinear\\\" < (4) [\\\"deterrent\\\" ? \\\"diagnosable\\\"] < (6) [\\\"fluke\\\" ? \\\"fossiliferous\\\"] < (14) \\\"novel\\\" < (16) [\\\"patrolman\\\" ? \\\"planeload\\\"] < (19) [\\\"sheep\\\" ? \\\"spearmint\\\"] < (20) \\\"trident\\\" < (25) [\\\"ytterbium\\\" ? \\\"yen\\\"].\\nThought 3: Now let's sort this subpart [\\\"alveolar\\\" ? \\\"arabesque\\\" ? \\\"arkansan\\\" ? \\\"bend\\\" ? \\\"brassiere\\\"] by looking at their second letters. The second letter: \\\"alveolar\\\": \\\"l\\\" (12). \\\"arabesque\\\": \\\"r\\\" (18). \\\"arkansan\\\": \\\"r\\\" (18). \\\"bend\\\": \\\"e\\\" (5). \\\"brassiere\\\": \\\"r\\\" (18).\\nThought 4: We now have: (1) \\\"alveolar\\\" < (2) \\\"bend\\\" < (5) \\\"brassiere\\\" < (12) \\\"arabesque\\\" < (18) \\\"arkansan\\\" for the subpart. Hence, we have \\\"alveolar\\\" < \\\"bend\\\" < \\\"brassiere\\\" < \\\"arabesque\\\" < \\\"arkansan\\\" < \\\"bedroom\\\" < \\\"curvilinear\\\" < \\\"deterrent\\\" < \\\"diagnosable\\\" < \\\"fluke\\\" < \\\"fossiliferous\\\" < \\\"novel\\\" < \\\"patrolman\\\" < \\\"planeload\\\" < \\\"sheep\\\" < \\\"spearmint\\\" < \\\"trident\\\" < \\\"ytterbium\\\" < \\\"yen\\\".\\nThought 5: I have now sorted all the words. The answer is alveolar arabesque arkansan bend brassiere bedroom curvilinear deterrent diagnosable fluke fossiliferous novel patrolman planeload sheep spearmint trident ytterbium yen\\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":[]}