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
|
/*
* Copyright (C) 2016 Alex Yatskov <alex@foosoft.net>
* Author: Alex Yatskov <alex@foosoft.net>
*
* 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 3 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 program. If not, see <http://www.gnu.org/licenses/>.
*/
class Deinflection {
constructor(term, tags=[], rule='') {
this.children = [];
this.term = term;
this.tags = tags;
this.rule = rule;
this.success = false;
}
validate(validator) {
for (const tags of validator(this.term)) {
if (this.tags.length === 0) {
return true;
}
for (const tag in this.tags) {
if (this.searchTags(tag, tags)) {
return true;
}
}
}
return false;
}
deinflect(validator, rules) {
if (this.validate(validator)) {
const child = new Deinflection(this.term);
this.children.push(child);
}
for (const [rule, variants] of rules) {
for (const variant of variants) {
const tagsIn = variant.tagsIn;
const tagsOut = variant.tagsOut;
const kanaIn = variant.kanaIn;
const kanaOut = variant.kanaOut;
let allowed = this.tags.length === 0;
for (const tag in this.tags) {
if (this.searchTags(tag, tagsIn)) {
allowed = true;
break;
}
}
// FIX
// if (!allowed || !this.term.endswith(kanaIn)) {
// continue;
// }
// FIX
// const term = self.term[:-kanaIn.length] + kanaOut;
// const child = new Deinflection(term, tagsOut, rule);
// if (child.deinflect(validator, rules)) {
// this.children.append(child);
// }
}
}
return this.children.length > 0;
}
searchTags(tag, tags) {
for (const t of tags) {
// FIX
if (re.search(tag, t)) {
return true;
}
}
return false;
}
gather() {
if (this.children.length === 0) {
return [{root: this.term, rules: []}];
}
const paths = [];
for (const child of this.children) {
for (const path in child.gather()) {
if (this.rule.length > 0) {
path.rules.append(this.rule);
}
path.source = this.term;
paths.push(path);
}
}
return paths;
}
}
class Deinflector {
constructor() {
this.rules = {};
}
setRules(rules) {
this.rules = rules;
}
deinflect(term, validator) {
const node = new Deinflection(term)
if (node.deinflect(validator, this.rules)) {
return node.gather();
}
return null;
}
}
|