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
|
/***********************************************************************
Moses - statistical machine translation system
Copyright (C) 2006-2012 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 "Trie.h"
#include "UTrieNode.h"
#include "moses/TargetPhraseCollection.h"
namespace Moses
{
class Phrase;
class TargetPhrase;
class Word;
class ChartParser;
/** Implementation of RuleTableTrie. A RuleTableUTrie is designed to store
* string-to-tree SCFG grammars only (i.e. rules can have distinct labels on
* the target side, but only a generic non-terminal on the source side).
* A key is the source RHS (one symbol per edge) of a rule and a mapped value
* is the collection of grammar rules that share the same source RHS.
*
* (The 'U' in UTrie stands for 'unlabelled' -- the keys are unlabelled and
* the target labels are stored on the node values, as opposed to the grammar
* being a monolingual projection with target labels projected onto the source
* side.)
*/
class RuleTableUTrie : public RuleTableTrie
{
public:
RuleTableUTrie(const std::string &line)
: RuleTableTrie(line) {
}
const UTrieNode &GetRootNode() const {
return m_root;
}
ChartRuleLookupManager *CreateRuleLookupManager(const ChartParser &,
const ChartCellCollectionBase &, std::size_t);
private:
TargetPhraseCollection::shared_ptr
GetOrCreateTargetPhraseCollection(const Phrase &source,
const TargetPhrase &target,
const Word *sourceLHS);
UTrieNode &GetOrCreateNode(const Phrase &source, const TargetPhrase &target,
const Word *sourceLHS);
void SortAndPrune();
UTrieNode m_root;
};
} // namespace Moses
|