aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorTeodor Sigaev <teodor@sigaev.ru>2015-09-07 15:21:44 +0300
committerTeodor Sigaev <teodor@sigaev.ru>2015-09-07 15:21:44 +0300
commit1e0309465bfdf67dcb8ed0597c3aa1257582f14e (patch)
tree57b15f901b9781bd0dcc9bf6bbbc8e26640275d3
parentb17ce6208363470d753503f9430d21ecc898cc79 (diff)
downloadpostgresql-1e0309465bfdf67dcb8ed0597c3aa1257582f14e.tar.gz
postgresql-1e0309465bfdf67dcb8ed0597c3aa1257582f14e.zip
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 0bc7e7b41c7..e0dc0d74c5c 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</>