forked from apertium/apertium-lex-tools
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathtagger_output_processor.cc
142 lines (125 loc) · 2.54 KB
/
tagger_output_processor.cc
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
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
#include "tagger_output_processor.h"
TaggerOutputProcessor::TaggerOutputProcessor() {
this->sn = 0;
LtLocale::tryToSetLocale();
}
TaggerOutputProcessor::~TaggerOutputProcessor() {
}
int TaggerOutputProcessor::find(vector<wstring> xs, wstring x) {
for (int i = 0; i < xs.size(); i++) {
if (xs[i] == x)
return i;
}
return -1;
}
TaggerToken TaggerOutputProcessor::parseTaggerToken(wstring str) {
TaggerToken token;
int state = 0; // lemma;
wstring buffer;
wchar_t c;
for (int i = 0; i < str.size(); i++) {
c = str[i];
if(c == L'<' && state == 0) {
state = 1;
token.lemma = buffer;
buffer.clear();
}
if (c == L'>') {
token.tags.push_back(buffer);
buffer.clear();
} else if (c != L'<') {
buffer += c;
}
}
if(state == 0) {
token.lemma = buffer;
}
return token;
}
vector<wstring> TaggerOutputProcessor::parseTags(wstring token) {
int state = 0; // outside
vector<wstring> tags;
wstring buffer;
for(int i = 0; i < token.size(); i++) {
wchar_t c = token[i];
if (state == 0) {
if (c == '<') {
state = 1;
}
} else if (state == 1) {
if (c == '>') {
tags.push_back(buffer);
buffer = L"";
state = 0;
} else {
buffer += c;
}
}
}
return tags;
}
vector<wstring> TaggerOutputProcessor::wsplit(wstring wstr, wchar_t delim) {
vector<wstring> tokens;
wstring buffer;
for(int i = 0; i < wstr.size(); i++) {
if(wstr[i] == delim && (i == 0 || wstr[i-1] != L'\\')) {
tokens.push_back(buffer);
buffer = L"";
} else {
buffer += wstr[i];
}
}
if(buffer != L"") {
tokens.push_back(buffer);
}
return tokens;
}
wstring TaggerOutputProcessor::getLemma(wstring token) {
wstring buffer;
for(int i = 0; i < token.size(); i++) {
if(token[i] != '<') {
buffer += token[i];
} else {
break;
}
}
return buffer;
}
void TaggerOutputProcessor::processTaggerOutput() {
wstring buffer;
vector<TaggerToken> sentence;
bool escaped = false;
int state = 0; // outside
wchar_t c;
while((c = fgetwc(stdin))) {
if (c == -1) {
break;
}
if(c == L'\n') {
processSentence(sentence);
sentence.clear();
buffer.clear();
}
if (state == 0) {
if (c == '^' && !escaped) {
state = 1; // inside
} else if (c == '\\' && !escaped) {
escaped = true;
} else {
escaped = false;
}
} else if (state == 1) {
if(c == L'$' && !escaped) {
sentence.push_back(parseTaggerToken(buffer));
buffer = L"";
state = 0;
} else if (c == '\\' && !escaped) {
escaped = true;
buffer += c;
} else {
buffer += c;
escaped = false;
}
}
}
}