commons-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From don jeba <>
Subject Re: [TEXT] TEXT-10 A more complex Levenshtein distance
Date Mon, 17 Oct 2016 10:44:29 GMT
Hi Bruno,
Thank you for the review.
The one in lang gets only the distance (insert+delete+substitute). To get the individual
values, (my understanding is), I need to iterate the diagonal elements in matrix, also need
to know the elements at the left and top of the diagonal element to find whether its an insertion
or deletion or substitution. Considering this I have used 2 dimensional array.
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]

Instead of keeping a matrix (or even only two rows) the current version in StringUtils keeps
just one array and a couple of helper temporary variables.

Not sure if we can re-use it, adding the new features in TEXT-10 (i.e. insert/delete/substitution
counts), but if possible that'd be better.


----- Original Message -----
> From: don jeba <>
> To: Commons Developers List <>
> Sent: Monday, 17 October 2016 1:51 AM
> Subject: [TEXT] TEXT-10 A more complex Levenshtein distance
> Hello,        I am new to open source contribution.
> Lately I gave a pull request to common-text. I dont know whether I am missing 
> any procedure to contribute to common-text. Kindly correct me so that I can do 
> the necessary so that someone will review and comment on my code.
> Jira TEXT-10
> Kindly advise.
> Thank you,
> Regards,Don Jeba.

To unsubscribe, e-mail:
For additional commands, e-mail:

  • Unnamed multipart/alternative (inline, None, 0 bytes)
View raw message