Syntactic Confectionery Delight | |
PerlMonks |
Re: Longest Common Subsequenceby Unanimous Monk (Sexton) |
on May 29, 2006 at 15:29 UTC ( [id://552326]=note: print w/replies, xml ) | Need Help?? |
Do you know how this is useful or how can the approach be adapted and applied to be useful? It might find a use in spam filtering. An email made it through my spam filter today, and the cause was randomly inserted letters into the key words that the spam filter looks for. I don't think this would necessarily solve that problem completely (there is still the issue of intensionally mispelling words, using different characters for different letters, etc), but it could be an improvement.
In Section
Meditations
|
|