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
|
/***********************************************************************
Moses - statistical machine translation system
Copyright (C) 2006-2011 University of Edinburgh
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 of the License, or (at your option) any later version.
This library 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
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with this library; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
***********************************************************************/
#include "Alignment.h"
#include "syntax-common/exception.h"
#include <algorithm>
#include <cassert>
#include <cstdlib>
namespace MosesTraining
{
namespace GHKM
{
void ReadAlignment(const std::string &s, Alignment &a)
{
const std::string digits = "0123456789";
a.clear();
std::string::size_type begin = 0;
while (true) {
std::string::size_type end = s.find("-", begin);
if (end == std::string::npos) {
return;
}
int src = std::atoi(s.substr(begin, end-begin).c_str());
if (end+1 == s.size()) {
throw Syntax::Exception("Target index missing");
}
begin = end+1;
end = s.find_first_not_of(digits, begin+1);
int tgt;
if (end == std::string::npos) {
tgt = std::atoi(s.substr(begin).c_str());
a.push_back(std::make_pair(src, tgt));
return;
} else {
tgt = std::atoi(s.substr(begin, end-begin).c_str());
a.push_back(std::make_pair(src, tgt));
}
begin = end+1;
}
}
void FlipAlignment(Alignment &a)
{
for (Alignment::iterator p = a.begin(); p != a.end(); ++p) {
std::swap(p->first, p->second);
}
}
} // namespace GHKM
} // namespace MosesTraining
|
