CS224N: Natural Language Processing (Stanford Univ.): Lecture 11 - Polynomial Time Parsing of PCFGs (Probabilistic Context-Free Grammars)

Lecture 11 - Polynomial Time Parsing of PCFGs (Probabilistic Context-Free Grammars)