... New Ranking Algorithms for Parsing and Tagging: Kernels over Discrete Structures, and the Voted PerceptronMichael CollinsAT&T Labs-Research,Florham Park, New Jersey.mcollins@research.att.comNigel ... at and are the same, and and are pre-terminals, then .5Else if the productions at and are the same and and are not pre-terminals,where is the number of children of in the tree; because the ... todenote the ’th candidate for the ’th sentence intraining data, and to denote the set of candidates for .Without loss of generality we take to be the correct candidate for (i.e., ).Each candidate...