This makes the tree language less refined, and one may expect the scores therefore to be generally lower.
in many cases where strict labeling suffers from a higher proportion of parse failures (so that the parser must fall back on the default structure), it is child labeling that has the higher scores.