forked from Lainports/opnsense-ports
5 lines
222 B
Text
5 lines
222 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: https://github.com/flori/amatch
|