{"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":"0af1572d-63b5-5d2c-bad5-06ec3e8238cc","task_key":"bbeh~5fword~5fsorting--full--0af1572d-63b5-5d2c-bad5-06ec3e8238cc","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: revelatory rabbi neonate medea garage swahili muon december byline atlanta cursory ambient applicant sluggish stanton wei weaken conley\\nThought 1: I should start by looking at the first letter of the words in the list. The first letter: \\\"revelatory\\\": \\\"r\\\" (18). \\\"rabbi\\\": \\\"r\\\" (18). \\\"neonate\\\": \\\"n\\\" (14). \\\"medea\\\": \\\"m\\\" (13). \\\"garage\\\": \\\"g\\\" (7). \\\"swahili\\\": \\\"s\\\" (19). \\\"muon\\\": \\\"m\\\" (13). \\\"december\\\": \\\"d\\\" (4). \\\"byline\\\": \\\"b\\\" (2). \\\"atlanta\\\": \\\"a\\\" (1). \\\"cursory\\\": \\\"c\\\" (3). \\\"ambient\\\": \\\"a\\\" (1). \\\"applicant\\\": \\\"a\\\" (1). \\\"sluggish\\\": \\\"s\\\" (19). \\\"stanton\\\": \\\"s\\\" (19). \\\"wei\\\": \\\"w\\\" (23). \\\"weaken\\\": \\\"w\\\" (23). \\\"conley\\\": \\\"c\\\" (3).\\nThought 2: We now have: (1) [\\\"ambient\\\" ? \\\"applicant\\\" ? \\\"atlanta\\\" ? \\\"byline\\\"] < (2) \\\"byline\\\" < (3) [\\\"conley\\\" ? \\\"cursory\\\"] < (4) \\\"december\\\" < (7) \\\"garage\\\" < (13) [\\\"medea\\\" ? \\\"muon\\\"] < (14) \\\"neonate\\\" < (18) [\\\"rabbi\\\" ? \\\"revelatory\\\"] < (19) [\\\"sluggish\\\" ? \\\"swahili\\\" ? \\\"stanton\\\"] < (23) [\\\"wei\\\" ? \\\"weaken\\\"].\\nThought 3: Now let's sort this subpart [\\\"ambient\\\" ? \\\"applicant\\\" ? \\\"atlanta\\\" ? \\\"byline\\\"] by looking at their second letters. The second letter: \\\"ambient\\\": \\\"b\\\" (2). \\\"applicant\\\": \\\"p\\\" (16). \\\"atlanta\\\": \\\"t\\\" (20). \\\"byline\\\": \\\"y\\\" (25).\\nThought 4: We now have: (2) \\\"ambient\\\" < (16) \\\"applicant\\\" < (20) \\\"atlanta\\\" < (25) \\\"byline\\\" for the subpart. Hence, we have \\\"ambient\\\" < \\\"applicant\\\" < \\\"atlanta\\\" < \\\"byline\\\" < \\\"conley\\\" < \\\"cursory\\\" < \\\"december\\\" < \\\"garage\\\" < \\\"medea\\\" < \\\"muon\\\" < \\\"neonate\\\" < \\\"rabbi\\\" < \\\"revelatory\\\" < \\\"sluggish\\\" < \\\"swahili\\\" < \\\"stanton\\\" < \\\"wei\\\" < \\\"weaken\\\".\\nThought 5: I have now sorted all the words. The answer is ambient applicant atlanta byline conley cursory december garage medea muon neonate rabbi revelatory sluggish swahili stanton wei weaken\\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":[]}