Quote:

 

My word matcher is a little odd. I make use of a dawg (directed acyclic word graph) that is normally used by Scrabble programs for word validation. I proceed down the text looking for sequences that represent a word and in each position where I find a word, I start from that next position and recursively search for words again. I will also skip positions and try searching for words. Overall, it is fairly compute intensive, but I find that in the overall scheme of things, it helps the programs zoom in on a correct solution much faster than using n-graphs. The handy thing about my matcher is that it doesn't need word breaks, in fact it ignores them.