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

PhraseDictionaryMemory.h « TranslationModel « moses - github.com/moses-smt/mosesdecoder.git - Unnamed repository; edit this file 'description' to name the repository.
summaryrefslogtreecommitdiff
blob: 86bda50875774890070a2d2cebd0fbf91cf8ebcc (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
/***********************************************************************
 Moses - statistical machine translation system
 Copyright (C) 2006-2011 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
***********************************************************************/

#pragma once

#include "PhraseDictionaryNodeMemory.h"
#include "moses/TranslationModel/PhraseDictionary.h"
#include "moses/InputType.h"
#include "moses/NonTerminal.h"
#include "moses/TranslationModel/RuleTable/Trie.h"

namespace Moses
{
class ChartParser;

/** Implementation of a in-memory rule table in a trie.  Looking up a rule of
 * length n symbols requires n look-ups to find the TargetPhraseCollection.
 */
class PhraseDictionaryMemory : public RuleTableTrie
{
  friend std::ostream& operator<<(std::ostream&, const PhraseDictionaryMemory&);
  friend class RuleTableLoader;

protected:
  PhraseDictionaryMemory(int type, const std::string &line)
    : RuleTableTrie(line) {
  }

public:
  PhraseDictionaryMemory(const std::string &line);

  const PhraseDictionaryNodeMemory &GetRootNode() const {
    return m_collection;
  }

  ChartRuleLookupManager*
  CreateRuleLookupManager(
    const ChartParser &,
    const ChartCellCollectionBase &,
    std::size_t);

  // only used by multi-model phrase table, and other meta-features
  TargetPhraseCollection::shared_ptr
  GetTargetPhraseCollectionLEGACY(const Phrase& src) const;

  void
  GetTargetPhraseCollectionBatch(const InputPathList &inputPathQueue) const;

  TO_STRING();

protected:
  TargetPhraseCollection::shared_ptr
  GetOrCreateTargetPhraseCollection
  (const Phrase &source, const TargetPhrase &target, const Word *sourceLHS);

  PhraseDictionaryNodeMemory &
  GetOrCreateNode(const Phrase &source, const TargetPhrase &target,
                  const Word *sourceLHS);

  void SortAndPrune();

  PhraseDictionaryNodeMemory m_collection;
};

}  // namespace Moses