GitHub user luciano-medallia opened a pull request:
https://github.com/apache/commons-text/pull/85
Add optimization to limited levenshtein distance
When the length difference exceeds the threshold, we can return -1
immediately skipping the algorithm. The reason is that the length difference is
a lower bound of the unit-cost Levenshtein distance.
You can merge this pull request into a Git repository by running:
$ git pull https://github.com/luciano-medallia/commons-text master
Alternatively you can review and apply these changes as the patch at:
https://github.com/apache/commons-text/pull/85.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 #85
----
commit 6b85ebeb0bb999d3dc158c4afb0f8ae4c6eeacac
Author: Luciano Quintabani <lquintabani@...>
Date: 2018-07-15T20:10:51Z
Add optimization to limited levenshtein distance
----
---
---------------------------------------------------------------------
To unsubscribe, e-mail: dev-unsubscr...@commons.apache.org
For additional commands, e-mail: dev-h...@commons.apache.org
