2005-11-26 00:31:36 +00:00

7 lines
257 B
Plaintext

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.
Author: Florian Frank <flori@ping.de>
WWW: http://amatch.rubyforge.org/