We use a bottom up, minimum distance clustering for valid affix pairs (rules).
the count of a rule candidate r={b 1 , b 2 } in a trie is the number of stem candidates it appears with: We also use CAff(s) for the set of affix candidates of stem s across several tries, and CRule(s) for the set of rule candidates of a stem s across several tries.