Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer
 
PerlMonks  

Re^3: Finding Nearly Identical Sets

by LanX (Saint)
on Sep 29, 2016 at 20:53 UTC ( [id://1172954]=note: print w/replies, xml ) Need Help??


in reply to Re^2: Finding Nearly Identical Sets
in thread Finding Nearly Identical Sets

Again, for me it is elegant.

It's fast, easy to implement and its matching the requirements.

Well unless you have more in mind than you told us.

Better solutions (like a more straight away normalization) would require your codepoints to have a guaranteed minimal distance.

This could certainly be achieved, but well regarding the generality of your question, it'll be far fetched to suppose such a structure.

Cheers Rolf
(addicted to the Perl Programming Language and ☆☆☆☆ :)
Je suis Charlie!

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others taking refuge in the Monastery: (3)
As of 2026-04-12 00:10 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found

    Notices?
    hippoepoptai's answer Re: how do I set a cookie and redirect was blessed by hippo!
    erzuuliAnonymous Monks are no longer allowed to use Super Search, due to an excessive use of this resource by robots.