NPTEL Natural Language Processing Week 4 Assignment Answers 2025
1. Baum-Welch algorithm is an example of –
A) Forward-backward algorithm
B) Not a case of the Expectation-maximisation algorithm
C) Both A and B
D) None
Answer :- For Answers Click Here
2.
Answer :-
3. In the question 2, the expected number of consecutive days of sunny weather is:
A) 2
B) 3
C) 4
D) 5
Answer :-
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.
Answer :-
6. What are the time and space complexity order of the Viterbi algorithm? K is the
number of states and N number of time steps.
A) KN, K2N
B) K2N, KN
C) K2N, K2N
D) KN, KN
Answer :-
7.
Answer :- For Answers Click Here
