Re^2: Levenshtein distance: calculating similarity of strings


P is for Practical
	PerlMonks

Re^2: Levenshtein distance: calculating similarity of strings

by Anonymous Monk

on Jul 07, 2014 at 13:30 UTC ( [id://1092573]=note: print w/replies, xml )

Need Help??

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

hello everyone,

I am trying to get the separate results from the Levenshtein distance, namely the number of deleted, inserted and replaced characters. Do you have any idea?

Thanks in advance.

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

Replies are listed 'Best First'.
Re^3: Levenshtein distance: calculating similarity of strings by Anonymous Monk on Jul 08, 2014 at 02:18 UTC
Hi :) You're asking goldbug was last here 11 years ago :) and can't hear you. See on necromancy (reviving old threads) and The Perl Monks Guide to the Monastery If you want to ask everybody go to new question: Seekers of Perl Wisdom OTOH, going to cpan is always a good idea, Levenshtein deleted, Levenshtein deleted	[reply]
Re^4: Levenshtein distance: calculating similarity of strings by Anonymous Monk on Apr 17, 2017 at 16:53 UTC
I do hope s/he is still alive and well.	[reply]

In Section Cool Uses for Perl

Domain Nodelet^?

www.com | www.net | www.org

Node Status^?

node history
Node Type: note [id://1092573]
help

Chatterbox^?

How do I use this? • Last hour • Other CB clients

Other Users^?

Others browsing the Monastery: (4)

As of 2024-04-24 18:54 GMT

Sections^?

Information^?

Find Nodes^?

Leftovers^?

Today I Learned

Voting Booth^?

No recent polls found