Context free Grammer

Parsing:

Input - Sentence Output - Parsed tree

Parsing is a supervised machine learning problem. Training can be achieved by Treebank which consists of several sentences and their associated parsed trees. One example is Penn WSJ Treebank

The leaf nodes makes up a sentences. THEN part of speech tagging THEN PHRASES/CONSTITUENTS.

NP - noun phrase VP - verb phrase DT - Determiner S - Sentence V - Verb N - Noun

Leave a comment