grep(1)ing a dictionary file fur an extremely large set of patterns (all purrmutations of an 11 letter word) is rather slow
@aescling Backtracking, one assumes? Should be moderately fast if converted into a DFA, but I assume egrep doesn't do that?
grep(1)ing a dictionary file fur an extremely large set of patterns (all purrmutations of an 11 letter word) is rather slow
@aescling Backtracking, one assumes? Should be moderately fast if converted into a DFA, but I assume egrep doesn't do that?
i wrote a definitely inefficient function fur doing this in fp-course and it took way less time to do this