-
Notifications
You must be signed in to change notification settings - Fork 1
/
porter2_stemmer.h
90 lines (64 loc) · 2.52 KB
/
porter2_stemmer.h
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
/**
* @file porter2_stemmer.h
* @author Sean Massung
* @date September 2012
*
* Implementation of
* http://snowball.tartarus.org/algorithms/english/stemmer.html
*
* Copyright (C) 2012 Sean Massung
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in
* all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
* SOFTWARE.
*/
#ifndef _PORTER2_STEMMER_H_
#define _PORTER2_STEMMER_H_
#include <vector>
#include <string>
namespace Porter2Stemmer
{
void stem(std::string& word);
void stem(int word);
void trim(std::string& word);
namespace internal
{
size_t firstNonVowelAfterVowel(const std::string& word, size_t start);
size_t getStartR1(const std::string& word);
size_t getStartR2(const std::string& word, size_t startR1);
void changeY(std::string& word);
void step0(std::string& word);
bool step1A(std::string& word);
void step1B(std::string& word, size_t startR1);
void step1C(std::string& word);
void step2(std::string& word, size_t startR1);
void step3(std::string& word, size_t startR1, size_t startR2);
void step4(std::string& word, size_t startR2);
void step5(std::string& word, size_t startR1, size_t startR2);
inline bool isShort(const std::string& word);
bool special(std::string& word);
bool isVowel(char ch);
bool isVowelY(char ch);
bool endsWith(const std::string& word, const std::string& str);
bool endsInDouble(const std::string& word);
bool replaceIfExists(std::string& word, const std::string& suffix,
const std::string& replacement, size_t start);
bool isValidLIEnding(char ch);
bool containsVowel(const std::string& word, size_t start, size_t end);
}
}
#endif