Stemming Multiple Choice Questions and answers Pdf
Stemming is very important term which is used in Machine Learning. Stemming Multiple Choice Questions are asked in various examination of University and Colleges as well as this topic is important as per the Machine Learning algorithms.
In this article we have discussed about different types of Stemming in Machine Learning. Which includes these 5 types of Stemming.
A. Lovins Stemmer
B. Porter’s Stemmer algorithm
C. Dawson Stemmer
D. Krovetz Stemmer
E. Lancaster stemmer
1.________is the process of producing morphological variants of a root/base word.
A. Rooting
B. Stemming
C. Controlling
D. None of the above.
Ans : B
2.Stemming programs are commonly referred to as ___________ .
A. Controlling Algorithm
B. Rooting Algorithm
C. stemming algorithms
D. None of these
Ans : C
3.Stemming is an important part of the pipelining process in ________.
A. Machine Learning
B. Nature language processing
C. Artificial intelligence
D. Error finding
Ans : B
4.There are mainly _______ errors in stemming
A. 3
B. 2
C. 4
D. 5
Ans : B
5._______occurs when two words are stemmed from the same root that are of different stems.
A. over-stemming
B. Under-stemming
C. Same-stemming
D. Ulta stemming
Ans : A
6.Over-stemming can also be regarded as ______
A.false-negetives
B. false-positives
C. True- negetives
D. True- positives
Ans : B
7._________occurs when two words are stemmed from the same root that are not of different stems.
A. over-stemming
B. Under-stemming
C. Same-stemming
D. Ulta stemming
Ans : B
8.Under-stemming can be interpreted as________.
A.false-negetives
B. false-positives
C. True- negetives
D. True- positives
Ans : A
9.__________is used in information retrieval systems like search engines.
A. Rooting
B. Stemming
C. Controlling
D. None of the above.
Ans : B
10.__________most popular stemming methods proposed in 1980.
A. Lovins Stemmer
B. Porter’s Stemmer algorithm
C. Dawson Stemmer
D. Krovetz Stemmer
Ans.B
11. ___________stemmer is known for its speed and simplicity.
A. Lovins Stemmer
B. Porter’s Stemmer algorithm
C. Dawson Stemmer
D. Krovetz Stemmer
Ans.B
12._________proposed by Lovins in 1968, that removes the longest suffix from a word.
A. Lovins Stemmer
B. Porter’s Stemmer algorithm
C. Dawson Stemmer
D. Krovetz Stemmer
Ans : A
13.___________is an extension of Lovins stemmer in which suffixes are stored in the reversed order indexed by their length and last letter.
A. Lovins Stemmer
B. Porter’s Stemmer algorithm
C. Dawson Stemmer
D. Krovetz Stemmer
Ans : C
14. __________was proposed in 1993 by Robert Krovetz.
A. Lovins Stemmer
B. Porter’s Stemmer algorithm
C. Dawson Stemmer
D. Krovetz Stemmer
Ans : D
15._________stemmers are more aggressive and dynamic compared to the other two stemmers.
A. Lovins Stemmer
B. Porter’s Stemmer algorithm
C. Lancaster Stemmer
D. Krovetz Stemmer
Ans : C