If we assume that C[j] is the highest scoring compression that ends at word x j , for all j < i, then C[i] must also be the highest scoring compression ending at word x i since it represents the max combination over all high scoring shorter compressions plus the score of extending the compression to the current word.
the judges were told all three compressions were automatically generated and the order in which they were presented was randomly chosen for each sentence.