diff --git a/doc/src/sgml/textsearch.sgml b/doc/src/sgml/textsearch.sgml
index 12e07eda2fde4b093e59a3d3da04ff6e19cc18eb..d55954a0a5d5c491a717819810a7089b6ee6d37b 100644
--- a/doc/src/sgml/textsearch.sgml
+++ b/doc/src/sgml/textsearch.sgml
@@ -2703,7 +2703,7 @@ SELECT ts_lexize('norwegian_ispell', 'sjokoladefabrikk');
     The <application>Snowball</> dictionary template is based on a project
     by Martin Porter, inventor of the popular Porter's stemming algorithm
     for the English language.  Snowball now provides stemming algorithms for
-    many languages (see the <ulink url="http://snowball.tartarus.org">Snowball
+    many languages (see the <ulink url="http://snowballstem.org/">Snowball
     site</ulink> for more information).  Each algorithm understands how to
     reduce common variant forms of words to a base, or stem, spelling within
     its language.  A Snowball dictionary requires a <literal>language</>