using a dynamic programming algorithm to compute the Levenstein distance between strings. Written in C for speed. WWW: http://flori.github.io/amatch/
3 lines
141 B
Plaintext
3 lines
141 B
Plaintext
SHA256 (rubygem/amatch-0.3.0.gem) = 669bac06769ab21d2fbd87839b5aa1b1d9e0eb39971b4404fe88de103685f45d
|
|
SIZE (rubygem/amatch-0.3.0.gem) = 28672
|