File size: 3,910 Bytes
1747e32 | 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 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 | // -*- c++ -*-
// Parallel text alignment via IBM1 / raw counts of word alignments
// aiming at high precision (to seed Yawat alignments)
// This program is tailored for use with Yawat.
// Written by Ulrich Germann.
#include <string>
#include <unicode/stringpiece.h>
#include <unicode/utypes.h>
#include <unicode/unistr.h>
#include <unicode/uchar.h>
#include <unicode/utf8.h>
#include "moses/TranslationModel/UG/generic/file_io/ug_stream.h"
#include "moses/TranslationModel/UG/mm/tpt_tokenindex.h"
#include <boost/unordered_map.hpp>
#include "moses/TranslationModel/UG/mm/tpt_pickler.h"
#include "moses/TranslationModel/UG/mm/ug_mm_2d_table.h"
using namespace std;
using namespace ugdiss;
typedef mm2dTable<id_type,id_type,uint32_t,uint32_t> table_t;
class IBM1
{
public:
table_t COOC;
TokenIndex V1,V2;
void
align(string const& s1, string const& s2, vector<int>& aln) const;
void
align(vector<id_type> const& x1,
vector<id_type> const& x2,
vector<int>& aln) const;
void
fill_amatrix(vector<id_type> const& x1,
vector<id_type> const& x2,
vector<vector<int> >& aln) const;
void
open(string const base, string const L1, string const L2);
};
void
IBM1::
open(string const base, string const L1, string const L2)
{
V1.open(base+L1+".tdx");
V2.open(base+L2+".tdx");
COOC.open(base+L1+"-"+L2+".lex");
}
void
IBM1::
align(string const& s1, string const& s2, vector<int>& aln) const
{
vector<id_type> x1,x2;
V1.fillIdSeq(s1,x1);
V2.fillIdSeq(s2,x2);
align(x1,x2,aln);
}
static UnicodeString apos = UnicodeString::fromUTF8(StringPiece("'"));
string
u(StringPiece str, size_t start, size_t stop)
{
string ret;
UnicodeString::fromUTF8(str).tempSubString(start,stop).toUTF8String(ret);
return ret;
}
void
IBM1::
fill_amatrix(vector<id_type> const& x1,
vector<id_type> const& x2,
vector<vector<int> >& aln) const
{
aln.assign(x1.size(),vector<int>(x2.size()));
for (size_t i = 0; i < x1.size(); ++i)
for (size_t k = 0; k < x2.size(); ++k)
aln[i][k] = COOC[x1[i]][x2[k]];
#if 0
cout << setw(10) << " ";
for (size_t k = 0; k < x2.size(); ++k)
cout << setw(7) << right << u(V2[x2[k]],0,6);
cout << endl;
for (size_t i = 0; i < x1.size(); ++i)
{
cout << setw(10) << u(V1[x1[i]],0,10);
for (size_t k = 0; k < x2.size(); ++k)
{
if (aln[i][k] > 999999)
cout << setw(7) << aln[i][k]/1000 << " K";
else
cout << setw(7) << aln[i][k];
}
cout << endl;
}
#endif
}
void
IBM1::
align(vector<id_type> const& x1,
vector<id_type> const& x2,
vector<int>& aln) const
{
vector<vector<int> > M;
// fill_amatrix(x1,x2,M);
vector<int> i1(x1.size(),0), max1(x1.size(),0);
vector<int> i2(x2.size(),0), max2(x2.size(),0);
aln.clear();
for (size_t i = 0; i < i1.size(); ++i)
{
for (size_t k = 0; k < i2.size(); ++k)
{
int c = COOC[x1[i]][x2[k]];
if (c > max1[i]) { i1[i] = k; max1[i] = c; }
if (c >= max2[k]) { i2[k] = i; max2[k] = c; }
}
}
for (size_t i = 0; i < i1.size(); ++i)
{
if (max1[i] && i2[i1[i]] == i)
{
aln.push_back(i);
aln.push_back(i1[i]);
}
}
}
int main(int argc, char* argv[])
{
IBM1 ibm1;
ibm1.open(argv[1],argv[2],argv[3]);
string line1,line2,sid;
while (getline(cin,sid))
{
if (!getline(cin,line1)) assert(false);
if (!getline(cin,line2)) assert(false);
vector<int> a;
vector<id_type> s1,s2;
ibm1.V1.fillIdSeq(line1,s1);
ibm1.V2.fillIdSeq(line2,s2);
ibm1.align(s1,s2,a);
cout << sid;
for (size_t i = 0; i < a.size(); i += 2)
cout << " " << a[i] << ":" << a[i+1] << ":unspec";
cout << endl;
// cout << line1 << endl;
// cout << line2 << endl;
// for (size_t i = 0; i < a.size(); i += 2)
// cout << ibm1.V1[s1[a[i]]] << " - "
// << ibm1.V2[s2[a[i+1]]] << endl;
}
// cout << endl;
}
|