{"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":"f1c59a52-0100-5bdc-9cce-8ade2e7e0dd2","task_key":"bbeh~5fword~5fsorting--full--f1c59a52-0100-5bdc-9cce-8ade2e7e0dd2","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: inability nucleus vague possible invocable janice erg\\nThought 1: I should start by looking at the first letter of the words in the list. The first letter: \\\"inability\\\": \\\"i\\\" (9). \\\"nucleus\\\": \\\"n\\\" (14). \\\"vague\\\": \\\"v\\\" (22). \\\"possible\\\": \\\"p\\\" (16). \\\"invocable\\\": \\\"i\\\" (9). \\\"janice\\\": \\\"j\\\" (10). \\\"erg\\\": \\\"e\\\" (5).\\nThought 2: We now have: (5) \\\"erg\\\" < (9) [\\\"inability\\\" ? \\\"invocable\\\"] < (10) \\\"janice\\\" < (14) \\\"nucleus\\\" < (16) \\\"possible\\\" < (22) \\\"vague\\\".\\nThought 3: Now let's sort this subpart [\\\"inability\\\" ? \\\"invocable\\\"] by looking at their second letters. The second letter: \\\"inability\\\": \\\"n\\\" (14). \\\"invocable\\\": \\\"n\\\" (14).\\nThought 4: We now have: (14) [\\\"inability\\\" ? \\\"invocable\\\"] for the subpart. Hence, we have \\\"erg\\\" < [\\\"inability\\\" ? \\\"invocable\\\"] < \\\"janice\\\" < \\\"nucleus\\\" < \\\"possible\\\" < \\\"vague\\\".\\nThought 5: Now let's sort this subpart [\\\"inability\\\" ? \\\"invocable\\\"] by looking at their third letters. The third letter: \\\"inability\\\": \\\"a\\\" (1). \\\"invocable\\\": \\\"v\\\" (22).\\nThought 6: We now have: (1) \\\"inability\\\" < (22) \\\"invocable\\\" for the subpart. Hence, we have \\\"erg\\\" < \\\"inability\\\" < \\\"invocable\\\" < \\\"janice\\\" < \\\"nucleus\\\" < \\\"possible\\\" < \\\"vague\\\".\\nThought 7: I have now sorted all the words. The answer is erg inability invocable janice nucleus possible vague\\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":[]}