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

preview_player
Показать описание
What is Context free grammar in context of Natural language Processing?
Why do we use CFG Parsing ? Different type of Parsing?
How to draw Parse tree using Top down and Bottom Up approach.

Рекомендации по теме
Комментарии
Автор

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.

MrNareshinfy
Автор

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

Diegownz
Автор

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

harshitmishra
Автор

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

piyalikarmakar