{"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":"f16f8cc5-7ce5-570b-bfba-6b9a5a2aa0a2","task_key":"bbeh~5fword~5fsorting--full--f16f8cc5-7ce5-570b-bfba-6b9a5a2aa0a2","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: beater chum cz voiceband edmund wring baccalaureate muscovite basel landlord\\nThought 1: I should start by looking at the first letter of the words in the list. The first letter: \\\"beater\\\": \\\"b\\\" (2). \\\"chum\\\": \\\"c\\\" (3). \\\"cz\\\": \\\"c\\\" (3). \\\"voiceband\\\": \\\"v\\\" (22). \\\"edmund\\\": \\\"e\\\" (5). \\\"wring\\\": \\\"w\\\" (23). \\\"baccalaureate\\\": \\\"b\\\" (2). \\\"muscovite\\\": \\\"m\\\" (13). \\\"basel\\\": \\\"b\\\" (2). \\\"landlord\\\": \\\"l\\\" (12).\\nThought 2: We now have: (2) [\\\"beater\\\" ? \\\"basel\\\" ? \\\"baccalaureate\\\"] < (3) [\\\"chum\\\" ? \\\"cz\\\"] < (5) \\\"edmund\\\" < (12) \\\"landlord\\\" < (13) \\\"muscovite\\\" < (22) \\\"voiceband\\\" < (23) \\\"wring\\\".\\nThought 3: Now let's sort this subpart [\\\"beater\\\" ? \\\"basel\\\" ? \\\"baccalaureate\\\"] by looking at their second letters. The second letter: \\\"beater\\\": \\\"e\\\" (5). \\\"basel\\\": \\\"a\\\" (1). \\\"baccalaureate\\\": \\\"a\\\" (1).\\nThought 4: We now have: (1) \\\"basel\\\" ? \\\"baccalaureate\\\" < (5) \\\"beater\\\" for the subpart. Hence, we have [\\\"basel\\\" ? \\\"baccalaureate\\\"] < \\\"beater\\\" < (3) [\\\"chum\\\" ? \\\"cz\\\"] < (5) \\\"edmund\\\" < (12) \\\"landlord\\\" < (13) \\\"muscovite\\\" < (22) \\\"voiceband\\\" < (23) \\\"wring\\\".\\nThought 5: Now let's sort this subpart [\\\"basel\\\" ? \\\"baccalaureate\\\"] by looking at their third letters. The third letter: \\\"basel\\\": \\\"s\\\" (19). \\\"baccalaureate\\\": \\\"c\\\" (3).\\nThought 6: We now have: (3) \\\"baccalaureate\\\" < (19) \\\"basel\\\" for the subpart. Hence, we have \\\"baccalaureate\\\" < \\\"basel\\\" < \\\"beater\\\" < (3) [\\\"chum\\\" ? \\\"cz\\\"] < (5) \\\"edmund\\\" < (12) \\\"landlord\\\" < (13) \\\"muscovite\\\" < (22) \\\"voiceband\\\" < (23) \\\"wring\\\".\\nThought 7: Now let's sort this subpart [\\\"chum\\\" ? \\\"cz\\\"] by looking at their second letters. The second letter: \\\"chum\\\": \\\"h\\\" (8). \\\"cz\\\": \\\"z\\\" (26).\\nThought 8: We now have: (8) \\\"chum\\\" < (26) \\\"cz\\\" for the subpart. Hence, we have \\\"baccalaureate\\\" < \\\"basel\\\" < \\\"beater\\\" < \\\"chum\\\" < \\\"cz\\\" < (5) \\\"edmund\\\" < (12) \\\"landlord\\\" < (13) \\\"muscovite\\\" < (22) \\\"voiceband\\\" < (23) \\\"wring\\\".\\nThought 9: I have now sorted all the words. The answer is baccalaureate basel beater chum cz edmund landlord muscovite voiceband wring\\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":[]}