{"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":"5e142b1b-39b5-54c2-9093-fa76095de9d2","task_key":"bbeh~5fword~5fsorting--full--5e142b1b-39b5-54c2-9093-fa76095de9d2","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: provence dolan bootstrapping jimmy forget conscious snore captivate tooth adipic flee lilian greenbriar chili stanley hosiery laze our monkish\\nThought 1: I should start by looking at the first letter of the words in the list. The first letter: \\\"provence\\\": \\\"p\\\" (16). \\\"dolan\\\": \\\"d\\\" (4). \\\"bootstrapping\\\": \\\"b\\\" (2). \\\"jimmy\\\": \\\"j\\\" (10). \\\"forget\\\": \\\"f\\\" (6). \\\"conscious\\\": \\\"c\\\" (3). \\\"snore\\\": \\\"s\\\" (19). \\\"captivate\\\": \\\"c\\\" (3). \\\"tooth\\\": \\\"t\\\" (20). \\\"adipic\\\": \\\"a\\\" (1). \\\"flee\\\": \\\"f\\\" (6). \\\"lilian\\\": \\\"l\\\" (12). \\\"greenbriar\\\": \\\"g\\\" (7). \\\"chili\\\": \\\"c\\\" (3). \\\"stanley\\\": \\\"s\\\" (19). \\\"hosiery\\\": \\\"h\\\" (8). \\\"laze\\\": \\\"l\\\" (12). \\\"our\\\": \\\"o\\\" (15). \\\"monkish\\\": \\\"m\\\" (13).\\nThought 2: We now have: (1) \\\"adipic\\\" < (2) \\\"bootstrapping\\\" < (3) [\\\"chili\\\" ? \\\"conscious\\\" ? \\\"captivate\\\"] < (4) \\\"dolan\\\" < (6) [\\\"flee\\\" ? \\\"forget\\\"] < (7) \\\"greenbriar\\\" < (8) \\\"hosiery\\\" < (10) \\\"jimmy\\\" < (12) [\\\"laze\\\" ? \\\"lilian\\\"] < (13) \\\"monkish\\\" < (15) \\\"our\\\" < (16) \\\"provence\\\" < (19) [\\\"snore\\\" ? \\\"stanley\\\"] < (20) \\\"tooth\\\".\\nThought 3: Now let's sort this subpart [\\\"chili\\\" ? \\\"conscious\\\" ? \\\"captivate\\\"] by looking at their second letters. The second letter: \\\"chili\\\": \\\"h\\\" (8). \\\"conscious\\\": \\\"o\\\" (15). \\\"captivate\\\": \\\"a\\\" (1).\\nThought 4: We now have: (1) \\\"captivate\\\" < (8) \\\"chili\\\" < (15) \\\"conscious\\\" for the subpart. Hence, we have \\\"adipic\\\" < \\\"bootstrapping\\\" < \\\"captivate\\\" < \\\"chili\\\" < \\\"conscious\\\" < \\\"dolan\\\" < \\\"flee\\\" < \\\"forget\\\" < \\\"greenbriar\\\" < \\\"hosiery\\\" < \\\"jimmy\\\" < \\\"laze\\\" < \\\"lilian\\\" < \\\"monkish\\\" < \\\"our\\\" < \\\"provence\\\" < \\\"snore\\\" < \\\"stanley\\\" < \\\"tooth\\\".\\nThought 5: Now let's sort this subpart [\\\"flee\\\" ? \\\"forget\\\"] by looking at their second letters. The second letter: \\\"flee\\\": \\\"l\\\" (12). \\\"forget\\\": \\\"o\\\" (15).\\nThought 6: We now have: (12) \\\"flee\\\" < (15) \\\"forget\\\" for the subpart. Hence, we have \\\"adipic\\\" < \\\"bootstrapping\\\" < \\\"captivate\\\" < \\\"chili\\\" < \\\"conscious\\\" < \\\"dolan\\\" < \\\"flee\\\" < \\\"forget\\\" < \\\"greenbriar\\\" < \\\"hosiery\\\" < \\\"jimmy\\\" < \\\"laze\\\" < \\\"lilian\\\" < \\\"monkish\\\" < \\\"our\\\" < \\\"provence\\\" < \\\"snore\\\" < \\\"stanley\\\" < \\\"tooth\\\".\\nThought 7: Now let's sort this subpart [\\\"laze\\\" ? \\\"lilian\\\"] by looking at their second letters. The second letter: \\\"laze\\\": \\\"a\\\" (1). \\\"lilian\\\": \\\"i\\\" (9).\\nThought 8: We now have: (1) \\\"laze\\\" < (9) \\\"lilian\\\" for the subpart. Hence, we have \\\"adipic\\\" < \\\"bootstrapping\\\" < \\\"captivate\\\" < \\\"chili\\\" < \\\"conscious\\\" < \\\"dolan\\\" < \\\"flee\\\" < \\\"forget\\\" < \\\"greenbriar\\\" < \\\"hosiery\\\" < \\\"jimmy\\\" < \\\"laze\\\" < \\\"lilian\\\" < \\\"monkish\\\" < \\\"our\\\" < \\\"provence\\\" < \\\"snore\\\" < \\\"stanley\\\" < \\\"tooth\\\".\\nThought 9: Now let's sort this subpart [\\\"snore\\\" ? \\\"stanley\\\"] by looking at their second letters. The second letter: \\\"snore\\\": \\\"n\\\" (14). \\\"stanley\\\": \\\"t\\\" (20).\\nThought 10: We now have: (14) \\\"snore\\\" < (20) \\\"stanley\\\" for the subpart. Hence, we have \\\"adipic\\\" < \\\"bootstrapping\\\" < \\\"captivate\\\" < \\\"chili\\\" < \\\"conscious\\\" < \\\"dolan\\\" < \\\"flee\\\" < \\\"forget\\\" < \\\"greenbriar\\\" < \\\"hosiery\\\" < \\\"jimmy\\\" < \\\"laze\\\" < \\\"lilian\\\" < \\\"monkish\\\" < \\\"our\\\" < \\\"provence\\\" < \\\"snore\\\" < \\\"stanley\\\" < \\\"tooth\\\".\\nThought 11: I have now sorted all the words. The answer is adipic, bootstrapping, captivate, chili, conscious, dolan, flee, forget, greenbriar, hosiery, jimmy, laze, lilian, monkish, our, provence, snore, stanley, tooth\\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":[]}