How can I convert PCFG in CNF for this grammar

0 votes

Given the following probabilistic context-free grammar -

1.NP -> ADJ N [0.6]
2.NP -> N     [0.4] 
3.N  -> cat   [0.2] 
4.N  -> dog   [0.8]

what will be the CNF??

Mar 23 in Machine Learning by Dev
• 6,000 points
166 views

1 answer to this question.

0 votes

To answer your question. The CNF is given below

1.NP -> ADJ N [0.6]
2.NP -> cat   [0.08]
3.NP -> dog   [0.32]

 Because both the original and modified sets of rules must produce the same probability for the result (in CNF)

answered Mar 25 by Nandini
• 5,480 points

Related Questions In Machine Learning

0 votes
0 answers

how can i make menus in google dialogflow chatbot??

I am working on a chatbot for ...READ MORE

Apr 29, 2020 in Machine Learning by Ankit
• 120 points
1,182 views
0 votes
1 answer
0 votes
1 answer

Python or R – Which one would you prefer for text analytics?

We will prefer Python because of the ...READ MORE

answered Aug 20, 2018 in Data Analytics by Abhi
• 3,720 points
3,062 views
0 votes
1 answer

Tokenizing text file generates error using word tokenize_words

Hi Bolder, As you are using the delim ...READ MORE

answered Aug 28, 2018 in Data Analytics by Abhi
• 3,720 points
1,883 views
0 votes
1 answer

How to check plural & singular form of a word?

You can try with the inflect 0.2.4 ...READ MORE

answered Jan 3, 2019 in Python by anonymous
3,207 views
0 votes
1 answer
0 votes
1 answer

How do I create a linear regression model in Weka without training?

Weka is a classification algorithm. This is ...READ MORE

answered Mar 9 in Machine Learning by Nandini
• 5,480 points
369 views
0 votes
1 answer

Can we use Normal Equation for Logistic Regression ?

Well not likely,  only one discriminative method ...READ MORE

answered Feb 24 in Machine Learning by Nandini
• 5,480 points
267 views
webinar REGISTER FOR FREE WEBINAR X
REGISTER NOW
webinar_success Thank you for registering Join Edureka Meetup community for 100+ Free Webinars each month JOIN MEETUP GROUP