Beefy Boxes and Bandwidth Generously Provided by pair Networks
more useful options
 
PerlMonks  

Re: compare strings intuitively

by dewey (Pilgrim)
on May 07, 2007 at 05:01 UTC ( [id://613887]=note: print w/replies, xml ) Need Help??


in reply to compare strings intuitively

Interesting question-- whether or not the module Zaxo suggests does it for you, can we clarify what your intuitions are? From your example, I would guess that what matters to you is the number of operations required to turn one string into another (where character substitution and insertion are allowed as operations) as compared to the length of the strings (one-character strings 'a' and 'b' are, to me, less identical than 'aaaaaa' and 'aaaaba'). Any ideas?

~dewey

Replies are listed 'Best First'.
Re^2: compare strings intuitively
by rsiedl (Friar) on May 07, 2007 at 07:34 UTC
    i'm sorting through a bunch of data with an author field. sometimes an author could be represented as 'a name' and other times 'am name', things like that. my goal is to try and work out which authors are the same people.
    "what matters to you is the number of operations required to turn one string into another" - yeah thats pretty much right but with a few exceptions.
    'a name' is obviously different from 'b name'
    but
    'am name' could be 'a name'
    the substitution method wouldnt work on its own here.

      Good luck ... this is a tough nut to crack with any non-trivial set of data - the number of false positives is going to be high. Uncommon names will work well but the m. smiths of the world are not going to be happy campers.

      -derby

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others examining the Monastery: (4)
As of 2024-04-19 05:01 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found