{"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":"691b733c-fc4c-517d-9e17-ccc96f4b4474","task_key":"bbeh~5fword~5fsorting--full--691b733c-fc4c-517d-9e17-ccc96f4b4474","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: vertices necropsy dalton irreconciliable dawn hyacinth huntington\\nThought 1: I should start by looking at the first letter of the words in the list. The first letter: \\\"vertices\\\": \\\"v\\\" (22). \\\"necropsy\\\": \\\"n\\\" (14). \\\"dalton\\\": \\\"d\\\" (4). \\\"irreconcilable\\\": \\\"i\\\" (9). \\\"dawn\\\": \\\"d\\\" (4). \\\"hyacinth\\\": \\\"h\\\" (8). \\\"huntington\\\": \\\"h\\\" (8).\\nThought 2: We now have: (4) [\\\"dalton\\\" ? \\\"dawn\\\"] < (8) [\\\"hyacinth\\\" ? \\\"huntington\\\"] < (9) \\\"irreconcilable\\\" < (14) \\\"necropsy\\\" < (22) \\\"vertices\\\".\\nThought 3: Now let's sort this subpart [\\\"dalton\\\" ? \\\"dawn\\\"] by looking at their second letters. The second letter: \\\"dalton\\\": \\\"a\\\" (1). \\\"dawn\\\": \\\"a\\\" (1).\\nThought 4: We now have: (1) [\\\"dalton\\\" ? \\\"dawn\\\"] for the subpart. Hence, we have [\\\"dalton\\\" ? \\\"dawn\\\"] < (8) [\\\"hyacinth\\\" ? \\\"huntington\\\"] < (9) \\\"irreconcilable\\\" < (14) \\\"necropsy\\\" < (22) \\\"vertices\\\".\\nThought 5: Now let's sort this subpart [\\\"hyacinth\\\" ? \\\"huntington\\\"] by looking at their second letters. The second letter: \\\"hyacinth\\\": \\\"y\\\" (25). \\\"huntington\\\": \\\"u\\\" (21).\\nThought 6: We now have: (21) \\\"huntington\\\" < (25) \\\"hyacinth\\\" for the subpart. Hence, we have [\\\"dalton\\\" ? \\\"dawn\\\"] < \\\"huntington\\\" < \\\"hyacinth\\\" < \\\"irreconcilable\\\" < \\\"necropsy\\\" < \\\"vertices\\\".\\nThought 7: Now let's sort this subpart [\\\"dalton\\\" ? \\\"dawn\\\"] by looking at their third letters. The third letter: \\\"dalton\\\": \\\"l\\\" (12). \\\"dawn\\\": \\\"n\\\" (14).\\nThought 8: We now have: (12) \\\"dalton\\\" < (14) \\\"dawn\\\" for the subpart. Hence, we have \\\"dalton\\\" < \\\"dawn\\\" < \\\"huntington\\\" < \\\"hyacinth\\\" < \\\"irreconcilable\\\" < \\\"necropsy\\\" < \\\"vertices\\\".\\nThought 9: I have now sorted all the words. The answer is dalton dawn huntington hyacinth irreconcilable necropsy vertices\\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":[]}