{"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":"bbac78ae-8200-59a0-abeb-487a9258ae5d","task_key":"bbeh~5fword~5fsorting--full--bbac78ae-8200-59a0-abeb-487a9258ae5d","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: joey simultaneity wilhelm all foyer sis gestation screwy monarchic mardi\\nThought 1: I should start by looking at the first letter of the words in the list. The first letter: \\\"joey\\\": \\\"j\\\" (10). \\\"simultaneity\\\": \\\"s\\\" (19). \\\"wilhelm\\\": \\\"w\\\" (23). \\\"all\\\": \\\"a\\\" (1). \\\"foyer\\\": \\\"f\\\" (6). \\\"sis\\\": \\\"s\\\" (19). \\\"gestation\\\": \\\"g\\\" (7). \\\"screwy\\\": \\\"s\\\" (19). \\\"monarchic\\\": \\\"m\\\" (13). \\\"mardi\\\": \\\"m\\\" (13).\\nThought 2: We now have: (1) \\\"all\\\" < (6) \\\"foyer\\\" < (7) \\\"gestation\\\" < (10) \\\"joey\\\" < (13) [\\\"monarchic\\\" ? \\\"mardi\\\"] < (19) [\\\"sis\\\" ? \\\"screwy\\\" ? \\\"simultaneity\\\"] < (23) \\\"wilhelm\\\".\\nThought 3: Now let's sort this subpart [\\\"monarchic\\\" ? \\\"mardi\\\"] by looking at their second letters. The second letter: \\\"monarchic\\\": \\\"o\\\" (15). \\\"mardi\\\": \\\"a\\\" (1).\\nThought 4: We now have: (1) \\\"mardi\\\" < (15) \\\"monarchic\\\" for the subpart. Hence, we have \\\"all\\\" < \\\"foyer\\\" < \\\"gestation\\\" < \\\"joey\\\" < \\\"mardi\\\" < \\\"monarchic\\\" < [\\\"sis\\\" ? \\\"screwy\\\" ? \\\"simultaneity\\\"] < \\\"wilhelm\\\".\\nThought 5: Now let's sort this subpart [\\\"sis\\\" ? \\\"screwy\\\" ? \\\"simultaneity\\\"] by looking at their second letters. The second letter: \\\"sis\\\": \\\"i\\\" (9). \\\"screwy\\\": \\\"c\\\" (3). \\\"simultaneity\\\": \\\"i\\\" (9).\\nThought 6: We now have: (3) \\\"screwy\\\" < (9) [\\\"sis\\\" ? \\\"simultaneity\\\"] for the subpart.\\nThought 7: Now let's sort this subpart [\\\"sis\\\" ? \\\"simultaneity\\\"] by looking at their third letters. The third letter: \\\"sis\\\": \\\"s\\\" (19). \\\"simultaneity\\\": \\\"m\\\" (13).\\nThought 8: We now have: (13) \\\"simultaneity\\\" < (19) \\\"sis\\\" for the subpart. Hence, we have \\\"all\\\" < \\\"foyer\\\" < \\\"gestation\\\" < \\\"joey\\\" < \\\"mardi\\\" < \\\"monarchic\\\" < \\\"screwy\\\" < \\\"sis\\\" < \\\"simultaneity\\\" < \\\"wilhelm\\\".\\nThought 9: I have now sorted all the words. The answer is all foyer gestation joey mardi monarchic screwy sis simultaneity wilhelm\\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":[]}