← All DMC Flashcard Decks

Text Mining & Natural Language Processing Flashcards

7 cards from real DMC practice questions. Tap to flip, then mark Knew It or Still Learning — missed cards come back until you master them.

Read the first 7 Text Mining & Natural Language Processing flashcards as text
  1. Which NLP technique is used to reduce words to their base or root form by removing suffixes and prefixes?

    Answer: Stemming

    Stemming reduces words to their root form (e.g., 'running' → 'run') by stripping affixes, enabling normalization before text analysis.

  2. In text mining, what does TF-IDF stand for?

    Answer: Term Frequency–Inverse Document Frequency

    TF-IDF (Term Frequency–Inverse Document Frequency) weights terms by how often they appear in a document relative to how common they are across the corpus.

  3. Which process converts raw text into a list of individual words or tokens?

    Answer: Tokenization

    Tokenization splits text into its smallest meaningful units (tokens), which is typically the first step in any text-mining pipeline.

  4. What is a 'bag-of-words' model in text mining?

    Answer: A representation that counts word occurrences while ignoring order

    The bag-of-words model represents text as an unordered collection of word counts, discarding syntax and position information.

  5. Which category of words is typically removed during text preprocessing because they carry little semantic meaning?

    Answer: Stop words

    Stop words (e.g., 'the', 'is', 'and') are filtered out because they appear frequently but contribute minimal discriminative information.

  6. Sentiment analysis is best described as which type of text-mining task?

    Answer: Opinion classification

    Sentiment analysis classifies text (positive, negative, neutral) based on the author's expressed opinion, making it a classification task.

  7. Which dimensionality reduction technique is commonly used in text mining to uncover latent topics in a document collection?

    Answer: Latent Dirichlet Allocation (LDA)

    Latent Dirichlet Allocation (LDA) is a generative probabilistic model that discovers hidden topic distributions across a corpus.

How this page was made: written with AI tools and published by Nathan Beja, founder of Practice Test Geeks, who is responsible for its content. We have not yet matched this exam's facts to an official source, so confirm fees, dates and rules with the exam body. Not reviewed by a subject-matter expert. Editorial policy