how to get a matching status of two string using Levenshtein distance

Asked Apr 07 '14 at 12:56

Active Apr 07 '14 at 12:58

Viewed 36 times

is it possible to get a matching status from two compared strings, for example:

string 1 : this is a dog.
string 2 : this is not a cat.

How do I generate the below string using Levenshtein distance, could anybody help?

string 1 : this is     a    dog.
string 2 : this is not a cat   .
Result   : ========++++==+++---=   <<< like this.

I know a post has the solution that is what I need, but I have no permission to access the source code. Could anybody help please,any comments are appreciate.

edited Apr 07 '14 at 12:58

Adrian Wragg

7,311
3
26
50

asked Apr 07 '14 at 12:56

Shen Guow Lee

So what's your question? Someone to copy & paste that code as answer? Someone to write that code as answer? – Adriano Repetti Apr 07 '14 at 12:58
yes, sure! if possible, you can paste the code for me, I need the code, I would appreciate. – Shen Guow Lee May 28 '14 at 14:12

how to get a matching status of two string using Levenshtein distance

0 Answers0