moses-smt/mosesdecoder
1
1
Fork 0
mirror of https://github.com/moses-smt/mosesdecoder.git synced 2024-12-28 14:32:38 +03:00
Code Issues Packages Projects Releases Wiki Activity

bug fixes

Browse Source
This commit is contained in:
phikoehn 2012-09-03 07:24:31 +01:00
parent e072a7f9a7
commit 19ef785146
3 changed files with 28 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
scripts/ems/experiment.perl
View File

@ -2346,7 +2346,7 @@ sub define_evaluation_decode {
$report_segmentation = "yes";
}
if (defined($analyze_search_graph) && $analyze_search_graph eq "yes") {
$settings .= " -unpruned-search-graph -osg $system_output.graph";
$settings .= " -unpruned-search-graph -include-lhs-in-search-graph -osg $system_output.graph";
}
if (defined($report_segmentation) && $report_segmentation eq "yes") {
if ($hierarchical) {

33
scripts/ems/support/analysis.perl
View File

@ -974,11 +974,16 @@ sub hs_rule_type {
# compute depth of each node
sub hs_compute_depth {
my ($start,$end,$depth,$CHART) = @_;
if (!defined($$CHART{$start}{$end})) {
print STDERR "warning: illegal span ($start,$end)\n";
return;
}
my $RULE = $$CHART{$start}{$end};
$$RULE{'depth'} = $depth;
for(my $i=0;$i<scalar @{$$RULE{'rule_rhs'}};$i++) {
# non-terminals
# non-terminals
if (defined($$RULE{'alignment'}{$i})) {
my $SUBSPAN = $$RULE{'spans'}[$$RULE{'alignment'}{$i}];
&hs_compute_depth($$SUBSPAN{'from'},$$SUBSPAN{'to'},$depth+1,$CHART);
@ -989,6 +994,10 @@ sub hs_compute_depth {
# re-assign depth to as deep as possible
sub hs_recompute_depth {
my ($start,$end,$CHART,$max_depth) = @_;
if (!defined($$CHART{$start}{$end})) {
print STDERR "warning: illegal span ($start,$end)\n";
return 0;
}
my $RULE = $$CHART{$start}{$end};
my $min_sub_depth = $max_depth+1;
@ -1007,6 +1016,10 @@ sub hs_recompute_depth {
# get child dependencies for a sentence
sub hs_get_children {
my ($start,$end,$CHART) = @_;
if (!defined($$CHART{$start}{$end})) {
print STDERR "warning: illegal span ($start,$end)\n";
return -1;
}
my $RULE = $$CHART{$start}{$end};
my @CHILDREN = ();
@ -1017,7 +1030,7 @@ sub hs_get_children {
if (defined($$RULE{'alignment'}{$i})) {
my $SUBSPAN = $$RULE{'spans'}[$$RULE{'alignment'}{$i}];
my $child = &hs_get_children($$SUBSPAN{'from'},$$SUBSPAN{'to'},$CHART);
push @CHILDREN, $child;
push @CHILDREN, $child unless $child == -1;
}
}
return $$RULE{'id'};
@ -1026,6 +1039,10 @@ sub hs_get_children {
# create the span annotation for an output sentence
sub hs_create_out_span {
my ($start,$end,$CHART,$MATRIX) = @_;
if (!defined($$CHART{$start}{$end})) {
print STDERR "warning: illegal span ($start,$end)\n";
return;
}
my $RULE = $$CHART{$start}{$end};
my %SPAN;
@ -1070,6 +1087,10 @@ sub hs_create_out_span {
# create the span annotation for an input sentence
sub hs_create_in_span {
my ($start,$end,$CHART,$MATRIX) = @_;
if (!defined($$CHART{$start}{$end})) {
print STDERR "warning: illegal span ($start,$end)\n";
return;
}
my $RULE = $$CHART{$start}{$end};
my %SPAN;
@ -1116,9 +1137,9 @@ sub process_search_graph {
`mkdir -p $dir/search-graph`;
my $last_sentence = -1;
while(<OSG>) {
/^(\d+) (\d+)\-?\>?(\S*) (.+) :(.*): pC=([\d\-\.]+), c=([\d\-\.]+) \[(\d+)\.\.(\d+)\] (.*)\[total=([\d\-\.]+)\] \<\</ || die("ERROR: buggy search graph line: $_");
my ($sentence,$id,$recomb,$output,$alignment,$rule_score,$heuristic_rule_score,$from,$to,$children,$hyp_score)
= ($1,$2,$3,$4,$5,$6,$7,$8,$9,$10,$11);
/^(\d+) (\d+)\-?\>?(\S*) (\S+) =\> (.+) :(.*): pC=([\de\-\.]+), c=([\de\-\.]+) \[(\d+)\.\.(\d+)\] (.*)\[total=([\d\-\.]+)\] \<\</ || die("ERROR: buggy search graph line: $_");
my ($sentence,$id,$recomb,$lhs,$output,$alignment,$rule_score,$heuristic_rule_score,$from,$to,$children,$hyp_score)
= ($1,$2,$3,$4,$5,$6,$7,$8,$9,$10,$11,$12);
chop($alignment) if $alignment;
chop($children) if $children;
$recomb = 0 unless $recomb;
@ -1129,7 +1150,7 @@ sub process_search_graph {
open(SENTENCE,">$dir/search-graph/graph.$sentence");
$last_sentence = $sentence;
}
print SENTENCE "$id\t$recomb\t$from\t$to\t$output\t$alignment\t$children\t$rule_score\t$heuristic_rule_score\t$hyp_score\n";
print SENTENCE "$id\t$recomb\t$from\t$to\t$output\t$alignment\t$children\t$rule_score\t$heuristic_rule_score\t$hyp_score\t$lhs\n";
}
close(OSG);
close(SENTENCE);

1
scripts/training/mert-moses.pl
View File

@ -1159,7 +1159,6 @@ sub get_featlist_from_file {
next if $value eq "sparse";
push @errs, "$featlistfn:$nr:Bad initial value of $feature: $value\n"
if $value !~ /^[+-]?[0-9.\-e]+$/;
if $value !~ /^[+-]?[0-9.e-]+$/;
push @errs, "$featlistfn:$nr:Unknown feature '$feature', please add it to \@ABBR_FULL_MAP\n"
if !defined $ABBR2FULL{$feature};
push @names, $feature;