CKY algorithm code

complete parse table for Book the flight through Houston.

Parse table example

State University of New York at Stony Brook

CKY Parsing

An on-going but a helpful book resource about NLP
https://web.stanford.edu/~jurafsky/slp3/

Speech and Language Processing (3rd ed. draft) 

The CKY algorithm requires grammars to first be in CNF.
Grammars in CNF are restricted to rules of the form A -> B C or A -> w.
The right hand-side of each rule must expand either to two non-terminals or to a single terminal.

Situation 1 : mix terminals with non-terminals on the right-hand side

Situation 2 : single non-terminal on the right-hand side (unit productions).

Situation 3 : the length of the right-hand side is greater than 2


Learn Before

Related

Learn After