Re: Re: 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

Comment on Re: Re: Comparing Approximate Items

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.	[reply]