commons-issues mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Benson Margulies (JIRA)" <>
Subject [jira] Commented: (LANG-591) A more complex Levenshtein distance would be useful
Date Mon, 08 Feb 2010 13:00:27 GMT


Benson Margulies commented on LANG-591:


There's a thread-safety issue here. The choices are:

1) an API that takes the strings in and returns a new results object. I object to this on
performance grounds.
2) a separate Levenshtein object that takes two strings and then returns all the various results
via get accessors (no result object).
3) an API like the one I put in the patch.

I think that #2 is the best choice, but I'd like to be on the same page as you before I diddle


> A more complex Levenshtein distance would be useful
> ---------------------------------------------------
>                 Key: LANG-591
>                 URL:
>             Project: Commons Lang
>          Issue Type: New Feature
>          Components: lang.*
>    Affects Versions: 3.0
>            Reporter: Benson Margulies
>         Attachments: LANG-591.diff
> For some applications, it is necessary to get insert/delete/substitution counts from
the distance algorithm. I am attaching a patch that provides this.

This message is automatically generated by JIRA.
You can reply to this email to add a comment to the issue online.

View raw message