{"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":"1fe5172d-25b2-5a1b-a5b2-62810ab10ce4","task_key":"bbeh~5fword~5fsorting--full--1fe5172d-25b2-5a1b-a5b2-62810ab10ce4","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: agronomist verisimilitude wilfred hershel hem boggle nuclide walkie refrain oklahoma grapheme eugenia apostrophe lieutenant fletcher cortege\\nThought 1: I should start by looking at the first letter of the words in the list. The first letter: \\\"agronomist\\\": \\\"a\\\" (1). \\\"verisimilitude\\\": \\\"v\\\" (22). \\\"wilfred\\\": \\\"w\\\" (23). \\\"hershel\\\": \\\"h\\\" (8). \\\"hem\\\": \\\"h\\\" (8). \\\"boggle\\\": \\\"b\\\" (2). \\\"nuclide\\\": \\\"n\\\" (14). \\\"walkie\\\": \\\"w\\\" (23). \\\"refrain\\\": \\\"r\\\" (18). \\\"oklahoma\\\": \\\"o\\\" (15). \\\"grapheme\\\": \\\"g\\\" (7). \\\"eugenia\\\": \\\"e\\\" (5). \\\"apostrophe\\\": \\\"a\\\" (1). \\\"lieutenant\\\": \\\"l\\\" (12). \\\"fletcher\\\": \\\"f\\\" (6). \\\"cortege\\\": \\\"c\\\" (3).\\nThought 2: We now have: (1) [\\\"agronomist\\\" ? \\\"apostrophe\\\"] < (2) \\\"boggle\\\" < (3) \\\"cortege\\\" < (5) \\\"eugenia\\\" < (6) \\\"fletcher\\\" < (7) \\\"grapheme\\\" < (8) [\\\"hershel\\\" ? \\\"hem\\\"] < (12) \\\"lieutenant\\\" < (14) \\\"nuclide\\\" < (15) \\\"oklahoma\\\" < (18) \\\"refrain\\\" < (22) \\\"verisimilitude\\\" < (23) [\\\"walkie\\\" ? \\\"wilfred\\\"].\\nThought 3: Now let's sort this subpart [\\\"agronomist\\\" ? \\\"apostrophe\\\"] by looking at their second letters. The second letter: \\\"agronomist\\\": \\\"g\\\" (7). \\\"apostrophe\\\": \\\"p\\\" (16).\\nThought 4: We now have: (7) \\\"agronomist\\\" < (16) \\\"apostrophe\\\" for the subpart. Hence, we have \\\"agronomist\\\" < \\\"apostrophe\\\" < \\\"boggle\\\" < \\\"cortege\\\" < \\\"eugenia\\\" < \\\"fletcher\\\" < \\\"grapheme\\\" < [\\\"hershel\\\" ? \\\"hem\\\"] < \\\"lieutenant\\\" < \\\"nuclide\\\" < \\\"oklahoma\\\" < \\\"refrain\\\" < \\\"verisimilitude\\\" < [\\\"walkie\\\" ? \\\"wilfred\\\"].\\nThought 5: Now let's sort this subpart [\\\"hershel\\\" ? \\\"hem\\\"] by looking at their second letters. The second letter: \\\"hershel\\\": \\\"e\\\" (5). \\\"hem\\\": \\\"e\\\" (5).\\nThought 6: We now have: (5) [\\\"hershel\\\" ? \\\"hem\\\"] for the subpart. Hence, we have \\\"agronomist\\\" < \\\"apostrophe\\\" < \\\"boggle\\\" < \\\"cortege\\\" < \\\"eugenia\\\" < \\\"fletcher\\\" < \\\"grapheme\\\" < [\\\"hershel\\\" ? \\\"hem\\\"] < \\\"lieutenant\\\" < \\\"nuclide\\\" < \\\"oklahoma\\\" < \\\"refrain\\\" < \\\"verisimilitude\\\" < [\\\"walkie\\\" ? \\\"wilfred\\\"].\\nThought 7: Now let's sort this subpart [\\\"walkie\\\" ? \\\"wilfred\\\"] by looking at their second letters. The second letter: \\\"walkie\\\": \\\"a\\\" (1). \\\"wilfred\\\": \\\"i\\\" (9).\\nThought 8: We now have: (1) \\\"walkie\\\" < (9) \\\"wilfred\\\" for the subpart. Hence, we have \\\"agronomist\\\" < \\\"apostrophe\\\" < \\\"boggle\\\" < \\\"cortege\\\" < \\\"eugenia\\\" < \\\"fletcher\\\" < \\\"grapheme\\\" < [\\\"hershel\\\" ? \\\"hem\\\"] < \\\"lieutenant\\\" < \\\"nuclide\\\" < \\\"oklahoma\\\" < \\\"refrain\\\" < \\\"verisimilitude\\\" < \\\"walkie\\\" < \\\"wilfred\\\".\\nThought 9: I have now sorted all the words. The answer is agronomist apostrophe boggle cortege eugenia fletcher grapheme hershel hem lieutenant nuclide oklahoma refrain walkie verisimilitude wilfred\\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":[]}