Multiple choices questions in NLP, Natural Language Processing solved MCQ, What is the use of Chomsky normal form, CFG to CNF in CKY algorithm, Why do we need the grammar in chomsky normal form while parsing using Cocke-Kasami-Yonger CKY algorithm?
Natural Language Processing MCQ - What is not CKY algorithm
1. Which of the following is/are true about CKY algorithm?
a) It requires that the grammar be in Chomsky Normal Form (CNF)
b) Only the intermediate solutions that contribute to a full parse tree are further processed
c) CKY is a top-down parsing algorithm
d) CKY is a naïve search algorithm
|
Answer: (a) It requires that the grammar be in Chomsky Normal Form (CNF) and (b) Only the intermediate solutions that contribute to a full parse tree are further processed
(a) The use of Chomsky normal form instead of CFG, helps to avoid ambiguity problem during parsing. The time complexity of CKY algorithm is O(n3) where n is the number of words in the given sentence. Using the grammar which is in CNF reduces the complexity caused due to the longer production rules. Because production rules as per CNF are of binary form at the maximum. Refer here for more.
(b) CKY uses dynamic programming. Hence, intermediate solutions are stored. And these intermediate solutions only need to be pursued further for parsing the input sentence.
CKY is a bottom-up parsing algorithm. |
Top interview questions in NLP
NLP quiz questions with answers explained
What is the use of chomsky normal form
Why do we need to convert the grammar in CFG to CNF in CKY algorithm
CKY algorithm is used to parse a sentence