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, 22 Feb 2010 11:36:27 GMT


Benson Margulies commented on LANG-591:


I've spent too much time fixing things that allocate objects in a tight loop, and I think
it's gone to my brain. I can't really claim that, in this case, anyone is all that likely
to be running this 1,000,000,000 times in a loop.

So if you think that choice 1 is the natural alternative, I'll do it. 

Would you like the 'diff' algorithm while I'm at it (longest common subsequence)? I ended
up coding one of them, too.


> 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