4b310fd5a0
using a dynamic programming algorithm to compute the Levenstein distance between strings. Written in C for speed. WWW: http://flori.github.io/amatch/
5 lines
221 B
Text
5 lines
221 B
Text
This is a Ruby library for approximate string matching and searching
|
|
using a dynamic programming algorithm to compute the Levenstein
|
|
distance between strings. Written in C for speed.
|
|
|
|
WWW: http://flori.github.io/amatch/
|