{"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":"bb98ce7a-3d7c-5bb2-8dc8-867c006693ff","task_key":"bbeh~5fword~5fsorting--full--bb98ce7a-3d7c-5bb2-8dc8-867c006693ff","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: fair campground what ripley cupric ancestor\\nThought 1: I should start by looking at the first letter of the words in the list. The first letter: \\\"fair\\\": \\\"f\\\" (6). \\\"campground\\\": \\\"c\\\" (3). \\\"what\\\": \\\"w\\\" (23). \\\"ripley\\\": \\\"r\\\" (18). \\\"cupric\\\": \\\"c\\\" (3). \\\"ancestor\\\": \\\"a\\\" (1).\\nThought 2: We now have: (1) \\\"ancestor\\\" < (3) [\\\"campground\\\" ? \\\"cupric\\\"] < (6) \\\"fair\\\" < (18) \\\"ripley\\\" < (23) \\\"what\\\".\\nThought 3: Now let's sort this subpart [\\\"campground\\\" ? \\\"cupric\\\"] by looking at their second letters. The second letter: \\\"campground\\\": \\\"a\\\" (1). \\\"cupric\\\": \\\"u\\\" (21).\\nThought 4: We now have: (1) \\\"campground\\\" < (21) \\\"cupric\\\" for the subpart. Hence, we have \\\"ancestor\\\" < \\\"campground\\\" < \\\"cupric\\\" < \\\"fair\\\" < \\\"ripley\\\" < \\\"what\\\".\\nThought 5: I have now sorted all the words. The answer is ancestor campground cupric fair ripley what\\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":[]}