To address this sparseness problem, we rely on both relative corpus frequency and suffix level similarity to identify incorrect attachments.
if the WRFR of a <word, root> pair is between 1 and 10, we determine that an attachment to the root is incorrect if -WRFR + * (suffix level similarity) < 0, where is set to 0.15.