/usr/lib/swi-prolog/library/snowball.pl is in swi-prolog-nox 7.2.3+dfsg-6.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 | /* Part of SWI-Prolog
Author: Jan Wielemaker
E-mail: J.Wielemaker@vu.nl
WWW: http://www.swi-prolog.org
Copyright (C): 2010-2015, VU University, Amsterdam
This program is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public License
as published by the Free Software Foundation; either version 2
of the License, or (at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public
License along with this library; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
As a special exception, if you link this library with other files,
compiled with a Free Software compiler, to produce an executable, this
library does not by itself cause the resulting executable to be covered
by the GNU General Public License. This exception does not however
invalidate any other reasons why the executable file might be covered by
the GNU General Public License.
*/
:- module(snowball,
[ snowball/3, % +Algorithm, +In, -Out
snowball_current_algorithm/1 % ?algorithm
]).
:- use_module(library(sandbox)).
/** <module> The Snowball multi-lingual stemmer library
This module encapsulates "The C version of the libstemmer library" from
the Snowball project. This library provides stemmers in a variety of
languages. The interface to this library is very simple:
* snowball/3 stems a word with a given algorithm
* snowball_current_algorithm/1 enumerates the provided algorithms.
Here is an example:
==
?- snowball(english, walking, S).
S = walk.
==
@see http://snowball.tartarus.org/
*/
:- use_foreign_library(foreign(snowball)).
%% snowball(+Algorithm, +Input, -Stem) is det.
%
% Apply the Snowball Algorithm on Input and unify the result
% (an atom) with Stem.
%
% The implementation maintains a cache of stemmers for each thread
% that accesses snowball/3, providing high-perfomance and
% thread-safety without locking.
%
% @param Algorithm is the (english) name for desired algorithm
% or an 2 or 3 letter ISO 639 language code.
% @param Input is the word to be stemmed. It is either an
% atom, string or list of chars/codes. The library
% accepts Unicode characters. Input must be
% _lowercase_. See downcase_atom/2.
% @error domain_error(snowball_algorithm, Algorithm)
% @error type_error(atom, Algorithm)
% @error type_error(text, Input)
%% snowball_current_algorithm(?Algorithm) is nondet.
%
% True if Algorithm is the official name of an algorithm suported
% by snowball/3. The predicate is =semidet= if Algorithm is given.
term_expansion(snowball_current_algorithm(dummy), Clauses) :-
snowball_algorithms(Algos),
maplist(wrap, Algos, Clauses).
wrap(X, snowball_current_algorithm(X)).
snowball_current_algorithm(dummy).
:- multifile
sandbox:safe_primitive/1.
sandbox:safe_primitive(snowball:snowball(_,_,_)).
|