{"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":"deaaea0e-4d74-5076-bcd0-f403c1349693","task_key":"bbeh~5fword~5fsorting--full--deaaea0e-4d74-5076-bcd0-f403c1349693","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: pollution cognitive tattoo diverge industrial distal blinn nebuchadnezzar karen gallonage scotia hesitate\\nThought 1: I should start by looking at the first letter of the words in the list. The first letter: \\\"pollution\\\": \\\"p\\\" (16). \\\"cognitive\\\": \\\"c\\\" (3). \\\"tattoo\\\": \\\"t\\\" (20). \\\"diverge\\\": \\\"d\\\" (4). \\\"industrial\\\": \\\"i\\\" (9). \\\"distal\\\": \\\"d\\\" (4). \\\"blinn\\\": \\\"b\\\" (2). \\\"nebuchadnezzar\\\": \\\"n\\\" (14). \\\"karen\\\": \\\"k\\\" (11). \\\"gallonage\\\": \\\"g\\\" (7). \\\"scotia\\\": \\\"s\\\" (19). \\\"hesitate\\\": \\\"h\\\" (8).\\nThought 2: We now have: (2) \\\"blinn\\\" < (3) \\\"cognitive\\\" < (4) [\\\"distal\\\" ? \\\"diverge\\\"] < (7) \\\"gallonage\\\" < (8) \\\"hesitate\\\" < (9) \\\"industrial\\\" < (11) \\\"karen\\\" < (14) \\\"nebuchadnezzar\\\" < (16) \\\"pollution\\\" < (19) \\\"scotia\\\" < (20) \\\"tattoo\\\".\\nThought 3: Now let's sort this subpart [\\\"distal\\\" ? \\\"diverge\\\"] by looking at their second letters. The second letter: \\\"distal\\\": \\\"i\\\" (9). \\\"diverge\\\": \\\"i\\\" (9).\\nThought 4: We now have: (9) [\\\"distal\\\" ? \\\"diverge\\\"] for the subpart. Hence, we have \\\"blinn\\\" < \\\"cognitive\\\" < [\\\"distal\\\" ? \\\"diverge\\\"] < \\\"gallonage\\\" < \\\"hesitate\\\" < \\\"industrial\\\" < \\\"karen\\\" < \\\"nebuchadnezzar\\\" < \\\"pollution\\\" < \\\"scotia\\\" < \\\"tattoo\\\".\\nThought 5: Now let's sort this subpart [\\\"distal\\\" ? \\\"diverge\\\"] by looking at their third letters. The third letter: \\\"distal\\\": \\\"s\\\" (19). \\\"diverge\\\": \\\"e\\\" (5).\\nThought 6: We now have: (5) \\\"diverge\\\" < (19) \\\"distal\\\" for the subpart. Hence, we have \\\"blinn\\\" < \\\"cognitive\\\" < \\\"diverge\\\" < \\\"distal\\\" < \\\"gallonage\\\" < \\\"hesitate\\\" < \\\"industrial\\\" < \\\"karen\\\" < \\\"nebuchadnezzar\\\" < \\\"pollution\\\" < \\\"scotia\\\" < \\\"tattoo\\\".\\nThought 7: I have now sorted all the words. The answer is blinn cognitive diverge distal gallonage hesitate industrial karen nebuchadnezzar pollution scotia tattoo\\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":[]}