forked from Lainports/freebsd-ports
using a dynamic programming algorithm to compute the Levenstein distance between strings. Written in C for speed. WWW: http://flori.github.io/amatch/ |
||
|---|---|---|
| .. | ||
| distinfo | ||
| Makefile | ||
| pkg-descr | ||
using a dynamic programming algorithm to compute the Levenstein distance between strings. Written in C for speed. WWW: http://flori.github.io/amatch/ |
||
|---|---|---|
| .. | ||
| distinfo | ||
| Makefile | ||
| pkg-descr | ||