aboutsummaryrefslogtreecommitdiff
path: root/textproc/ruby-amatch
diff options
context:
space:
mode:
authorAkinori MUSHA <knu@FreeBSD.org>2002-12-07 17:41:58 +0000
committerAkinori MUSHA <knu@FreeBSD.org>2002-12-07 17:41:58 +0000
commit4929e866532349f56356600999e744fa91efd469 (patch)
treed8326fc12b1e967bc417d8416ac45de00401c186 /textproc/ruby-amatch
parente8515da24e93d810b69f75dd3ce17dea658a4233 (diff)
downloadports-4929e866532349f56356600999e744fa91efd469.tar.gz
ports-4929e866532349f56356600999e744fa91efd469.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 f7d86b4c1ece..9fad70933afb 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://www.ruby-lang.org/en/raa-list.rhtml?name=amatch
+WWW: http://www.ruby-lang.org/raa/list.rhtml?name=amatch