mirror of
https://github.com/moses-smt/mosesdecoder.git
synced 2024-11-10 10:59:21 +03:00
85 lines
2.1 KiB
C++
85 lines
2.1 KiB
C++
// $Id$
|
|
|
|
/***********************************************************************
|
|
Moses - factored phrase-based language decoder
|
|
Copyright (C) 2006 University of Edinburgh
|
|
|
|
This library 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 library 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
|
|
Lesser 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., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
|
|
***********************************************************************/
|
|
|
|
#include "WordsBitmap.h"
|
|
|
|
namespace Moses
|
|
{
|
|
|
|
TO_STRING_BODY(WordsBitmap);
|
|
|
|
int WordsBitmap::GetFutureCosts(int lastPos) const
|
|
{
|
|
int sum=0;
|
|
bool aim1=0,ai=0,aip1=m_bitmap[0];
|
|
|
|
for(size_t i=0; i<m_size; ++i) {
|
|
aim1 = ai;
|
|
ai = aip1;
|
|
aip1 = (i+1==m_size || m_bitmap[i+1]);
|
|
|
|
#ifndef NDEBUG
|
|
if( i>0 ) {
|
|
assert( aim1==(i==0||m_bitmap[i-1]==1));
|
|
}
|
|
|
|
if( i+1<m_size ) {
|
|
assert( aip1==m_bitmap[i+1]);
|
|
}
|
|
#endif
|
|
if((i==0||aim1)&&ai==0) {
|
|
sum+=abs(lastPos-static_cast<int>(i)+1);
|
|
// sum+=getJumpCosts(lastPos,i,maxJumpWidth);
|
|
}
|
|
// if(sum>1e5) return sum;
|
|
if(i>0 && ai==0 && (i+1==m_size||aip1) )
|
|
lastPos = (int) (i+1);
|
|
}
|
|
|
|
// sum+=getJumpCosts(lastPos,as,maxJumpWidth);
|
|
sum+=abs(lastPos-static_cast<int>(m_size)+1); //getCosts(lastPos,as);
|
|
assert(sum>=0);
|
|
|
|
// TRACE_ERR(sum<<"\n");
|
|
|
|
return sum;
|
|
}
|
|
|
|
bool WordsBitmap::IsAdjacent(size_t startPos, size_t endPos) const
|
|
{
|
|
if (GetNumWordsCovered() == 0) {
|
|
return true;
|
|
}
|
|
|
|
size_t first = GetFirstGapPos();
|
|
size_t last = GetLastGapPos();
|
|
|
|
if (startPos == last || endPos == first) {
|
|
return true;
|
|
}
|
|
|
|
return false;
|
|
}
|
|
|
|
|
|
}
|
|
|