I need to be able to parse out search terms into their different permutations where each permutation is either first word, first word + the next word, first word + next word + n