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
|
/*
* 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 Translator {
constructor(paths, callback) {
this.dictionary = new Dictionary();
this.deinflector = new Deinflector();
const loaders = [];
for (const key of ['rules', 'edict', 'enamdict', 'kanjidic']) {
loaders.push(
$.getJSON(chrome.extension.getURL(paths[key]))
);
}
$.when.apply($, loaders).done((rules, edict, enamdict, kanjidic) => {
this.deinflector.setRules(rules[0]);
this.dictionary.addTermDict(edict[0]);
this.dictionary.addTermDict(enamdict[0]);
this.dictionary.addKanjiDict(kanjidic[0]);
this.initialized = true;
if (callback) {
callback();
}
});
}
findTerm(text) {
const groups = {};
for (let i = text.length; i > 0; --i) {
const term = text.slice(0, i);
const dfs = this.deinflector.deinflect(term, t => {
const tags = [];
for (const d of this.dictionary.findTerm(t)) {
tags.push(d.tags);
}
return tags;
});
if (dfs === null) {
this.processTerm(groups, term);
} else {
for (const df of dfs) {
this.processTerm(groups, df.source, df.rules, df.root);
}
}
}
let results = [];
for (const key in groups) {
results.push(groups[key]);
}
results = results.sort(this.resultSorter);
let length = 0;
for (const result of results) {
length = Math.max(length, result.source.length);
}
return {results: results, length: length};
}
findKanji(text) {
let results = [];
const processed = {};
for (const c of text) {
if (!processed.has(c)) {
results = results.concat(this.dictionary.findKanji(c));
processed[c] = true;
}
}
return results;
}
processTerm(groups, source, rules=[], root='') {
for (const entry of this.dictionary.findTerm(root || source)) {
groups[entry.id] = {
expression: entry.expression,
reading: entry.reading,
glossary: entry.glossary,
tags: entry.tags,
source: source,
rules: rules
};
}
}
resultSorter(v1, v2) {
const sl1 = v1.source.length;
const sl2 = v2.source.length;
if (sl1 > sl2) {
return 1;
} else if (sl1 > sl2) {
return -1;
}
const p1 = v1.tags.indexOf('P') >= 0;
const p2 = v2.tags.indexOf('P') >= 0;
if (p1 && !p2) {
return 1;
} else if (!p1 && p2) {
return -1;
}
const rl1 = v1.rules.length;
const rl2 = v2.rules.length;
if (rl1 < rl2) {
return 1;
} else if (rl2 > rl1) {
return -1;
}
return 0;
}
}
|