## NPTEL Natural Language Processing Week 4 Assignment Answers 2024

1. Baum-Welch algorithm is an example of

A) Forward-backward algorithm

B) Special case of the Expectation-maximisation algorithm

C) Both A and B

D) None

Answer :-For AnswerClick Here

2.

Answer :-For AnswerClick Here

3. In the question 2, the expected number of consecutive days of sunny weather is:

A) 2

B) 3

C) 4

D) 5

Answer :-For AnswerClick Here

4. You are building a model distribution for an infinite stream of word tokens. You

know that the source of this stream has a vocabulary of size 1200. Out of these 1200

words you know of 200 words to be stop words each of which has a probability of

0.001. With only this knowledge what is the maximum possible entropy of the

modelled distribution. (Use log base 10 for entropy calculation)

A) 2.079

B) 4.5084

C) 2.984

D) 3.0775

Answer :-

5. Suppose you have the input sentence “Sachin Tendulkar is a great player”.

And you know the possible tags each of the words in the sentence can take.

- Sachin: NN, NNS, NNP, NNPS
- Tendulkar: NN, NNS, NNP, NNPS
- is: VB
- a: DT
- great: ADJ
- player: NN, NNS, NNP

How many possible hidden state sequences are possible for the above sentence

and States?

A) 4 × 3 × 3

B) 43°3

C) 2* × 23 × 23

D) 3 × 4ª

Answer :-

6. What are the space and time complexity order of the Viterbi algorithm? K is the

number of states and N number of time steps.

A) KN, K°N

B) KEN, KN

C) K}N, K-N

D) KN, KN

Answer :-For AnswerClick Here

7.

Answer :-For AnswerClick Here