Description
Levenshtein distance algorithm for general array.
The library provides functors to compute Levenshtein editing distances over array like structures.
Published: 17 Jan 2018
Dependencies (4)
-
ocaml-migrate-parsetree
< "2.0.0"
-
ppx_test
>= "1.6.0"
-
jbuilder
>= "1.0+beta7"
-
ocaml
>= "4.02.1"
Reverse Dependencies
-
None
Conflicts
-
None
Levenshtein distance algorithm for general array
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 }">
Authors
Maintainers
Sources
ocaml_levenshtein-1.1.3.tar.bz2
md5=6f9b85c87402ef3fd36e466e5b11cbe3