levenshtein
Levenshtein distance algorithm for general array.
Description
Levenshtein distance algorithm for general array.
It provides:
- Levenshtein alrogithm by Wagner-Fischer algorithm: http://en.wikipedia.org/wiki/Wagner%E2%80%93Fischer_algorithm
- Correctness is tested comparing against a naive but more mathematical algorithm.
- Upperbound parameter to stop the comparision once the distance is found bigger than it.
- Memoisation cache to avoid repeating distance calculations.
- Functor to abstact the implementation of the array and cache.
- Ready-to-use String and StringWithHashtbl modules are provided.
Install
copied = false, 2000)"
:class="{ 'border-gray-700': !copied, 'text-gray-100': !copied, 'focus:ring-orange-500': !copied, 'focus:border-orange-500': !copied, 'border-green-600': copied, 'text-green-600': copied, 'focus:ring-green-500': copied, 'focus:border-green-500': copied }">
- Published
- 31 Aug 2014
- Authors
- Maintainers
Sources
Dependencies
Reverse Dependencies