candidate.cpp

解码器是基于短语的统计机器翻译系统的核心模块

/*
* CandTrans.cpp  -  Candidate Translation
*
* Copyright (C) 2006 by Zhongjun He <[e-mail]> 
Multilingual Interaction Technology and Evaluation Laboratory, ICT, CAS

* Begin       : 04/26/2006
* Last Change : 04/26/2006
*
* This program 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 program 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 General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
*/

#include "Candidate.h"

/************************************************************************/
/* overload <                                                           */
/************************************************************************/
bool CandTrans::operator <(const CandTrans &right)const
{
	return feat < right.feat;
}

/************************************************************************/
/* overload >                                                           */
/************************************************************************/
bool CandTrans::operator >(const CandTrans &right)const
{
	return feat > right.feat;
}

/************************************************************************/
/* show                                                                 */
/************************************************************************/
void CandTrans::Show(ostream &out, bool isdetail)
{
	out << "<translation>" << english << "</translation>" << endl;
	out << "<feature>";
	feat.Show(out, isdetail);
	out << "</feature>" << endl;
}