Beefy Boxes and Bandwidth Generously Provided by pair Networks
Syntactic Confectionery Delight

Re^3: Finding Nearly Identical Sets

by LanX (Cardinal)
on Sep 29, 2016 at 20:53 UTC ( #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?

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

How do I use this? | Other CB clients
Other Users?
Others musing on the Monastery: (6)
As of 2021-03-01 23:14 GMT
Find Nodes?
    Voting Booth?
    My favorite kind of desktop background is:

    Results (28 votes). Check out past polls.