CompTIA DataX DY0-001 (V1) Practice Question

In the TF-IDF text-classification pipeline you are building for English-language restaurant reviews, the initial document-term matrix contains more than 150 000 unique tokens because words such as "run", "running", and "ran" are treated as separate features. You want to reduce this sparsity without accidentally conflating semantically different words like "universe" and "university". Which single text-preparation step best satisfies the requirement?

  • Switch to character-level tokenization so each character becomes a feature.

  • Remove all stop words, including verbs and adjectives, before vectorization.

  • Apply part-of-speech-aware lemmatization to convert each token to its dictionary lemma.

  • Run the Porter stemming algorithm to strip suffixes from every token.

CompTIA DataX DY0-001 (V1)
Specialized Applications of Data Science
Your Score:
Settings & Objectives
Random Mixed
Questions are selected randomly from all chosen topics, with a preference for those you haven’t seen before. You may see several questions from the same objective or domain in a row.
Rotate by Objective
Questions cycle through each objective or domain in turn, helping you avoid long streaks of questions from the same area. You may see some repeat questions, but the distribution will be more balanced across topics.

Check or uncheck an objective to set which questions you will receive.

SAVE $64
$529.00 $465.00
Bash, the Crucial Exams Chat Bot
AI Bot