aboutsummaryrefslogtreecommitdiff
path: root/textproc/ruby-amatch
diff options
context:
space:
mode:
authorSunpoet Po-Chuan Hsieh <sunpoet@FreeBSD.org>2013-08-29 04:10:37 +0000
committerSunpoet Po-Chuan Hsieh <sunpoet@FreeBSD.org>2013-08-29 04:10:37 +0000
commit9e12ae1e0fa9524ea7c5932d844b1d32b6733497 (patch)
tree3f481ab2fe1d8f16708b7216c8bcdee7a6bacec7 /textproc/ruby-amatch
parentab64603225435568e77bc6b4c67e12b8f224235b (diff)
downloadports-9e12ae1e0fa9524ea7c5932d844b1d32b6733497.tar.gz
ports-9e12ae1e0fa9524ea7c5932d844b1d32b6733497.zip
Notes
Diffstat (limited to 'textproc/ruby-amatch')
-rw-r--r--textproc/ruby-amatch/pkg-descr2
1 files changed, 1 insertions, 1 deletions
diff --git a/textproc/ruby-amatch/pkg-descr b/textproc/ruby-amatch/pkg-descr
index d50f932cf4e2..61b4e509d1b9 100644
--- a/textproc/ruby-amatch/pkg-descr
+++ b/textproc/ruby-amatch/pkg-descr
@@ -3,4 +3,4 @@ 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/
+WWW: http://amatch.rubyforge.org/