Natural Language Processing Nptel Week 5 Quiz Answers
Are you looking for Natural Language Processing Nptel Week 5 Quiz Answers? You’ve come to the right place! Access the most accurate answers at Progiez.
Table of Contents
Natural Language Processing Nptel Week 5 Quiz Answers (Jan-Apr 2025)
Course Link: Click Here
Q1. Which of the following are true?
a) Given a CFG and its corresponding CF, they produce different languages.
b) It requires 2n−12n-1 productions or steps in CNF to generate a string ww of length nn.
c) For a given grammar, there can be one CNF.
d) All of the above
Q2. Consider the CFG given below:
So → XSYV
V → vaie
How many non-terminals should be added to convert the CFG into CNF?
a) 2
b) 4
c) 5
d) 3
Q3. In the above question, how many different numbers of Null productions exist in the CFG to CNF converted form?
a) 0
b) 1
c) 2
d) 3
Q4. In the above question, how many different numbers of production rules/steps exist in the CFG to CNF converted form?
a) 2
b) 4
c) 7
d) 10
Q5. Using the CKY algorithm, find the probability score for the most probable tree for the given PCFG fragment.
a) 6.06×10^{-4}
b) 1.62× 10^{-6}
c) 2.73×10^{-3}
d) 4.33×10^{-6}
Q6. Using the CKY algorithm, find the number of parse trees for the sentence Si=S_i = “students like painting” and the probability score for at least one of the probable trees.
a) 1.495×10^{-3}
b) 3.036×10^{-7}
c) 2.099×10^{-3}
d) 2.054 10^{-3}
Q7. Consider the expression:
P(“students enjoy cricket like painting” | Ns) = P(“students enjoy cricket like painting” | No, G)
What does the LHS represent?
a) Probability of the sentence “students enjoy cricket like painting”, given a grammar.
b) Probability of the sentence “students enjoy cricket like painting”, given a grammar GG 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 GG and some rule which derives the segment “cricket like”.
d) None of the above.
Q8. Which of the following grammars are valid CNF?
- A → B 2. A→ B C D 3. A →B C
B → C D | B→ b B→E
C → c C→ c C→c
A → B C A→ a
a) a
b) b
c) c
d) D
Natural Language Processing Nptel Week 5 Quiz Answers
For answers to others Nptel courses, please refer to this link: NPTEL Assignment