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
|
/*
Ousía
Copyright (C) 2014 Benjamin Paaßen, Andreas Stöckel
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/>.
*/
#include "Tokenizer.hpp"
namespace ousia {
namespace utils {
static std::map<char, TokenTreeNode> buildChildren(
const std::map<std::string, int> &inputs)
{
std::map<char, TokenTreeNode> children;
std::map<char, std::map<std::string, int>> nexts;
for (auto &e : inputs) {
const std::string &s = e.first;
const int id = e.second;
if (s.empty()) {
continue;
}
char start = s[0];
const std::string suffix = s.substr(1);
if (nexts.find(start) != nexts.end()) {
nexts[start].insert(std::make_pair(suffix, id));
} else {
nexts.insert(std::make_pair(
start, std::map<std::string, int>{{suffix, id}}));
}
}
for (auto &n : nexts) {
children.insert(std::make_pair(n.first, TokenTreeNode{n.second}));
}
return children;
}
static int buildId(const std::map<std::string, int> &inputs)
{
int tokenId = -1;
for (auto &e : inputs) {
if (e.first.empty()) {
if (tokenId != -1) {
throw TokenizerException{std::string{"Ambigous token found: "} +
std::to_string(e.second)};
} else {
tokenId = e.second;
}
}
}
return tokenId;
}
TokenTreeNode::TokenTreeNode(const std::map<std::string, int> &inputs)
: children(buildChildren(inputs)), tokenId(buildId(inputs))
{
}
}
}
|
