Please visit, subscribe and share 10 Minutes Lectures in Computer Science

# Natural language processing quiz questions with answers, NLP true false interview questions, NLP quiz questions for competitive exams

## NLP TRUE/FALSE Quiz Questions - SET 02

1. k-means clustering is an NP-hard problem.
(a) TRUE                                          (b) FALSE

 Answer: (b) FALSE k-means is linear to the number of instances and clusters; instead, the original partitional clustering problem is NP-hard.

### 2. Document triage is one of the steps of text pre-processing

(a) TRUE                                          (b) FALSE

 Answer: (a) TRUE Document triage is the first step in text preprocessing. It is about converting a set of digital files into well-defined text documents.

3. If the boundaries between morphemes are not clear and the component morphemes can express more than one grammatical meaning, we call those words as agglutinative.
(a) TRUE                                          (b) FALSE

 Answer: (b) FALSE Agglutinating is the concept where words divided into smaller units called morphemes with clear word boundaries between morphemes. The one given in the question is about inflectional morphology.

4. Lemmatization and Stemming both perform the same job.
(a) TRUE                                          (b) FALSE

 Answer: (b) FALSE Lemmatization is the task of determining that two words have the same root, despite their surface differences. Example: It maps the words ‘walks’, ‘walked’ and ‘walking’ to the word ‘walk’. Stemming refers to a simpler version of lemmatization in which we mainly just strip suffixes from the end of the word. Example: It maps the words ‘walks’, ‘walked’ and ‘walking’ to the word ‘walk’. But it maps ‘business’ and ‘busy’ to the same stem.

### 5. Edit distance is a measure that calculates the similarity between two strings based on the number of edits to be executed.

(a) TRUE                                          (b) FALSE

 Answer: (a) TRUE Edit distance is a metric that measures how similar two strings are based on the number of edits (insertions, deletions, substitutions) it needs to convert one string into another.

*************************