[
https://issues.apache.org/jira/browse/LANG-591?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=12836585#action_12836585
]
Benson Margulies commented on LANG-591:
---------------------------------------
Henri,
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.
--benson
> 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.
