{"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":"eefde2f4-fb07-577c-8517-9d67ed89bdd0","task_key":"bbeh~5fword~5fsorting--full--eefde2f4-fb07-577c-8517-9d67ed89bdd0","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: marathon deferring lucre stimuli rural depositor dreamy vault hyannis lysine\\nThought 1: I should start by looking at the first letter of the words in the list. The first letter: \\\"marathon\\\": \\\"m\\\" (13). \\\"deferring\\\": \\\"d\\\" (4). \\\"lucre\\\": \\\"l\\\" (12). \\\"stimuli\\\": \\\"s\\\" (19). \\\"rural\\\": \\\"r\\\" (18). \\\"depositor\\\": \\\"d\\\" (4). \\\"dreamy\\\": \\\"d\\\" (4). \\\"vault\\\": \\\"v\\\" (22). \\\"hyannis\\\": \\\"h\\\" (8). \\\"lysine\\\": \\\"l\\\" (12).\\nThought 2: We now have: (4) [\\\"deferring\\\" ? \\\"depositor\\\" ? \\\"dreamy\\\"] < (8) \\\"hyannis\\\" < (12) [\\\"lucre\\\" ? \\\"lysine\\\"] < (13) \\\"marathon\\\" < (18) \\\"rural\\\" < (19) \\\"stimuli\\\" < (22) \\\"vault\\\".\\nThought 3: Now let's sort this subpart [\\\"deferring\\\" ? \\\"depositor\\\" ? \\\"dreamy\\\"] by looking at their second letters. The second letter: \\\"deferring\\\": \\\"e\\\" (5). \\\"depositor\\\": \\\"e\\\" (5). \\\"dreamy\\\": \\\"r\\\" (18).\\nThought 4: We now have: (5) [\\\"deferring\\\" ? \\\"depositor\\\"] < (18) \\\"dreamy\\\" for the subpart. Hence, we have [\\\"deferring\\\" ? \\\"depositor\\\"] < \\\"dreamy\\\" < \\\"hyannis\\\" < [\\\"lucre\\\" ? \\\"lysine\\\"] < \\\"marathon\\\" < \\\"rural\\\" < \\\"stimuli\\\" < \\\"vault\\\".\\nThought 5: Now let's sort this subpart [\\\"deferring\\\" ? \\\"depositor\\\"] by looking at their third letters. The third letter: \\\"deferring\\\": \\\"f\\\" (6). \\\"depositor\\\": \\\"o\\\" (15).\\nThought 6: We now have: (6) \\\"deferring\\\" < (15) \\\"depositor\\\" for the subpart. Hence, we have \\\"deferring\\\" < \\\"depositor\\\" < \\\"dreamy\\\" < \\\"hyannis\\\" < [\\\"lucre\\\" ? \\\"lysine\\\"] < \\\"marathon\\\" < \\\"rural\\\" < \\\"stimuli\\\" < \\\"vault\\\".\\nThought 7: Now let's sort this subpart [\\\"lucre\\\" ? \\\"lysine\\\"] by looking at their second letters. The second letter: \\\"lucre\\\": \\\"u\\\" (21). \\\"lysine\\\": \\\"y\\\" (25).\\nThought 8: We now have: (21) \\\"lucre\\\" < (25) \\\"lysine\\\" for the subpart. Hence, we have \\\"deferring\\\" < \\\"depositor\\\" < \\\"dreamy\\\" < \\\"hyannis\\\" < \\\"lucre\\\" < \\\"lysine\\\" < \\\"marathon\\\" < \\\"rural\\\" < \\\"stimuli\\\" < \\\"vault\\\".\\nThought 9: I have now sorted all the words. The answer is deferring depositor dreamy hyannis lysine lucre marathon rural stimuli vault\\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":[]}