Scribd
Upload
68 views6 pages

NPTEL NLP Assignment 2

This document contains a Natural Language Processing assignment with 10 multiple-choice questions focused on concepts such as Zipf's law, bi-grams, Markov models, Levenshtein distance, and Maximum Likelihood Estimation. Each question includes the correct answer and a detailed solution where applicable. The assignment tests knowledge on language modeling and statistical methods in NLP.

Uploaded by

mohammad baig
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
68 views6 pages

NPTEL NLP Assignment 2

This document contains a Natural Language Processing assignment with 10 multiple-choice questions focused on concepts such as Zipf's law, bi-grams, Markov models, Levenshtein distance, and Maximum Likelihood Estimation. Each question includes the correct answer and a detailed solution where applicable. The assignment tests knowledge on language modeling and statistical methods in NLP.

Uploaded by

mohammad baig
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

Natural Language Processing

Assignment- 2
TYPE OF QUESTION: MCQ
Number of questions: 10 Total mark: 10 X 1 = 10
______________________________________________________________________________

QUESTION 1:
According to Zipf’s law which statement(s) is/are correct?
(i) A small number of words occur with high frequency.
(ii) A large number of words occur with low frequency.
a. Both (i) and (ii) are correct
b. Only (ii) is correct
c. Only (i) is correct
d. Neither (i) nor (ii) is correct
Correct Answer: a
Solution:

____________________________________________________________________________
QUESTION 2:
Consider the following corpus C1 of 4 sentences. What is the total count of unique bi-grams for
which the likelihood will be estimated? Assume we do not perform any pre-processing.

tomorrow is Sachin’s birthday


He loves cream chocolates
he is also fond of sweet cake
we will celebrate his birthday with sweet chocolate cake

today is Sneha’s birthday


she likes ice cream
she is also fond of cream cake
we will celebrate her birthday with ice cream cake

a. 24
b. 28
c. 27
d. 23

Correct Answer: a

Detailed Solution:
Unique bi-grams are:
<s> tomorrow tomorrow is is Sachin’s Sachin’s birthday birthday <\s>
<s> he he loves loves cream cream chocolates chocolates <\s>
he is is also also fond fond of of sweet
cake <\s>
<s> we we will will celebrate celebrate his
his birthday birthday with with sweet chocolate cake
______________________________________________________________________________

QUESTION 3:
A 4-gram model is a ___________ order Markov Model.

a. Two
b. Five
c. Four
d. Three
Correct Answer: d

Detailed Solution:

______________________________________________________________________________

QUESTION 4:

Which of these is/are - valid Markov assumptions?

a. The probability of a word depends only on the current word.

b. The probability of a word depends only on the previous word.

c. The probability of a word depends only on the next word.

d. The probability of a word depends only on the current and the previous word.

Correct Answer: b

Solution:

______________________________________________________________________________

QUESTION 5:
For the string ‘mash’, identify which of the following set of strings has a Levenshtein distance of
1.

a. smash, mas, lash, mushy, hash


b. bash, stash, lush, flash, dash
c. smash, mas, lash, mush, ash
d. None of the above

Correct Answer: c

Detailed Solution:

______________________________________________________________________________
QUESTION 6:
Assume that we modify the costs incurred for operations in calculating Levenshtein distance,
such that both the insertion and deletion operations incur a cost of 1 each, while substitution
incurs a cost of 2. Now, for the string ‘clash’ which of the following set of strings will have an
edit distance of 1?

a. ash, slash, clash, flush


b. flash, stash, lush, blush,
c. slash, last, bash, ash
d. None of the above

Correct Answer: d

Detailed Solution:

____________________________________________________________________________

QUESTION 7:
Given a corpus C2, the Maximum Likelihood Estimation (MLE) for the bigram “dried berries” is
0.45 and the count of occurrence of the word “dried” is 720. For the same corpus C2, the likelihood
of “dried berries” after applying add-one smoothing is 0.05. What is the vocabulary size of C2?

a. 4780
b. 3795
c. 4955
d. 5780

Correct Answer: d

Detailed Solution:

0.45 = C(dried, berries) / 720


C(dried, berries) = 720*0.45 = 324

0.05 = (324+1) / (720+V)


V=5780
_____________________________________________________________________________
For Question 8 to 10, consider the following corpus C3 of 3 sentences.
there is a big garden
children play in a garden
they play inside beautiful garden

QUESTION 8:
Calculate P(they play in a big garden) assuming a bi-gram language model.
a. 1/8
b. 1/12
c. 1/24
d. None of the above

Correct Answer: b

Detailed Solution:

P(they | <s> ) = 1/3


P(play | they) = 1/1
P(in | play) = 1/2
P(a | in) = 1/1
P(big | a) = 1/2
P(garden | big) = 1/1
P(<\s>|garden) = 3/3
P(they play in a big garden) = 1/3 x 1/1 x 1/2 x 1/1 x 1/2 x 1/1 x 3/3 = 1/12
______________________________________________________________________________

QUESTION 9:
Considering the same model as in Question 7, calculate the perplexity of <s> they play in a big
garden <\s>.

a. 2.289
b. 1.426
c. 1.574
d. 2.178

Correct Answer: b

Detailed Solution:

______________________________________________________________________________
QUESTION 10:
Assume that you are using a bi-gram language model with add one smoothing. Calculate P(they
play in a beautiful garden).

a. 4.472 x 10^-6
b. 2.236 x 10^-6
c. 3.135 x 10^-6
d. None of the above

Correct Answer: b

Detailed Solution:

|V|=11
P(they | <s> ) = (1+1)/(3+11)
P(play | they) = (1+1)/(1+11)
P(in | play) = (1+1)/(2+11)
P(a | in) = (1+1)/(1+11)
P(beautiful | a) = (0+1)/(2+11)
P(garden | beautiful) = (1+1)/(1+11)
P(<\s>|garden) = (3+1)/(3+11)
P(they play in a beautiful garden) = 2/14 x 2/12 x 2/13 x 2/12 x 1/13 x 2/12 x 4/14
= 2.236 x 10^-6

____________________________________________________________________________

************END*******

You might also like