Fortunately , there exists a compact PCFG-reduction of DOP1 that generates the same trees with the same probabilities , as shown by Goodman ( 1996 , 2002 ) .
efficient algorithms for parsing the dop model
J Goodman
A disadvantage of this model is that an extremely large number of subtrees ( and derivations ) must be taken into account . Fortunately , there exists a compact PCFG-reduction of DOP1 that generates the same trees with the same probabilities , as shown by Goodman ( 1996 , 2002 ) . Here we will only sketch this PCFG-reduction , which is heavily based on Goodman ( 2002 ) .
Fortunately , there exists a compact PCFG-reduction of DOP1 that generates the same trees with the same probabilities , as shown by @@CITATION , 2002 ) .