diff options
| author | Ulrich Germann <ugermann@inf.ed.ac.uk> | 2014-07-09 05:41:28 +0400 |
|---|---|---|
| committer | Ulrich Germann <ugermann@inf.ed.ac.uk> | 2014-07-09 05:41:28 +0400 |
| commit | 4d41211c2cd6eb75c5a229c10e98fdfa1acff3b4 (patch) | |
| tree | 142dca24625b301147a931f728825dd40cf74e53 /moses/TranslationModel/fuzzy-match/FuzzyMatchWrapper.cpp | |
| parent | 28d64e23396cba53a83b75e01e9977db636e2285 (diff) | |
Major overhaul of Mmsapt. Reorganization of old and addition of new features in phrase tables. Many critical bug fixes.
Diffstat (limited to 'moses/TranslationModel/fuzzy-match/FuzzyMatchWrapper.cpp')
| -rw-r--r-- | moses/TranslationModel/fuzzy-match/FuzzyMatchWrapper.cpp | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/moses/TranslationModel/fuzzy-match/FuzzyMatchWrapper.cpp b/moses/TranslationModel/fuzzy-match/FuzzyMatchWrapper.cpp index 8766743b3..a91c58343 100644 --- a/moses/TranslationModel/fuzzy-match/FuzzyMatchWrapper.cpp +++ b/moses/TranslationModel/fuzzy-match/FuzzyMatchWrapper.cpp @@ -345,10 +345,10 @@ string FuzzyMatchWrapper::ExtractTM(WordIndex &wordIndex, long translationId, co // find the best matches according to letter sed string best_path = ""; int best_match = -1; - int best_letter_cost; + unsigned int best_letter_cost; if (lsed_flag) { best_letter_cost = compute_length( input[sentenceInd] ) * min_match / 100 + 1; - for(int si=0; si<best_tm.size(); si++) { + for(size_t si=0; si<best_tm.size(); si++) { int s = best_tm[si]; string path; unsigned int letter_cost = sed( input[sentenceInd], source[s], path, true ); |