{"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":"68a53204-325c-5208-9aed-437a3ab15baa","task_key":"default--v0~2e1~2e0~5fhf--68a53204-325c-5208-9aed-437a3ab15baa","task_revision_id":"1","upstream_id":"","short_description":"BigCodeBench v0.1.0_hf 68a53204-325c-5208-9aed-437a3ab15baa","config":"default","split":"v0.1.0_hf","body":"{\"code_prompt\":\"from nltk.tokenize import RegexpTokenizer\\nfrom collections import Counter\\ndef task_func(text):\\n\",\"complete_prompt\":\"from nltk.tokenize import RegexpTokenizer\\nfrom collections import Counter\\n\\n\\ndef task_func(text):\\n    \\\"\\\"\\\"\\n    Identifies and counts words in a given text that start with the \\\"$\\\" symbol. It returns the five most frequent\\n    dollar-prefixed words along with their counts. Words solely consisting of \\\"$\\\" symbols without any following\\n    alphanumeric characters are ignored in the frequency count.\\n\\n    Parameters:\\n    - text (str): The input text to analyze.\\n\\n    Returns:\\n    - list of tuples: Each tuple contains a dollar-prefixed word (excluding the \\\"$\\\" symbol) and its frequency,\\n                      ordered by most to least common.\\n\\n    Requirements:\\n    - nltk.tokenize.RegexpTokenizer\\n    - collections.Counter\\n\\n    Example:\\n    >>> text = \\\"$abc def $efg $hij klm $ $abc $abc $hij $hij\\\"\\n    >>> task_func(text)\\n    [('abc', 3), ('hij', 3), ('efg', 1)]\\n    \\\"\\\"\\\"\\n\",\"entry_point\":\"task_func\",\"instruct_prompt\":\"Identifies and counts words in a given text that start with the \\\"$\\\" symbol. It returns the five most frequent dollar-prefixed words along with their counts. Words solely consisting of \\\"$\\\" symbols without any following alphanumeric characters are ignored in the frequency count.\\nThe function should output with:\\n    list of tuples: Each tuple contains a dollar-prefixed word (excluding the \\\"$\\\" symbol) and its frequency,\\n    ordered by most to least common.\\nYou should write self-contained code starting with:\\n```\\nfrom nltk.tokenize import RegexpTokenizer\\nfrom collections import Counter\\ndef task_func(text):\\n```\",\"libs\":\"['nltk', 'collections']\"}","display_format":"code","language":"","answer_status":"published","assets":[],"source_url":"https://bigcode-bench.github.io/","history":"initial import","indexing_mode":"index","subproblems":[],"grids":[]}