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

tercalc.h « TER « mert - github.com/moses-smt/mosesdecoder.git - Unnamed repository; edit this file 'description' to name the repository.
summaryrefslogtreecommitdiff
blob: 22b5e2c9df1b266913a005875e597397885d360d (plain)
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
/*********************************
tercpp: an open-source Translation Edit Rate (TER) scorer tool for Machine Translation.

Copyright 2010-2013, Christophe Servan, LIUM, University of Le Mans, France
Contact: christophe.servan@lium.univ-lemans.fr

The tercpp tool and library are 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 3 of the licence, or
(at your option) any later version.

This program and library are 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 Lesser General Public License
along with this library; if not, write to the Free Software Foundation,
Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
**********************************/
#ifndef _TERCPPTERCALC_H___
#define _TERCPPTERCALC_H___

#include <vector>
#include <stdio.h>
#include <string.h>
#include <sstream>
#include "hashMap.h"
#include "hashMapInfos.h"
#include "hashMapStringInfos.h"
#include "terAlignment.h"
#include "tools.h"
#include "terShift.h"
#include "alignmentStruct.h"
#include "bestShiftStruct.h"

using namespace std;
using namespace Tools;
using namespace HashMapSpace;
namespace TERCpp
{
// typedef size_t WERelement[2];
// Vecteur d'alignement contenant le hash du mot et son evaluation (0=ok, 1=sub, 2=ins, 3=del)
    typedef vector<terShift> vecTerShift;
    /**
    	@author
    */
    class terCalc
    {
        private :
// Vecteur d'alignement contenant le hash du mot et son evaluation (0=ok, 1=sub, 2=ins, 3=del)
            WERalignment l_WERalignment;
// HashMap contenant les valeurs de hash de chaque mot
            hashMap bagOfWords;
            int TAILLE_PERMUT_MAX;
            int NBR_PERMUT_MAX;
            // Increments internes  
            int NBR_SEGS_EVALUATED;
            int NBR_PERMUTS_CONSID;
            int NBR_BS_APPELS;
            int DIST_MAX_PERMUT;
	    int CALL_TER_ALIGN;
	    int CALL_CALC_PERMUT;
	    int CALL_FIND_BSHIFT;
	    int MAX_LENGTH_SENTENCE;
            bool PRINT_DEBUG;

            // Utilisés dans minDistEdit et ils ne sont pas réajustés 
            vector < vector < double > > * S;
            vector < vector < char > > * P;
            vector<vecInt> refSpans;
            vector<vecInt> hypSpans;
            int TAILLE_BEAM;

        public:
            int shift_cost;
            int insert_cost;
            int delete_cost;
            int substitute_cost;
            int match_cost;
            double infinite;
            terCalc();

	    ~terCalc();
//             size_t* hashVec ( vector<string> s );
            void setDebugMode ( bool b );
//             int WERCalculation ( size_t * ref, size_t * hyp );
//             int WERCalculation ( vector<string> ref, vector<string> hyp );
//             int WERCalculation ( vector<int> ref, vector<int> hyp );
	    terAlignment WERCalculation ( vector< string >& hyp, vector< string >& ref );
// 	string vectorToString(vector<string> vec);
// 	vector<string> subVector(vector<string> vec, int start, int end);
            hashMapInfos createConcordMots ( vector<string>& hyp, vector<string>& ref );
            terAlignment minimizeDistanceEdition ( vector<string>& hyp, vector<string>& ref, vector<vecInt>& curHypSpans );
            void minimizeDistanceEdition ( vector<string>& hyp, vector<string>& ref, vector<vecInt>& curHypSpans , terAlignment* l_terAlign);
//             terAlignment minimizeDistanceEdition ( vector<string>& hyp, vector<string>& ref, vector<vecInt>& curHypSpans );
            bool trouverIntersection ( vecInt& refSpan, vecInt& hypSpan );
            terAlignment TER ( vector<string>& hyp, vector<string>& ref , float avRefLength );
            terAlignment TER ( vector<string>& hyp, vector<string>& ref );
            terAlignment TER ( vector<int>& hyp, vector<int>& ref );
            bestShiftStruct * findBestShift ( vector< string >& cur, vector< string >& hyp, vector< string >& ref, hashMapInfos& rloc, TERCpp::terAlignment& med_align );
            void calculateTerAlignment ( terAlignment& align, vector<bool>* herr, vector<bool>* rerr, vector<int>* ralign );
            vector<vecTerShift> * calculerPermutations ( vector< string >& hyp, vector< string >& ref, hashMapInfos& rloc, TERCpp::terAlignment& align, vector<bool>* herr, vector<bool>* rerr, vector<int>* ralign );
            alignmentStruct permuter ( vector<string>& words, terShift& s );
            alignmentStruct permuter ( vector<string>& words, terShift* s );
            alignmentStruct permuter ( vector<string>& words, int start, int end, int newloc );
    };

}

#endif