A treebank is a corpus of already-parsed sentences, which helps to learn probabilities for the rules of a grammar. Using a treebank, we can use the below formula to compute the probability of each expansion of a non-terminal by counting the number of times that expansion occurs and then normalizing. Without a treebank, we would need to account for any ambiguities, and then parse.

Treebank

Most probabilistic parsers utilize Ney's 1991 probabilistic CKY algorithm, in which each word in a sentence is indexed and each constituent is encoded in a two-dimensional matrix.

University of California, Santa Cruz

Google

The goal of PCFGs is to propose the most likely parse *T̂* of a given sentence *S*.

PCFG Parsing Problem

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

Learn Before

Related

Learn After