Beefy Boxes and Bandwidth Generously Provided by pair Networks
There's more than one way to do things

Re: Search for similar strings - to standardise

by Rival (Acolyte)
on Oct 30, 2009 at 16:15 UTC ( #804191=note: print w/replies, xml ) Need Help??

in reply to Search for similar strings - to standardise

For the string comparison, using the Levenshtein distance is probably your best bet. This is often used in spell-checking to suggest corrections.

For implementations, there is a Text::Levenshtein module on CPAN. But also, take a look at this node and this node.

  • Comment on Re: Search for similar strings - to standardise

Replies are listed 'Best First'.
Re^2: Search for similar strings - to standardise
by educated_foo (Vicar) on Oct 31, 2009 at 03:33 UTC
    Edit distance would be useful for comparison, but not so much for clustering strings with their common misspellings. For that, you might try n-grams (mentioned above) or locality-sensitive hashing (basically the same thing, but with gaps).

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://804191]
[LanX]: Rat or newest nodes
[LanX]: I think there are RSS feeds you could use, but never used them
[Eily]: LanX how does the first link work, should I send a message to rat? :D
[LanX]: yes, or click the second link

How do I use this? | Other CB clients
Other Users?
Others browsing the Monastery: (8)
As of 2018-03-19 09:55 GMT
Find Nodes?
    Voting Booth?
    When I think of a mole I think of:

    Results (238 votes). Check out past polls.