The combination is done with a simple majority vote of whether or not constituents should appear in the combined tree.
if a constituent appears at least (m + 1)/2 times in the output of the m parsers, the constituent is added to the final tree.