Job Interview Question using trie trees, how to solve this?

Question

I saw the following job interview question:

given two words a and b, we call a-b special m if there are at least m other pairs in our data s