{"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":"e611c215-b077-5875-8138-9805398c4829","task_key":"bbeh~5fword~5fsorting--full--e611c215-b077-5875-8138-9805398c4829","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: tumultuous infuse legendre removal fledgling bernoulli numb fame canyon ultimate aberdeen conductor loam decode construct spiny converge\\nThought 1: I should start by looking at the first letter of the words in the list. The first letter: \\\"tumultuous\\\": \\\"t\\\" (20). \\\"infuse\\\": \\\"i\\\" (9). \\\"legendre\\\": \\\"l\\\" (12). \\\"removal\\\": \\\"r\\\" (18). \\\"fledgling\\\": \\\"f\\\" (6). \\\"bernoulli\\\": \\\"b\\\" (2). \\\"numb\\\": \\\"n\\\" (14). \\\"fame\\\": \\\"f\\\" (6). \\\"canyon\\\": \\\"c\\\" (3). \\\"ultimate\\\": \\\"u\\\" (21). \\\"aberdeen\\\": \\\"a\\\" (1). \\\"conductor\\\": \\\"c\\\" (3). \\\"loam\\\": \\\"l\\\" (12). \\\"decode\\\": \\\"d\\\" (4). \\\"construct\\\": \\\"c\\\" (3). \\\"spiny\\\": \\\"s\\\" (19). \\\"converge\\\": \\\"c\\\" (3).\\nThought 2: We now have: (1) \\\"aberdeen\\\" < (2) \\\"bernoulli\\\" < (3) [\\\"conductor\\\" ? \\\"converge\\\" ? \\\"canyon\\\" ? \\\"construct\\\"] < (4) \\\"decode\\\" < (6) [\\\"fame\\\" ? \\\"fledgling\\\"] < (9) \\\"infuse\\\" < (12) [\\\"legendre\\\" ? \\\"loam\\\"] < (14) \\\"numb\\\" < (18) \\\"removal\\\" < (19) \\\"spiny\\\" < (20) \\\"tumultuous\\\" < (21) \\\"ultimate\\\".\\nThought 3: Now let's sort this subpart [\\\"conductor\\\" ? \\\"converge\\\" ? \\\"canyon\\\" ? \\\"construct\\\"] by looking at their second letters. The second letter: \\\"conductor\\\": \\\"o\\\" (15). \\\"converge\\\": \\\"o\\\" (15). \\\"canyon\\\": \\\"a\\\" (1). \\\"construct\\\": \\\"o\\\" (15).\\nThought 4: We now have: (1) \\\"canyon\\\" < (15) [\\\"conductor\\\" ? \\\"converge\\\" ? \\\"construct\\\"] for the subpart.\\nThought 5: Now let's sort this subpart [\\\"conductor\\\" ? \\\"converge\\\" ? \\\"construct\\\"] by looking at their third letters. The third letter: \\\"conductor\\\": \\\"n\\\" (14). \\\"converge\\\": \\\"n\\\" (14). \\\"construct\\\": \\\"r\\\" (18).\\nThought 6: We now have: (14) \\\"conductor\\\" < (18) \\\"construct\\\" < (14) \\\"converge\\\" for the subpart. Hence, we have \\\"aberdeen\\\" < \\\"bernoulli\\\" < \\\"canyon\\\" < \\\"conductor\\\" < \\\"converge\\\" < \\\"construct\\\" < \\\"decode\\\" < \\\"fame\\\" < \\\"fledgling\\\" < \\\"infuse\\\" < \\\"legendre\\\" < \\\"loam\\\" < \\\"numb\\\" < \\\"removal\\\" < \\\"spiny\\\" < \\\"tumultuous\\\" < \\\"ultimate\\\".\\nThought 7: I have now sorted all the words. The answer is aberdeen bernoulli canyon conductor converge construct decode fame fledgling infuse legendre loam numb removal spiny tumultuous ultimate\\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":[]}