Beefy Boxes and Bandwidth Generously Provided by pair Networks
Syntactic Confectionery Delight
 
PerlMonks  

Re: Longest Common Subsequence

by Unanimous Monk (Sexton)
on May 29, 2006 at 15:29 UTC ( [id://552326]=note: print w/replies, xml ) Need Help??


in reply to Longest Common Subsequence

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.

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://552326]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others having a coffee break in the Monastery: (3)
As of 2024-04-20 03:36 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found