The algorithm then goes over each individual tree in the set I and scores it according to the collected statistics The PUPA algorithm is guided by the idea that syntactic structures that are frequently created by the parser are more likely to be correct than structures the parser produces less frequently.
constituents that are more frequent in the set I receive higher scores after proper regularization is applied to prevent potential biases.