Beefy Boxes and Bandwidth Generously Provided by pair Networks
P is for Practical
 
PerlMonks  

Re: Finding Nearly Identical Sets

by herveus (Prior)
on Sep 28, 2016 at 19:01 UTC ( [id://1172858]=note: print w/replies, xml ) Need Help??


in reply to Finding Nearly Identical Sets

Howdy!

Using the word "set" is a bit confusing. What I think you have is a string of digits. Going from that, I think some sort of Levenshtein distance is involved here. I note the existance of Text::Levenshtein on CPAN.

yours,
Michael

Replies are listed 'Best First'.
Re^2: Finding Nearly Identical Sets
by Limbic~Region (Chancellor) on Sep 29, 2016 at 11:50 UTC
    herveus,

    It isn't a string of digits though you could think of them that way.

    Have you ever tried executing the Levenshtein edit distance a trillion times? Even the XS version isn't that fast. Let's say I get 2 million messages a day and I have 500K different sets/strings to compare against - this isn't the way to go.

    Cheers - L~R

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others avoiding work at the Monastery: (5)
As of 2024-04-19 02:30 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found