summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorTeodor Sigaev2015-09-07 12:22:18 +0000
committerTeodor Sigaev2015-09-07 12:22:18 +0000
commite3fa55d14324677391e9c1ff6342e6ffa7d560b0 (patch)
tree20ec849e20a49850610d951d8ed3cf318fbffe43
parent07cef3eb8a621690ff5e1a1d576656284957caf1 (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 53e2fe2754f..bb93c06777d 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</>