XP is just a number | |
PerlMonks |
comment on |
( [id://3333]=superdoc: print w/replies, xml ) | Need Help?? |
You could use Text::Levenshtein
It is an edit distance, i.e. it is a measure of the degree of proximity between two strings. So for example, distance("foo","four") is 2 because you need an edit "SUBSTITUTE" and an edit "INSERT". As algorithm I suggest the 'Stable Marriage Problem', a matching algorithm to best fit the "marriage preferences" of two sets. In reply to Re: Comparing Approximate Items
by dree
|
|