Welcome to mirror list, hosted at ThFree Co, Russian Federation.

github.com/moses-smt/mosesdecoder.git - Unnamed repository; edit this file 'description' to name the repository.
summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorRico Sennrich <rico.sennrich@gmx.ch>2014-03-02 20:15:21 +0400
committerRico Sennrich <rico.sennrich@gmx.ch>2014-03-02 20:55:42 +0400
commit01bc3c111e792b88291a1d3bdb4901b676b02107 (patch)
tree8fbfd555016d0fcef152ed03c0c881a42ef97a8c /phrase-extract/consolidate-main.cpp
parent952bb76b776570340e7c86835b7c1153ab254aae (diff)
swap position of alignment and scores in phrase table halves (before consolidate step).
ensures that multiple hierarchical rules with same source/target phrase, but different alignment, are sorted correctly
Diffstat (limited to 'phrase-extract/consolidate-main.cpp')
-rw-r--r--phrase-extract/consolidate-main.cpp6
1 files changed, 3 insertions, 3 deletions
diff --git a/phrase-extract/consolidate-main.cpp b/phrase-extract/consolidate-main.cpp
index b318561df..de0d7f646 100644
--- a/phrase-extract/consolidate-main.cpp
+++ b/phrase-extract/consolidate-main.cpp
@@ -235,8 +235,8 @@ void processFiles( char* fileNameDirect, char* fileNameIndirect, char* fileNameC
// SCORES ...
string directScores, directSparseScores, indirectScores, indirectSparseScores;
- breakdownCoreAndSparse( itemDirect[2], directScores, directSparseScores );
- breakdownCoreAndSparse( itemIndirect[2], indirectScores, indirectSparseScores );
+ breakdownCoreAndSparse( itemDirect[3], directScores, directSparseScores );
+ breakdownCoreAndSparse( itemIndirect[3], indirectScores, indirectSparseScores );
vector<string> directCounts = tokenize(itemDirect[4].c_str());
vector<string> indirectCounts = tokenize(itemIndirect[4].c_str());
@@ -307,7 +307,7 @@ void processFiles( char* fileNameDirect, char* fileNameIndirect, char* fileNameC
}
// alignment
- fileConsolidated << " ||| " << itemDirect[3];
+ fileConsolidated << " ||| " << itemDirect[2];
// counts, for debugging
fileConsolidated << "||| " << countE << " " << countF << " " << countEF;