K 10
svn:author
V 6
dinoex
K 8
svn:date
V 27
2014-09-21T15:13:07.238330Z
K 7
svn:log
V 221
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/

END