commons-issues mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Benedikt Ritter (JIRA)" <>
Subject [jira] [Commented] (LANG-591) A more complex Levenshtein distance would be useful
Date Sun, 26 Oct 2014 09:44:33 GMT


Benedikt Ritter commented on LANG-591:

Currently we only have the Levenshtein and Jaro-Winkler algorithms implemented. We put them
into StringUtils, since it felt like the natural place for them. Now with more and more algorithms
been discussed for inclusion, we should at least consider a specific class for this. But I'd
rather like to see a new component for this.

[~kinow]: Every committer may start a new sandbox component to try out things. If you like
to experiment, just bring this up on the ML. I'm interested in helping you.

> 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: 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

View raw message