Perl: the Markov chain saw | |
PerlMonks |
Re^2: Finding Nearly Identical Setsby Limbic~Region (Chancellor) |
on Sep 29, 2016 at 11:50 UTC ( [id://1172911]=note: print w/replies, xml ) | Need Help?? |
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
In Section
Seekers of Perl Wisdom
|
|