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
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
|
#!/usr/bin/perl
## ====================================================================
##
## Copyright (c) 1996-2000 Carnegie Mellon University. All rights
## reserved.
##
## Redistribution and use in source and binary forms, with or without
## modification, are permitted provided that the following conditions
## are met:
##
## 1. Redistributions of source code must retain the above copyright
## notice, this list of conditions and the following disclaimer.
##
## 2. Redistributions in binary form must reproduce the above copyright
## notice, this list of conditions and the following disclaimer in
## the documentation and/or other materials provided with the
## distribution.
##
## This work was supported in part by funding from the Defense Advanced
## Research Projects Agency and the National Science Foundation of the
## United States of America, and the CMU Sphinx Speech Consortium.
##
## THIS SOFTWARE IS PROVIDED BY CARNEGIE MELLON UNIVERSITY ``AS IS'' AND
## ANY EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
## THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
## PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL CARNEGIE MELLON UNIVERSITY
## NOR ITS EMPLOYEES BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
## SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
## LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
## DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
## THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
## (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
## OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
##
## ====================================================================
##
## Author: Ricky Houghton
##
use strict;
use File::Copy;
use File::Basename;
use File::Spec::Functions;
use File::Path;
use lib catdir(dirname($0), updir(), 'lib');
use SphinxTrain::Config;
use SphinxTrain::Util;
#*************************************************************************
# This script runs the build_tree script for each state of each basephone
#*************************************************************************
if ($ST::CFG_CD_TRAIN eq 'no') {
Log("Skipped (set \$CFG_CD_TRAIN = 'yes' to enable)\n");
exit 0;
}
use vars qw($MLLT_FILE $MODEL_TYPE);
$MLLT_FILE = catfile($ST::CFG_MODEL_DIR, "${ST::CFG_EXPTNAME}.mllt");
$MODEL_TYPE = 'cd';
my ($phone,$state);
my $return_value = 0;
my $logdir = "${ST::CFG_LOG_DIR}/40.buildtrees";
Log("MODULE: 40 Build Trees\n");
Log("Phase 1: Cleaning up old log files...\n");
rmtree ("$logdir");
mkdir ($logdir,0777);
$| = 1; # Turn on autoflushing
if ($ST::CFG_MAKE_QUESTS eq 'no') {
die "Question set $ST::CFG_QUESTION_SET not found, but CFG_MAKE_QUESTS is no"
unless -e $ST::CFG_QUESTION_SET;
}
else {
Log("Phase 2: Make Questions");
if (RunScript('make_questions.pl')) {
$return_value = 1;
exit ($return_value);
}
}
Log("Phase 3: Tree building\n");
my $mdef_file = "${ST::CFG_BASE_DIR}/model_architecture/${ST::CFG_EXPTNAME}.untied.mdef";
my $mixture_wt_file = "${ST::CFG_BASE_DIR}/model_parameters/${ST::CFG_EXPTNAME}.${MODEL_TYPE}_${ST::CFG_DIRLABEL}_untied/mixture_weights";
my $tree_base_dir = "${ST::CFG_BASE_DIR}/trees";
my $unprunedtreedir = "$tree_base_dir/${ST::CFG_EXPTNAME}.unpruned";
mkdir ($tree_base_dir,0777);
mkdir ($unprunedtreedir,0777);
# For every phone submit each possible state
my @jobs;
if ($ST::CFG_CROSS_PHONE_TREES eq 'yes') {
Log("Processing all phones with each state\n", 'result');
push @jobs, ['ALLPHONES' => LaunchScript("tree.all", ['buildtree.pl', 'ALLPHONES'])];
} else {
Log ("Processing each phone with each state\n", 'result');
open INPUT,"${ST::CFG_RAWPHONEFILE}";
foreach $phone (<INPUT>) {
if ($ST::CFG_QUEUE_TYPE eq "Queue::POSIX") {
# Use @jobs as a queue (better than nothing for Queue::POSIX)
if (@jobs > $ST::CFG_NPART) {
my ($p, $j) = @{shift @jobs};
WaitForScript($j);
}
}
$phone = Trim($phone);
if (($phone =~ m/^(\+).*(\+)$/) || ($phone =~ m/^SIL$/)) {
Log ("Skipping $phone\n", 'result');
next;
}
my $job = LaunchScript("tree.$phone", ['buildtree.pl', $phone]);
push @jobs, [$phone => $job];
}
close INPUT;
}
# Wait for all the remaining phones to finish
# It doesn't really matter what order we do this in
foreach (@jobs) {
my ($phone,$job) = @$_;
WaitForScript($job);
}
|
