: Bruno P. Kinoshita
To: don jeba ; Commons Developers List
Sent: Tuesday, 8 November 2016 12:52 PM
Subject: Re: [TEXT] TEXT-10 A more complex Levenshtein distance
Hi Don,
I spent some time yesterday playing with the current code in [text], trying to
count delete/insert/substitutions [1
ithub.com/kinow/commons-text/tree/WIP-led2
>
> From: don jeba
>To: Commons Developers List ; Bruno P. Kinoshita
>
>Sent: Monday, 7 November 2016 5:57 PM
>Subject: Re: [TEXT] TEXT-10 A more complex Levenshtein distance
>
>
>
>Hi Bruno,
&g
let me know if i am not clear in the above.
Thank you,
Regards,Don Jeba.
From: don jeba
To: Commons Developers List ; Bruno P. Kinoshita
Sent: Tuesday, 25 October 2016 9:15 PM
Subject: Re: [TEXT] TEXT-10 A more complex Levenshtein distance
Hi Bruno, Now the comment on fo
instead of 2D array, I think it should be possible. I
will also give a try.
Thank you,
Regards,Don Jeba.
From: Bruno P. Kinoshita
To: Commons Developers List ; don jeba
Sent: Monday, 24 October 2016 8:15 AM
Subject: Re: [TEXT] TEXT-10 A more complex Levenshtein distance
Hi Don
re it is working :)
Cheers
Bruno
>
> From: don jeba
>To: Commons Developers List ; Bruno P. Kinoshita
>
>Sent: Monday, 17 October 2016 11:44 PM
>Subject: Re: [TEXT] TEXT-10 A more complex Levenshtein distance
>
>
>Hi Bruno,
>Th
whether its an insertion or deletion or substitution.
Considering this I have used 2 dimensional array.
Regards,
Don Jeba.
From: Bruno P. Kinoshita
To: Commons Developers List ; don jeba
Sent: Monday, 17 October 2016 7:37 AM
Subject: Re: [TEXT] TEXT-10 A more complex Levenshtein distance
Hi Don Jeba,
I will have a look at your implementation to compare with a recent improvement
in [lang]
https://github.com/apache/commons-lang/blob/78134f6b3f1facd019e604d2cd000c4ce7cf9a0a/src/main/java/org/apache/commons/lang3/StringUtils.java#L7710
Instead of keeping a matrix (or even only two
