Skip to content
ml-recall

#pcfg

2 questions from NLP Fundamentals

Timed test

2 questions · 2 min · score and explanations at the end

Take a test
Q 1 / 2Score 0 / 0

Question 1: Single choice

mediumAI-checkedNLP Fundamentals

A PCFG has the rule NP→DT NN NN\mathrm{NP} \to \mathrm{DT}\ \mathrm{NN}\ \mathrm{NN} with probability 0.3. The CKY parser needs binary rules (Chomsky normal form). Using a new non-terminal ZZ that appears nowhere else, which replacement keeps the probability of every parse tree unchanged?

Choose one option