Re^2: Levenshtein distance: calculating similarity of strings

in reply to Re: Levenshtein distance: calculating similarity of strings
in thread Levenshtein distance: calculating similarity of strings

... it reduced the execution speed ...

So just to be clear, are you saying your change made the code slower by about 20%?

Give a man a fish: <%-{-{-{-<

Comment on Re^2: Levenshtein distance: calculating similarity of strings Download Code

Replies are listed 'Best First'.
Re^3: Levenshtein distance: calculating similarity of strings by Anonymous Monk on Feb 22, 2018 at 04:27 UTC
Oops, sorry. It reduced execution time by about 20%. I'm not allowed to post my actual code, but it was just the few obvious changes: declare @mat rather than %mat, and use [] rather than {}. I made a loop that called levenshtein with 2 arrays of strings of 2-character words. Between one and 25 words per string, comparing all possible combinations of 51 different such "sentences". Hence 51 * 51 = 2061 string comparisons of between one and 25 words per sentence. I executed it on an old MacBook Pro 200 times, and took the average "user" time from the "time" command. Average "user" time was 19.31% shorter.	[reply]
Re^4: Levenshtein distance: calculating similarity of strings by AnomalousMonk (Archbishop) on Feb 22, 2018 at 04:53 UTC
There's also Benchmark. Give a man a fish: `<%-{-{-{-<`	[reply] [d/l]

In Section Cool Uses for Perl