{"kind":"task","effective_mode":"full","benchmark":{"kind":"benchmark","effective_mode":"full","slug":"bigcodebench","formal_name":"BigCodeBench","introduction":"BigCodeBench poses 1,140 function-level tasks drawn across 139 libraries. It tests whether a model can compose several real APIs correctly rather than write one self-contained function.","introduction_ja":"","introduction_en":"","category":"Category not supplied","task_count":null,"acquisition_status":"Acquisition status not supplied","official_url":"https://bigcode-bench.github.io/","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":"f3bd5fd8-2ceb-5572-8935-db10e9793d9b","task_key":"default--v0~2e1~2e0~5fhf--f3bd5fd8-2ceb-5572-8935-db10e9793d9b","task_revision_id":"1","upstream_id":"","short_description":"BigCodeBench v0.1.0_hf f3bd5fd8-2ceb-5572-8935-db10e9793d9b","config":"default","split":"v0.1.0_hf","body":"{\"code_prompt\":\"import re\\nimport string\\nfrom nltk.stem import PorterStemmer\\nfrom collections import Counter\\nSTEMMER = PorterStemmer()\\ndef task_func(content):\\n\",\"complete_prompt\":\"import re\\nimport string\\nfrom nltk.stem import PorterStemmer\\nfrom collections import Counter\\n\\nSTEMMER = PorterStemmer()\\n\\ndef task_func(content):\\n    \\\"\\\"\\\"\\n    Stem every word in a sentence, except the last, and count the frequency of each stem.\\n\\n    Parameters:\\n    content (str): The sentence to stem and count.\\n\\n    Returns:\\n    dict: A dictionary with stemmed words as keys and their frequency as values.\\n\\n    Requirements:\\n    - re\\n    - string\\n    - nltk.stem\\n    - collections.Counter\\n\\n    Example:\\n    >>> task_func('running runner run')\\n    {'run': 1, 'runner': 1}\\n    \\\"\\\"\\\"\\n\",\"entry_point\":\"task_func\",\"instruct_prompt\":\"Stem every word in a sentence, except the last, and count the frequency of each stem.\\nThe function should output with:\\n    dict: A dictionary with stemmed words as keys and their frequency as values.\\nYou should write self-contained code starting with:\\n```\\nimport re\\nimport string\\nfrom nltk.stem import PorterStemmer\\nfrom collections import Counter\\nSTEMMER = PorterStemmer()\\ndef task_func(content):\\n```\",\"libs\":\"['nltk', 'collections', 'string', 're']\"}","display_format":"code","language":"","answer_status":"published","assets":[],"source_url":"https://bigcode-bench.github.io/","history":"initial import","indexing_mode":"index","subproblems":[],"grids":[]}