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

Posted to issues@commons.apache.org by "Pascal Schumacher (JIRA)" <ji...@apache.org> on 2016/05/28 16:19:13 UTC

[jira] [Closed] (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 ]

Pascal Schumacher closed LANG-591.
----------------------------------

> 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
>             Fix For: Review Patch
>
>         Attachments: LANG-591.patch
>
>
> 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 was sent by Atlassian JIRA
(v6.3.4#6332)