The training then proceded by decomposing all parse trees into sequences of SHIFT, PROJECT and ATTACH transitions.
the CPPL is an underbound of the PPL in that it would be the PPL from an ideal parser.