You are viewing a plain text version of this content. The canonical link for it is here.

Posted to issues@commons.apache.org by "Benson Margulies (JIRA)" <ji...@apache.org> on 2010/02/08 02:55:28 UTC

[jira] Updated: (LANG-591) A more complex Levenshtein distance would be useful

     [ https://issues.apache.org/jira/browse/LANG-591?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ]

Benson Margulies updated LANG-591:
----------------------------------

    Attachment: LANG-591.diff

Patch.

> A more complex Levenshtein distance would be useful
> ---------------------------------------------------
>
>                 Key: LANG-591
>                 URL: https://issues.apache.org/jira/browse/LANG-591
>             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.