NPTEL Natural Language Processing Week 5 Assignment Answers 2025
1. Which of the following are true?
A) Given a CFG and its corresponding CNF, they produce different languages.
B) It requires ‘2n-1′ productions or steps in CNF to generate a string w of length “n’.
C) For a given grammar, there can be one CNF.
D) All of the above
Answer :- For Answers Click Here
2. Consider the CFG given below:
S → xsylV
V → Vz|c
How many non-terminals should be added to convert the CFG into CNF?
A) 2
B) 4
C) 5
D) 3
Answer :- For Answers Click Here
3. the CFG to CNF converted form?
In the above Q. 2) How many different numbers of Null productions in
A) 0
B) 1
C) 2
D) 3
Answer :-
4. In the above Q. 2) How many different numbers of production
rules/steps in the CFG to CNF converted form??
A) 2
B) 4
C) 7
D) 10
Answer :-
5. Using CKY algorithm, find the probability score for the most probable tree for the
sentence S, = “students play football with friends”.
A) 6.06 × 10-4
в) 1.62 × 10-6
C) 2.73 × 10-3
D) 4.33 × 10-6
Answer :-
6. Using CKY algorithm, find the number of parse trees for the sentence S2 = students like painting and the probability score for “at least one of the probable trees”.
A) 1, 4.95 × 10-3
B) 3, 0.36 × 10-3
C) 2, 0.99 × 10-3
D) 2, 0.54 × 10-3
Answer :-
7. Consider the expression below:
P(students enjoy cricket like painting”, N34|G) = PjP(*students enjoy cricket like painting” |Nj 34, G)
What does the L.H.S. represent?
A) Probability of the sentence “students enjoy cricket like painting”, given a grammar G.
B) Probability of the sentence “students enjoy cricket like painting”, given a grammar G and that there is some consistent spanning of the segment “cricket like”, i.e. from word 3 to 4.
C) Probability of the sentence “students enjoy cricket like painting”, given a grammar G and some rule which derives the segment “cricket like”.
D) None of the above
Answer :-
8.
Answer :- For Answers Click Here
