Natural Language Processing | Context Free Grammar Parsing | CFG | Top Down | Bottom Up

[@MrNareshinfy]

I believe in the top down approach it should be S -> VP -> (V, NP) -> (V, Adj, N) based on the rules given. on the similar line, bottom up approach the solution is projected as S -> VP NP however there is no such rule satisfying that condition. please correct me if I am wrong.

[@sharadlaad5484]

i think he has done a mistake with parsing treee

[@Diego0wnz]

Thankyou, I really needed a top down overview explanation instead of loose slgorithms without context

[@harshitmishra9451]

I think TDP is incorrect... It should have been S --> VP --> V, NP --> book, Det, Noun --> book, that, flight...

[@chiraagb]

yeah as VP cannot derive S

[@kiranjeetkaur4955]

Thankyou so much

[@arvindmewada7355]

Best book for NLP?

[@piyalikarmakar5979]

Thank you sir. You have described all the things in the easiest way.. Thanks a lot..

[@unfinished.education]

I like way of teaching

[@SunilMeena-do7xn]

I have found binod

[@terrigenod7290]

Bohot funny kardia aapne to

[@ashikkumarsn8931]

Good going

[@callmeclouds]

great

[@mohammadzahrawi5713]

amazing

[@md.shafaatjamilrokon8587]

TDP is wrong

[@your_daddy_mf]

then tell me right🤡🤡