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