// $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
***********************************************************************/

#ifndef moses_TranslationOptionCollectionText_h
#define moses_TranslationOptionCollectionText_h

#include "TranslationOptionCollection.h"
#include "InputPath.h"
#include <map>
#include <vector>

namespace Moses
{

class Sentence;

/** Holds all translation options, for all spans, of a particular sentence input
 * Inherited from TranslationOptionCollection.
 */
class TranslationOptionCollectionText : public TranslationOptionCollection
{
public:
  typedef std::vector< std::vector<InputPath*> > TargetPhraseMatrix;

protected:
  TargetPhraseMatrix	m_targetPhrasesfromPt; /*< contains translation options */

  InputPath &GetInputPath(size_t startPos, size_t endPos);

public:
  void ProcessUnknownWord(size_t sourcePos);

  TranslationOptionCollectionText(Sentence const& input, size_t maxNoTransOptPerCoverage, float translationOptionThreshold);

  bool HasXmlOptionsOverlappingRange(size_t startPosition, size_t endPosition) const;

  void CreateXmlOptionsForRange(size_t startPosition, size_t endPosition);

  void CreateTranslationOptions();

  void CreateTranslationOptionsForRange(const DecodeGraph &decodeStepList
                                        , size_t startPosition
                                        , size_t endPosition
                                        , bool adhereTableLimit
                                        , size_t graphInd);

};

}

#endif