From d4263d1dc29fe46871caec9fde613bf40f3ed90c Mon Sep 17 00:00:00 2001 From: Patrick Simianer
Date: Fri, 15 Jul 2016 12:17:47 +0200
Subject: support for 'noloo' extraction and updatable lm; fixes
---
views/debug.haml | 5 +++--
1 file changed, 3 insertions(+), 2 deletions(-)
(limited to 'views')
diff --git a/views/debug.haml b/views/debug.haml
index 17f7f86..1ab22f7 100644
--- a/views/debug.haml
+++ b/views/debug.haml
@@ -148,6 +148,7 @@
%p Duration: #{data["durations"][progress]}ms
%p Keypresses: #{data["count_kbd"][progress]}
%p Clicks: #{data["count_click"][progress]}
+ %p Pass: #{pass}
%h3 Derivation
%p
@@ -169,7 +170,7 @@
/=#########################################################################
%h2#grammar Grammar
- %p Notes: In addition to dynamically adding each source/post-edit instance to the suffix array extractor, the system additionally uses the provided phrase alignments to extract new rules. The extraction follows the original Hiero grammar extraction, but using phrases instead of words and using only a single binary feature: 'NewRule=1'. Extracted rules that already exist in a grammar are annotated with an additional feature: 'KnownRules=1'. OOVs are avoided by asking the user for translations of unknown words prior to translation. These are added to the grammars as new rules ('OOVFix=1').
+ %p Notes: In addition to dynamically adding each source/post-edit instance to the suffix array extractor, the system additionally uses the provided phrase alignments to extract new rules. The extraction follows the original Hiero grammar extraction, but using phrases instead of words and using only a single binary feature: 'NewRule=1'. Extracted rules that already exist in a grammar are annotated with an additional feature: 'KnownRules=1'. OOVs are avoided by asking the user for translations of unknown words prior to translation. These are added to the grammars as new rules ('OOVFix=1').
%h3
New Rules
@@ -225,7 +226,7 @@
%th Rate
%tbody
- if pairwise_ranking_data["update_raw"]
- - raw_update = SparseVector.from_kv(pairwise_ranking_data["update_raw"])
+ - raw_update = SparseVector.new(pairwise_ranking_data["update_raw"])
- pairwise_ranking_data["weights_before"].default = 0
- pairwise_ranking_data["weights_after"].keys.each.sort { |a,b| a <=> b }.each do |k|
- diff = pairwise_ranking_data["weights_after"][k] - pairwise_ranking_data["weights_before"][k]
--
cgit v1.2.3