For each word, w, in the vocabulary, we check whether (1) w can be segmented as r+x or p+r, where p and x are valid prefixes and suffixes respectively and r is another word in the vocabulary, and (2) the WRFR for w and r is less than our predefined thresholds (10 for suffixes and 2 for prefixes).
our algorithm outperforms the winners for all the languages in the competition, demonstrating its robustness across languages.