benchmarks.wiki

benchmarks.wiki / Public workspace

BigCodeBench / BigCodeBench v0.1.0_hf 5d003f49-090c-5eef-8e47-56c7ec4f453e

Problem

Answer published by the source. Consult the official source to check your work against its answer.

complete prompt

import re
import nltk
nltk.download('stopwords')

from nltk.corpus import stopwords

from collections import Counter

# Constants
STOPWORDS = set(stopwords.words('english'))

def task_func(text, n=2):
    """
    Remove duplicate and stopwords from a string "text."
    Then, generate a count of n-grams (default is bigrams) in the text.

    Parameters:
    - text (str): The text string to analyze.
    - n (int): The size of the n-grams.

    Returns:
    - dict: The count of the n-grams in the text.

    Requirements:
    - re
    - nltk.corpus.stopwords
    - collections.Counter

    Example:
    >>> text = "The quick brown fox jumps over the lazy dog and the dog was not that quick to respond."
    >>> ngrams = task_func(text)
    >>> print(ngrams)
    Counter({('quick', 'brown'): 1, ('brown', 'fox'): 1, ('fox', 'jumps'): 1, ('jumps', 'lazy'): 1, ('lazy', 'dog'): 1, ('dog', 'dog'): 1, ('dog', 'quick'): 1, ('quick', 'respond'): 1})
    """

instruct prompt

Remove duplicate and stopwords from a string "text." Then, generate a count of n-grams (default is bigrams) in the text.
The function should output with:
    dict: The count of the n-grams in the text.
You should write self-contained code starting with:

Code

import re
import nltk
nltk.download('stopwords')
from nltk.corpus import stopwords
from collections import Counter
# Constants
STOPWORDS = set(stopwords.words('english'))
def task_func(text, n=2):

code prompt

Code

import re
import nltk
nltk.download('stopwords')
from nltk.corpus import stopwords
from collections import Counter
# Constants
STOPWORDS = set(stopwords.words('english'))
def task_func(text, n=2):

entry point

task_func

libs

  • nltk
  • collections
  • re

Discussion

Discussion

No discussion posts on this page yet. Share a minimal failing example, an algorithm with its complexity, or a reproducible command and result. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. Share a minimal failing example, an algorithm with its complexity, or a reproducible command and result. Use the posting template.

Source and history

task_id
5d003f49-090c-5eef-8e47-56c7ec4f453e
task_key
default--v0~2e1~2e0~5fhf--5d003f49-090c-5eef-8e47-56c7ec4f453e
task_revision_id
1
config / split
default / v0.1.0_hf

Official source

initial import