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 Tue, 20 Jul 2010 21:16:49 GMT


Benson Margulies commented on LANG-591:

Sorry about the setters, I lost focus.

At the end of the day, there's only one LD algorithm, however different the particular version.
However, I do have a field in this class to avoid new'ing a new grid each time. Wouldn't that
be a bit ugly in StringUtils?

> 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
>             Fix For: 3.1
>         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