Please visit, subscribe and share 10 Minutes Lectures in Computer Science
Showing posts with label CYK algorithm. Show all posts
Showing posts with label CYK algorithm. Show all posts

# 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.

### CKY is a bottom-up parsing algorithm.

******************

• ### Go to NLP - MCQ Quiz Home page

#### 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

## Featured Content

### Multiple choice questions in Natural Language Processing Home

MCQ in Natural Language Processing, Quiz questions with answers in NLP, Top interview questions in NLP with answers Multiple Choice Que...

data recovery