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

github.com/moses-smt/mosesdecoder.git - Unnamed repository; edit this file 'description' to name the repository.
summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
Diffstat (limited to 'scripts/training/phrase-extract/pcfg-extract/rule_collection.cc')
-rw-r--r--scripts/training/phrase-extract/pcfg-extract/rule_collection.cc58
1 files changed, 58 insertions, 0 deletions
diff --git a/scripts/training/phrase-extract/pcfg-extract/rule_collection.cc b/scripts/training/phrase-extract/pcfg-extract/rule_collection.cc
new file mode 100644
index 000000000..503b1a9e6
--- /dev/null
+++ b/scripts/training/phrase-extract/pcfg-extract/rule_collection.cc
@@ -0,0 +1,58 @@
+/***********************************************************************
+ 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
+***********************************************************************/
+
+#include "rule_collection.h"
+
+#include "pcfg-common/pcfg.h"
+
+#include <cmath>
+
+namespace Moses {
+namespace PCFG {
+
+void RuleCollection::Add(size_t lhs, const std::vector<size_t> &rhs) {
+ ++collection_[lhs][rhs];
+}
+
+void RuleCollection::CreatePcfg(Pcfg &pcfg) {
+ std::vector<size_t> key;
+ for (const_iterator p = begin(); p != end(); ++p) {
+ size_t lhs = p->first;
+ const RhsCountMap &rhs_counts = p->second;
+ size_t total = 0;
+ for (RhsCountMap::const_iterator q = rhs_counts.begin();
+ q != rhs_counts.end(); ++q) {
+ total += q->second;
+ }
+ for (RhsCountMap::const_iterator q = rhs_counts.begin();
+ q != rhs_counts.end(); ++q) {
+ const std::vector<size_t> &rhs = q->first;
+ size_t count = q->second;
+ double score = std::log(static_cast<double>(count) /
+ static_cast<double>(total));
+ key.clear();
+ key.push_back(lhs);
+ key.insert(key.end(), rhs.begin(), rhs.end());
+ pcfg.Add(key, score);
+ }
+ }
+}
+
+} // namespace PCFG
+} // namespace Moses