http://www.perlmonks.org?node_id=209771


in reply to Re: Junk NOT words
in thread Junk NOT words

The problem with this algorithm, is that it has a VERY bad worse case performance, it's in O(2^n), where n is the length of the string. Meaning that as the strings get larger, this problem will become insolvable by deterministic methods. Some sort of heuristic is needed.