1
|
|
|
# -*- coding: utf-8 -*- |
2
|
|
|
|
3
|
|
|
# Copyright 2014-2018 by Christopher C. Little. |
4
|
|
|
# This file is part of Abydos. |
5
|
|
|
# |
6
|
|
|
# Abydos is free software: you can redistribute it and/or modify |
7
|
|
|
# it under the terms of the GNU General Public License as published by |
8
|
|
|
# the Free Software Foundation, either version 3 of the License, or |
9
|
|
|
# (at your option) any later version. |
10
|
|
|
# |
11
|
|
|
# Abydos is distributed in the hope that it will be useful, |
12
|
|
|
# but WITHOUT ANY WARRANTY; without even the implied warranty of |
13
|
|
|
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
14
|
|
|
# GNU General Public License for more details. |
15
|
|
|
# |
16
|
|
|
# You should have received a copy of the GNU General Public License |
17
|
|
|
# along with Abydos. If not, see <http://www.gnu.org/licenses/>. |
18
|
|
|
|
19
|
1 |
|
"""abydos.stemmer._snowball_swedish. |
20
|
|
|
|
21
|
|
|
Snowball Swedish stemmer |
22
|
|
|
""" |
23
|
|
|
|
24
|
1 |
|
from __future__ import ( |
25
|
|
|
absolute_import, |
26
|
|
|
division, |
27
|
|
|
print_function, |
28
|
|
|
unicode_literals, |
29
|
|
|
) |
30
|
|
|
|
31
|
1 |
|
from unicodedata import normalize |
32
|
|
|
|
33
|
1 |
|
from six import text_type |
34
|
|
|
|
35
|
1 |
|
from ._snowball import _Snowball |
36
|
|
|
|
37
|
1 |
|
__all__ = ['SnowballSwedish', 'sb_swedish'] |
38
|
|
|
|
39
|
|
|
|
40
|
1 |
|
class SnowballSwedish(_Snowball): |
|
|
|
|
41
|
|
|
"""Snowball Swedish stemmer. |
42
|
|
|
|
43
|
|
|
The Snowball Swedish stemmer is defined at: |
44
|
|
|
http://snowball.tartarus.org/algorithms/swedish/stemmer.html |
45
|
|
|
""" |
46
|
|
|
|
47
|
1 |
|
_vowels = {'a', 'e', 'i', 'o', 'u', 'y', 'ä', 'å', 'ö'} |
48
|
1 |
|
_s_endings = { |
49
|
|
|
'b', |
50
|
|
|
'c', |
51
|
|
|
'd', |
52
|
|
|
'f', |
53
|
|
|
'g', |
54
|
|
|
'h', |
55
|
|
|
'j', |
56
|
|
|
'k', |
57
|
|
|
'l', |
58
|
|
|
'm', |
59
|
|
|
'n', |
60
|
|
|
'o', |
61
|
|
|
'p', |
62
|
|
|
'r', |
63
|
|
|
't', |
64
|
|
|
'v', |
65
|
|
|
'y', |
66
|
|
|
} |
67
|
|
|
|
68
|
1 |
|
def stem(self, word): |
|
|
|
|
69
|
|
|
"""Return Snowball Swedish stem. |
70
|
|
|
|
71
|
|
|
Parameters |
72
|
|
|
---------- |
73
|
|
|
word : str |
74
|
|
|
The word to stem |
75
|
|
|
|
76
|
|
|
Returns |
77
|
|
|
------- |
78
|
|
|
str |
79
|
|
|
Word stem |
80
|
|
|
|
81
|
|
|
Examples |
82
|
|
|
-------- |
83
|
|
|
>>> stmr = SnowballSwedish() |
84
|
|
|
>>> stmr.stem('undervisa') |
85
|
|
|
'undervis' |
86
|
|
|
>>> stmr.stem('suspension') |
87
|
|
|
'suspension' |
88
|
|
|
>>> stmr.stem('visshet') |
89
|
|
|
'viss' |
90
|
|
|
|
91
|
|
|
""" |
92
|
|
|
# lowercase, normalize, and compose |
93
|
1 |
|
word = normalize('NFC', text_type(word.lower())) |
94
|
|
|
|
95
|
1 |
|
r1_start = min(max(3, self._sb_r1(word)), len(word)) |
96
|
|
|
|
97
|
|
|
# Step 1 |
98
|
1 |
|
_r1 = word[r1_start:] |
99
|
1 |
View Code Duplication |
if _r1[-7:] == 'heterna': |
|
|
|
|
100
|
1 |
|
word = word[:-7] |
101
|
1 |
|
elif _r1[-6:] == 'hetens': |
102
|
1 |
|
word = word[:-6] |
103
|
1 |
|
elif _r1[-5:] in { |
104
|
|
|
'anden', |
|
|
|
|
105
|
|
|
'heten', |
|
|
|
|
106
|
|
|
'heter', |
|
|
|
|
107
|
|
|
'arnas', |
|
|
|
|
108
|
|
|
'ernas', |
|
|
|
|
109
|
|
|
'ornas', |
|
|
|
|
110
|
|
|
'andes', |
|
|
|
|
111
|
|
|
'arens', |
|
|
|
|
112
|
|
|
'andet', |
|
|
|
|
113
|
|
|
}: |
114
|
1 |
|
word = word[:-5] |
115
|
1 |
|
elif _r1[-4:] in { |
116
|
|
|
'arna', |
|
|
|
|
117
|
|
|
'erna', |
|
|
|
|
118
|
|
|
'orna', |
|
|
|
|
119
|
|
|
'ande', |
|
|
|
|
120
|
|
|
'arne', |
|
|
|
|
121
|
|
|
'aste', |
|
|
|
|
122
|
|
|
'aren', |
|
|
|
|
123
|
|
|
'ades', |
|
|
|
|
124
|
|
|
'erns', |
|
|
|
|
125
|
|
|
}: |
126
|
1 |
|
word = word[:-4] |
127
|
1 |
|
elif _r1[-3:] in {'ade', 'are', 'ern', 'ens', 'het', 'ast'}: |
128
|
1 |
|
word = word[:-3] |
129
|
1 |
|
elif _r1[-2:] in {'ad', 'en', 'ar', 'er', 'or', 'as', 'es', 'at'}: |
130
|
1 |
|
word = word[:-2] |
131
|
1 |
|
elif _r1[-1:] in {'a', 'e'}: |
132
|
1 |
|
word = word[:-1] |
133
|
1 |
|
elif _r1[-1:] == 's': |
134
|
1 |
|
if len(word) > 1 and word[-2] in self._s_endings: |
135
|
1 |
|
word = word[:-1] |
136
|
|
|
|
137
|
|
|
# Step 2 |
138
|
1 |
|
if word[r1_start:][-2:] in {'dd', 'gd', 'nn', 'dt', 'gt', 'kt', 'tt'}: |
139
|
1 |
|
word = word[:-1] |
140
|
|
|
|
141
|
|
|
# Step 3 |
142
|
1 |
|
_r1 = word[r1_start:] |
143
|
1 |
|
if _r1[-5:] == 'fullt': |
144
|
1 |
|
word = word[:-1] |
145
|
1 |
|
elif _r1[-4:] == 'löst': |
146
|
1 |
|
word = word[:-1] |
147
|
1 |
|
elif _r1[-3:] in {'lig', 'els'}: |
148
|
1 |
|
word = word[:-3] |
149
|
1 |
|
elif _r1[-2:] == 'ig': |
150
|
1 |
|
word = word[:-2] |
151
|
|
|
|
152
|
1 |
|
return word |
153
|
|
|
|
154
|
|
|
|
155
|
1 |
|
def sb_swedish(word): |
156
|
|
|
"""Return Snowball Swedish stem. |
157
|
|
|
|
158
|
|
|
This is a wrapper for :py:meth:`SnowballSwedish.stem`. |
159
|
|
|
|
160
|
|
|
Parameters |
161
|
|
|
---------- |
162
|
|
|
word : str |
163
|
|
|
The word to stem |
164
|
|
|
|
165
|
|
|
Returns |
166
|
|
|
------- |
167
|
|
|
str |
168
|
|
|
Word stem |
169
|
|
|
|
170
|
|
|
Examples |
171
|
|
|
-------- |
172
|
|
|
>>> sb_swedish('undervisa') |
173
|
|
|
'undervis' |
174
|
|
|
>>> sb_swedish('suspension') |
175
|
|
|
'suspension' |
176
|
|
|
>>> sb_swedish('visshet') |
177
|
|
|
'viss' |
178
|
|
|
|
179
|
|
|
""" |
180
|
1 |
|
return SnowballSwedish().stem(word) |
181
|
|
|
|
182
|
|
|
|
183
|
|
|
if __name__ == '__main__': |
184
|
|
|
import doctest |
185
|
|
|
|
186
|
|
|
doctest.testmod() |
187
|
|
|
|