Beefy Boxes and Bandwidth Generously Provided by pair Networks
No such thing as a small change
 
PerlMonks  

Re: Re: Comparing Approximate Items

by artist (Parson)
on Jan 08, 2003 at 17:26 UTC ( [id://225303]=note: print w/replies, xml ) Need Help??


in reply to Re: Comparing Approximate Items
in thread Comparing Approximate Items

Hi,
For I just have one correction Sets A and B doesn't contain the same number of strings
Should read : Sets A and B may not contain the same number of strings

I use use Algorithm::Diff and that works approximately ok for my match-purpose.

Aritst

Replies are listed 'Best First'.
Re: Re: Re: Comparing Approximate Items
by tall_man (Parson) on Jan 08, 2003 at 21:12 UTC
    It's not obvious to me how Algorithm::Diff can be used to compute edit distances. Do you call diff() and then count up the number of insertions and deletions in the result?

    Suppose you have several equidistant matches from a given element in A to several elements in B. Do you have to pick one of them such that the overall number of pairings is maximized? It might be an NP-complete problem.

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others meditating upon the Monastery: (3)
As of 2024-03-29 07:18 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found