summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorTeodor Sigaev <teodor@sigaev.ru>2015-09-07 15:20:45 +0300
committerTeodor Sigaev <teodor@sigaev.ru>2015-09-07 15:20:45 +0300
commita1c44e1af62f7247610ee80bb355ef7084c24001 (patch)
treea1e3f0f2fdbfdf8a614f344b7bc542981756d308
parent03543afe1529b437e2f6861eab15f9d71debdba7 (diff)
Update site address of Snowball project
-rw-r--r--doc/src/sgml/textsearch.sgml2
1 files changed, 1 insertions, 1 deletions
diff --git a/doc/src/sgml/textsearch.sgml b/doc/src/sgml/textsearch.sgml
index b1c669fb915..ab08eb912ff 100644
--- a/doc/src/sgml/textsearch.sgml
+++ b/doc/src/sgml/textsearch.sgml
@@ -2681,7 +2681,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</>