{"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":"fb7149b1-8266-5a45-8276-0b3945358925","task_key":"bbeh~5fword~5fsorting--full--fb7149b1-8266-5a45-8276-0b3945358925","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: percent maser roadside we're caching distort phillip emboss epistemology gherkin somewhat spicy injustice winston savoyard delicious defend indicate\\nThought 1: I should start by looking at the first letter of the words in the list. The first letter: \\\"percent\\\": \\\"p\\\" (16). \\\"maser\\\": \\\"m\\\" (13). \\\"roadside\\\": \\\"r\\\" (18). \\\"we're\\\": \\\"w\\\" (23). \\\"caching\\\": \\\"c\\\" (3). \\\"distort\\\": \\\"d\\\" (4). \\\"phillip\\\": \\\"p\\\" (16). \\\"emboss\\\": \\\"e\\\" (5). \\\"epistemology\\\": \\\"e\\\" (5). \\\"gherkin\\\": \\\"g\\\" (7). \\\"somewhat\\\": \\\"s\\\" (19). \\\"spicy\\\": \\\"s\\\" (19). \\\"injustice\\\": \\\"i\\\" (9). \\\"winston\\\": \\\"w\\\" (23). \\\"savoyard\\\": \\\"s\\\" (19). \\\"delicious\\\": \\\"d\\\" (4). \\\"defend\\\": \\\"d\\\" (4). \\\"indicate\\\": \\\"i\\\" (9).\\nThought 2: We now have: (3) \\\"caching\\\" < (4) [\\\"delicious\\\" ? \\\"defend\\\" ? \\\"distort\\\"] < (5) [\\\"emboss\\\" ? \\\"epistemology\\\"] < (7) \\\"gherkin\\\" < (9) [\\\"indicate\\\" ? \\\"injustice\\\"] < (13) \\\"maser\\\" < (16) [\\\"percent\\\" ? \\\"phillip\\\"] < (18) \\\"roadside\\\" < (19) [\\\"somewhat\\\" ? \\\"spicy\\\" ? \\\"savoyard\\\"] < (23) [\\\"we're\\\" ? \\\"winston\\\"].\\nThought 3: Now let's sort this subpart [\\\"delicious\\\" ? \\\"defend\\\" ? \\\"distort\\\"] by looking at their second letters. The second letter: \\\"delicious\\\": \\\"e\\\" (5). \\\"defend\\\": \\\"e\\\" (5). \\\"distort\\\": \\\"i\\\" (9).\\nThought 4: We now have: (5) [\\\"delicious\\\" ? \\\"defend\\\"] < (9) \\\"distort\\\" for the subpart.\\nThought 5: Now let's sort this subpart [\\\"delicious\\\" ? \\\"defend\\\"] by looking at their third letters. The third letter: \\\"delicious\\\": \\\"l\\\" (12). \\\"defend\\\": \\\"f\\\" (6).\\nThought 6: We now have: (6) \\\"defend\\\" < (12) \\\"delicious\\\" for the subpart. Hence, we have \\\"caching\\\" < \\\"defend\\\" < \\\"delicious\\\" < \\\"distort\\\" < \\\"emboss\\\" < \\\"epistemology\\\" < \\\"gherkin\\\" < \\\"indicate\\\" < \\\"injustice\\\" < \\\"maser\\\" < \\\"percent\\\" < \\\"phillip\\\" < \\\"roadside\\\" < \\\"somewhat\\\" < \\\"spicy\\\" < \\\"savoyard\\\" < \\\"we're\\\" < \\\"winston\\\".\\nThought 7: I have now sorted all the words. The answer is caching defend delicious distort emboss epistemology gherkin indicate injustice maser percent phillip roadside somewhat spicy savoyard we're winston\\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":[]}