PCFG-reduction of Bonnema (1999) By using these PCFG-reductions we can thus parse with all subtrees in polynomial time.
as mentioned above, efficient parsing does not necessarily mean efficient disambiguation: the exact computation of the most probable parse remains exponential.