Parsing Algorithm: Filtering with compiled CFG (2/2)
Enumerate all the pairs of feature
structures that can be unified.
For instance, if E and C can be
unified and B and D can be unified,
generate the following CFG rules.
Apply rule schemata to a lexical
entry in a recursive manner.