{"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":"e7f93731-e415-59d1-91bd-1acc5cd8df20","task_key":"bbeh~5fword~5fsorting--full--e7f93731-e415-59d1-91bd-1acc5cd8df20","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: box intestate fled fibrosis pavilion carib borneo angular\\nThought 1: I should start by looking at the first letter of the words in the list. The first letter: \\\"box\\\": \\\"b\\\" (2). \\\"intestate\\\": \\\"i\\\" (9). \\\"fled\\\": \\\"f\\\" (6). \\\"fibrosis\\\": \\\"f\\\" (6). \\\"pavilion\\\": \\\"p\\\" (16). \\\"carib\\\": \\\"c\\\" (3). \\\"borneo\\\": \\\"b\\\" (2). \\\"angular\\\": \\\"a\\\" (1).\\nThought 2: We now have: (1) \\\"angular\\\" < (2) [\\\"borneo\\\" ? \\\"box\\\"] < (3) \\\"carib\\\" < (6) [\\\"fled\\\" ? \\\"fibrosis\\\"] < (9) \\\"intestate\\\" < (16) \\\"pavilion\\\".\\nThought 3: Now let's sort this subpart [\\\"borneo\\\" ? \\\"box\\\"] by looking at their second letters. The second letter: \\\"borneo\\\": \\\"o\\\" (15). \\\"box\\\": \\\"o\\\" (15).\\nThought 4: We now have: (15) [\\\"borneo\\\" ? \\\"box\\\"] for the subpart. Hence, we have \\\"angular\\\" < [\\\"borneo\\\" ? \\\"box\\\"] < \\\"carib\\\" < [\\\"fled\\\" ? \\\"fibrosis\\\"] < \\\"intestate\\\" < \\\"pavilion\\\".\\nThought 5: Now let's sort this subpart [\\\"fled\\\" ? \\\"fibrosis\\\"] by looking at their second letters. The second letter: \\\"fled\\\": \\\"l\\\" (12). \\\"fibrosis\\\": \\\"i\\\" (9).\\nThought 6: We now have: (9) \\\"fibrosis\\\" < (12) \\\"fled\\\" for the subpart. Hence, we have \\\"angular\\\" < [\\\"borneo\\\" ? \\\"box\\\"] < \\\"carib\\\" < \\\"fibrosis\\\" < \\\"fled\\\" < \\\"intestate\\\" < \\\"pavilion\\\".\\nThought 7: Now let's sort this subpart [\\\"borneo\\\" ? \\\"box\\\"] by looking at their third letters. The third letter: \\\"borneo\\\": \\\"r\\\" (18). \\\"box\\\": \\\"x\\\" (24).\\nThought 8: We now have: (18) \\\"borneo\\\" < (24) \\\"box\\\" for the subpart. Hence, we have angular < borneo < carib < fibrosis < fled < intestate < pavilion < box.\\nThought 9: I have now sorted all the words. The answer is angular borneo carib fibrosis fled intestate pavilion box\\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":[]}