GitHub user jontejj opened a pull request: https://github.com/apache/commons-lang/pull/118
Optimization of getLevenshteinDistance with a threshold If the string lengths differ more than the threshold, there's no need for the algoritm to begin allocating arrays etc. You can merge this pull request into a Git repository by running: $ git pull https://github.com/jontejj/commons-lang master Alternatively you can review and apply these changes as the patch at: https://github.com/apache/commons-lang/pull/118.patch To close this pull request, make a commit to your master/trunk branch with (at least) the following in the commit message: This closes #118 ---- commit 29eb271b133b40295fb798545f30b3b4f5b0080c Author: Jonatan Jönsson <jont...@gmail.com> Date: 2015-11-26T09:23:15Z Optimization of getLevenshteinDistance with a threshold If the string lengths differ more than the threshold, there's no need for the algoritm to begin allocating arrays etc. ---- --- If your project is set up for it, you can reply to this email and have your reply appear on GitHub as well. If your project does not have this feature enabled and wishes so, or if the feature is enabled but not working, please contact infrastructure at infrastruct...@apache.org or file a JIRA ticket with INFRA. ---