<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Neural speech synthesis for resource-scarce languages</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Johannes A Louw</string-name>
          <email>jalouw@csir.co.za</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Digital Audio-Visual Technologies Research Group, Next Generation Enterprises and Institutions</institution>
          ,
          <addr-line>CSIR, Pretoria</addr-line>
          ,
          <country country="ZA">South Africa</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Recent work in sequence-to-sequence neural networks with attention mechanisms, such as the Tacotron 2 and DCTTS architectures, have brought on substantial naturalness improvements in synthesised speech. These architectures require at least an order of magnitude more data than is generally available in resource-scarce language environments. In this paper we propose an e cient feed-forward deep neural network (DNN)-based acoustic model, using stacked bottleneck features, that together with the recently introduced LPCNet vocoder can be used in resource-scarce language environments, with corpora less than 1 hour in size, to build text-to-speech systems of high perceived naturalness. We compare traditional hidden Markov model (HMM)-based acoustic modelling for speech synthesis with the proposed architecture using the World and LPCNet vocoders, giving both objective and MUSHRA based subjective results, showing that the DNN LPCNet combination leads to more natural synthesised speech that can be confused with natural speech. The proposed acoustic model provides for an e cient implementation, with faster than real time synthesis.</p>
      </abstract>
      <kwd-group>
        <kwd>HMM • DNN • Speech synthesis • LPCNet • acoustic mod- elling • resource-scarce languages</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        The advent of neural network-based text-to-speech (TTS) systems has brought
on dramatic improvements in the naturalness and intelligibility of synthesized
speech. The success of these architectures can be broadly attributed to the
attention based models (such as Tacotron [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ] and Deep Convolutional TTS (DCTTS)
[
        <xref ref-type="bibr" rid="ref17">17</xref>
        ]) as well as the use of neural network based vocoders (such as WaveNet [
        <xref ref-type="bibr" rid="ref22">22</xref>
        ])
[
        <xref ref-type="bibr" rid="ref24">24</xref>
        ].
      </p>
      <p>
        Traditional TTS architectures are usually based on a pipeline of a linguistic
front-end and a waveform generation back-end. The newer deep neural network
(DNN)-based architectures \learn" the linguistic front-end by operating directly
on characters and learning embeddings from the characters which can then be
used to extract higher level linguistic knowledge and features. One challenge
of this approach is the data requirements in that the traditional hand-crafted
features need to be learned from the data. The baseline Tacotron system has
been trained with 40 hours of text and audio pairs [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. These end-to-end
architectures also perform poorly on non-alphabetic-, or pitch accent and tone-based
languages (for example Japanese and Chinese) in comparison to architectures
with a traditional linguistic front-end [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. Another major challenge of the
end-toend architectures are the computational requirements that need to be taken into
consideration, for example the Tacotron 2 architecture [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ] takes on average 234
hours1 to train whilst the WaveGlow vocoder [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ] takes on average 768 hours1
to train.
      </p>
      <p>
        For most world languages there are no high quality, single speaker, recorded
corpora available which will satisfy the data requirements of end-to-end TTS
systems. There are attempts at creating large corpora from found data, such
as the CMU Wilderness Multilingual Speech Dataset [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], but these datasets are
usually of a lesser quality in that there are multiple speakers and they may
contain background noise.
      </p>
      <p>In this work we aim to develop a DNN-based speech synthesis architecture
that can at the very least exceed the quality of hidden Markov model
(HMM)based approaches as generally used for resource-scarce languages. The goal is an
architecture with low computational costs (in terms of training and synthesis
time) which can be trained with relatively low data requirements. Our focus is
only on the acoustic modelling. The organisation of the paper is as follows: in
Section 2 we give the two acoustic models used in this work, while in Section 3
we give the two vocoders used in this work. Section 4 details our experiments
and results, and lastly a discussion and conclusion is presented in Section 5.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Statistical Parametric Speech Synthesis</title>
      <p>
        Concatenative synthesis, where units of speech from a recorded database are
concatenated to form the target utterance, had been the commercially
dominant TTS technology since the late 1990s. The size of the recorded databases for
commercial systems contained over 100 hours of recorded speech [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. From 2005
on-wards statistical parametric speech synthesis (SPSS) systems (which include
HMM- and later DNN-based systems) have been steadily adopted after the
success shown by HMM-based systems [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. A SPSS system can simply be described
as a model that can generate speech parameters, given an input target speci
cation, from a statistical model (usually learned) of said speech parameters.
      </p>
      <p>In the next sections we brie y described the two models used for acoustic
modelling in this work.
2.1</p>
      <sec id="sec-2-1">
        <title>HMM-Based Synthesis</title>
        <p>
          Most HMM-based synthesizer implementations in the literature are based on the
HMM-based Speech Synthesis System (HTS) [
          <xref ref-type="bibr" rid="ref33">33</xref>
          ], which is in fact a hidden
semi1https://github.com/NVIDIA/DeepLearningExamples/tree/master/PyTorch/
\SpeechSynthesis/Tacotron2#expected-training-time
Markov model (HSMM) because an explicit duration model is used for state
duration determination. The full working of the HTS HMM-based synthesizer is
out of the scope of this paper, but interested readers can see [
          <xref ref-type="bibr" rid="ref28">28</xref>
          ] and [
          <xref ref-type="bibr" rid="ref18">18</xref>
          ] for a
detailed handling of the subject. In the next section we will highlight the parts
that are important to the context of this paper, framed in terms of the training
and synthesis parts of an HTS HMM-based synthesizer.
        </p>
        <p>
          Training Speech features are extracted by a vocoder. A linguistic description
is generated by the TTS front-end, this describes each phoneme, syllable, word
and phrase in terms of it's context within the utterance (the generally used set
of descriptors are given in [
          <xref ref-type="bibr" rid="ref18">18</xref>
          ]). A baseline monophone model is estimated, after
which this model is used to estimate a context-dependent HSMM (using the
linguistic description). A decision tree is generated by clustering the di erent
contexts and then the HMM states of the leaf nodes are shared (to overcome
the problem of data sparsity due to the modelling of the full contexts). State
durations are modelled by a multivariate Gaussian distribution from the aligned
linguistic descriptions.
        </p>
        <p>Synthesis The synthesis procedure is then as follows: the input target text is
converted to a linguistic description by the TTS front-end. The state duration
decision tree is traversed to get the state durations for each full context label
as it is in the linguistic description. The speech parameter decision tree(s) are
traversed to get the HMM states for the linguistic description, these are then
concatenated to form the HMM target sequence.</p>
        <p>
          Parameter Generation With the state durations and the HMM target
sequence the parameters can be generated simply as the means and variances of
each HMM state (most likely observation is the mean of the Gaussian in that
state) with the duration specifying the number of frames generated per HMM
state. The maximum likelihood parameter generation (MLPG) [
          <xref ref-type="bibr" rid="ref19">19</xref>
          ] algorithm is
then used to smooth the generated parameter sequence between the frames. The
smoothed generated parameters are then fed back into the vocoder in order to
generate the speech waveform.
2.2
        </p>
      </sec>
      <sec id="sec-2-2">
        <title>DNN-Based Synthesis</title>
        <p>
          In this work our goal is to de ne an acoustic model which can be used for
resource-scarce languages and with low computational overhead. We opted for a
basic feed-forward neural network (FFNN) as was used in [
          <xref ref-type="bibr" rid="ref32">32</xref>
          ] but with added
stacked bottleneck features as was implemented in [
          <xref ref-type="bibr" rid="ref25">25</xref>
          ]. The architecture is shown
in gure 1.
        </p>
        <p>The scheme consists of two acoustic models, one for predicting the bottleneck
features (bottleneck model, on the left in Fig. 1) and one for prediction of the
acoustic features (acoustic model, on the right in Fig. 1). The bottleneck model is</p>
        <p>Vocoder
Speech
database
TTS engine
front-end</p>
        <p>Acoustic
features</p>
        <p>Acoustic
features
h4
h3
h1
h2
Bottleneck layer
h4
h3
h2
h1
Linguistic
description
h2;t 1
h2;t
h2;t+1</p>
        <p>Linguistic
description
trained as a normal FFNN, but with one bottleneck layer that forces the network
to learn an e cient representation of the linguistic to acoustic mapping. During
synthesis time the bottleneck model is used to generate a linguistic-acoustic
context feature of the surrounding linguistic full context labels of the input to the
acoustic model, thereby overcoming the context-independent frame modelling
limitation of a FFNN. The network is forced to to take the surrounding contexts
into account when predicting the acoustic features. The predicted features are
also smoothed with the MLPG algorithm as is done for HMM-based synthesis
(Section 2.1) before being passed to a vocoder for synthesis.
3</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Vocoders</title>
      <p>The parametric speech model in a SPSS system is represented by a vocoder
(voice + encoder ), which can extract parametric features describing the speech
signal, which in turn are used by the SPSS system to statistically model the
features. Di erent vocoders employ di erent parametric models of speech, but
the important point is that it is reversible, i.e. the vocoder extracts the features,
which are modelled by the SPSS system, which can generate new features based
on an input target, which can then be converted back into speech by the vocoder.</p>
      <p>
        In [
        <xref ref-type="bibr" rid="ref34">34</xref>
        ] Zen et al. identi ed the vocoding component of an SPSS system as a
major factor that degrades the quality of synthesized speech. This is especially
pronounced for resource-scarce corpora due to the inability of the acoustic model
to learn a representative statistical distribution of the vocoded speech features
because of the data sparsity problem.
      </p>
      <p>
        In this work we compare the World [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] vocoder, the current
state-of-theart in terms of conventional digital signal processing (DSP) based vocoders,
and the recently introduced e cient neural vocoder called LPCNet [
        <xref ref-type="bibr" rid="ref20 ref21">20,21</xref>
        ], in a
resource-scarce setting. In the next sections we give a brief description of these
two vocoders.
3.1
      </p>
      <sec id="sec-3-1">
        <title>World</title>
        <p>
          In the World vocoder speech is represented as a traditional source- lter model
[
          <xref ref-type="bibr" rid="ref16">16</xref>
          ] for speech production, where for each frame of speech a spectral envelope,
an aperiodicity estimation and an excitation (fundamental frequency f0) are
extracted. These three components combined give a complete parameterization of
a frame of speech. The extraction and synthesis process happens with traditional
DSP techniques.
3.2
        </p>
      </sec>
      <sec id="sec-3-2">
        <title>LPCNet</title>
        <p>
          LPCNet is a variant of WaveRNN [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ], where instead of employing a neural
network for the full speech spectrum (vocal source signal) modelling (like
WaveRNN) it uses conventional signal processing. The spectral features are still
predicted by a neural network. This change has a dramatic improvement in
runtime computational requirements, being 5 faster than real time on a 2:4 GHz
Intel Broadwell architecture (whilst requiring only 20% of the CPU) [
          <xref ref-type="bibr" rid="ref20">20</xref>
          ]. The
features extracted per frame of speech by LPCNet are: an 18-th order
Barkscale spectral envelope, pitch period and pitch correlation. The neural network in
the LPCNet vocoder can be trained on found data, thereby relieving a speech
synthesis acoustic model of its stringent data requirements.
4
4.1
        </p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Experimental Setup</title>
      <sec id="sec-4-1">
        <title>Data</title>
        <p>
          The data used in this work is a subset of an in-house single speaker Afrikaans
female TTS corpus of duration 12:08:15.89. The corpus was recorded in a
professional studio at a 44.1 kHz sampling rate with 16 bits precision. The subset
used are recordings of the text of the Lwazi II Afrikaans TTS Corpus [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ],
consisting of 763 utterances of duration 00:56:30.29. The utterances were randomly
split into 715 utterances for training (00:53:12.09), 38 utterances for validation
(00:02:37.99) and 10 utterances for testing (00:00:40.21). All audio was
downsampled to 16 kHz at 16 bits per sample and each utterance was normalised to
the average power level of the subset (the 763 utterances).
        </p>
        <p>
          Linguistic Descriptions The text annotations were tokenized and normalised
with the Speect TTS engine front-end [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ]. The linguistic descriptions of each
utterance was also extracted using Speect. The set of linguistic descriptions were
the same as de ned in [
          <xref ref-type="bibr" rid="ref18">18</xref>
          ], except for syllable stress, accent and ToBI (Tones
and Break Indices ) [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ] tones which were not included due to it most probably
not being available in resource-scarce settings.
        </p>
        <p>
          Speect creates the pronunciation dictionaries which were used to force-align
the linguistic descriptions and audio with the HTK toolkit [
          <xref ref-type="bibr" rid="ref30">30</xref>
          ] at a resolution
of 10ms. A silence state was added between all words in order to capture any
potential pauses in the recorded database which were not speci cally annotated
in the text with punctuation marks (this has been shown to improve the
alignments [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ], especially on small corpora). The alignments were done on a phone
level for HMM-based synthesis and on a state level for DNN-based synthesis.
Acoustic Features Acoustic features for the corpus were extracted using the
World and LPCNet vocoders. Both the World and LPCNet features were
extracted at their default frame rates, which are 5ms and 10ms respectively. The
spectral envelope extracted with the World vocoder was modelled with 60-th
order (including energy) Mel-cepstral coe cients as follows:
where z~ 1 is the rst order all-pass function:
        </p>
        <p>M
H(z) = exp X c (m))z~ m</p>
        <p>m=0
z~ 1 =
z 1
1
z 1
;
&lt; 1
and is a frequency warping scale factor. The spectral aperiodicity
estimation was modelled in the same fashion but with 5-th order (including energy)
Mel-cepstral coe cients. For the World vocoder voice the fundamental frequency
(f0) estimation was converted to the log-domain as follows:
logF0(f0) =
(log(f0)
1
1010
f0 &gt; 0
f0 = 0</p>
        <p>
          The reason for the logarithmic scale modelling of the fundamental frequency
is the fact that logF0 has a more Gaussian distribution than f0 [
          <xref ref-type="bibr" rid="ref29">29</xref>
          ]. The LPCNet
pitch period feature was not converted to the logarithmic domain due to the
quantization of the feature and the unknown distribution. The deltas and
deltadeltas of all features were also calculated.
4.2
        </p>
      </sec>
      <sec id="sec-4-2">
        <title>HMM-Based Voices</title>
        <p>
          The voice was based on the standard architecture of ve-state, left-to-right
HSMM. All continuous features were modelled by single-component Gaussians.
For the LPCNet voice the pitch period feature was modelled as a normal
continuous variable (voicing is captured in the pitch correlation feature) whereas the
World LogF0 feature was modelled as a 3-dimensional multi-space probability
(1)
(2)
(3)
distribution HMM (MSDHMM) [
          <xref ref-type="bibr" rid="ref18">18</xref>
          ], as is standard practice [
          <xref ref-type="bibr" rid="ref33">33</xref>
          ]. The decision
trees state clustering was done using a minimum description length (MDL) factor
of 1.0. For both voices global variance [
          <xref ref-type="bibr" rid="ref33">33</xref>
          ] was included.
        </p>
        <p>
          Training of the HMM-based voices was done via custom scripts based on the
standard demonstration script2 available as part of HTS [
          <xref ref-type="bibr" rid="ref33">33</xref>
          ] (version 2.2). The
custom scripts allow for the parallelization of the embedded re-estimation step
on multi-core processors. Both voices train on an Intel i7 4-core, 8-thread CPU
(2.80GHz) in about 1.5 hours. MLPG was used to smooth the generated features
before synthesis, using the predicted means and variances of the acoustic features
and their delta and delta-deltas. No post- ltering was applied.
4.3
        </p>
      </sec>
      <sec id="sec-4-3">
        <title>DNN-Based Voices</title>
        <p>
          The extracted linguistic descriptions were converted to a vector containing a
combination of binary encodings (for the phoneme identities and features) and
positional information (as is done in [
          <xref ref-type="bibr" rid="ref27">27</xref>
          ]).
        </p>
        <p>
          Frame level positional information was also added to the state aligned
linguistic descriptions in order to improve the granularity of the linguistic descriptions
at the speech frame level. The positional information consisted of: the frame
position within the HMM state and phoneme, the state position within the phoneme,
and state and phoneme durations, as de ned in [
          <xref ref-type="bibr" rid="ref26">26</xref>
          ].
        </p>
        <p>The input linguistic descriptions and frame level positional information
vector consisted of 384 features and was normalised to the range of [0.01, 0.99],
whilst the output vectors (the vocoder features) were normalised to zero mean
and unit variance. For the World vocoder the output vector consisted of 198
features (60-th order spectral envelope, 5-th order aperiodicity estimation and
f0 and their delta and delta-deltas), whilst for the LPCNet vocoder the output
vector consisted of 60 features (18-th order Bark-scale spectral envelope, pitch
period and pitch correlation and their delta and delta-deltas).</p>
        <p>
          A hyperparemeter search for the basic architecture was conducted and we
settled on a 4 hidden layer network, with 512 units per layer, for both the
bottleneck model and the acoustic model in Fig. 1. The recti ed linear unit
(ReLU) activation function was used for the hidden layers, whilst the output
layer was linear. The Adam optimisation algorithm [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ] was used together with
a learning rate scheduler that lowers the learning rate when the validation loss
reaches a plateau (the Adam optimisation algorithm adjusts the learning rate,
it is the upper bound that we reduced). Our loss function was the mean squared
error on the predicted acoustic features. The starting learning rate was xed at
0.004.
        </p>
        <p>For the bottleneck model we built 25 variations of voices with di erent con
gurations of the position of the hidden bottleneck layer, the size of the bottleneck
layer and the bottleneck features context size used in the acoustic model. The
test set was synthesized with each of these voices and objective measures (see
Section 4.4) applied in order to select the best model. MLPG was also used to
Layer index</p>
        <p>N/A
0
1
2
3</p>
        <p>N/A
32
64
32
64
32
64
32
64
smooth the generated features before synthesis, using the predicted means and
their delta and delta-deltas, but in contrast to the HMM-based voices, a global
pre-computed variance is used (because the model just predicts the means and
not the variances). No post- ltering was applied.</p>
        <p>Table 1 gives the objective results of the 25 voices built in order to select the
best combination of the position of the hidden bottleneck layer (\Layer index"),
the size of the bottleneck layer (\Bottleneck size") and the bottleneck features
context size (\Context size") as used in the acoustic model. The rst entry in
the table is a normal FFNN (without utilising the bottleneck scheme).</p>
        <p>We settled on a hidden bottleneck in the rst layer (Layer index = 0) with a
size of 64 units and a context size of 11. Even though the voicing classi cation
percentage error and Mel-cepstral distortion of the rst layer model with
bottleneck size 32 and context size 23 was marginally less than our selected model,
in-house testing could not discern the di erence between the synthesized test
sets of the two models and a model with a smaller context size should synthesize
faster.</p>
        <p>Based on this we built voices with the World and LPCNet features and
synthesized the test set. Both voices train on an Intel i7 4-core, 8-thread CPU
(2.80GHz) in about 1.5 hours (the same as the HMM-based voices), but we
did the bulk of the training of the 25 voices used for determining the model
parameters on Google Colab3 (which provides free GPUs) in about 35 minutes
per voice. We did not train a new model for the LPCNet vocoder, but rather
used one of the pre-trained models4. This is signi cant because it shows that the
vocoder can be trained on speech that is not from the same language as used
during synthesis time.
4.4</p>
      </sec>
      <sec id="sec-4-4">
        <title>Results</title>
        <p>
          The synthesized test set for each of the nal four voices were done against the
natural durations extracted from the alignments (see Section 4.1).
Objective Measures In order to quantitatively compare our search for the
bottleneck layer position, size and context size (see Section 4.3), as well as the
nal voices we used the following objective measures:
{ Mel-cepstral distortion (MCD), as de ned in [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ].
{ f0 Root mean squared error (RMSE), as de ned in [
          <xref ref-type="bibr" rid="ref31">31</xref>
          ].
{ f0 Mean absolute error (MAE), this is similar to RMSE, but the MAE is
less in uenced by large outliers than RMSE.
{ f0 Voicing classi cation error (VCE), as de ned in [
          <xref ref-type="bibr" rid="ref31">31</xref>
          ].
        </p>
        <p>Table 2 gives the objective measures of the
Sections 4.2 and 4.3.</p>
        <p>3https://colab.research.google.com
4https://media.xiph.org/lpcnet/data/
nal four voices as de ned in</p>
        <p>DNN LPCNet
77.83 2.65</p>
        <p>DNN World
40.31 3.38</p>
        <p>HMM LPCNet
50.26 2.95</p>
        <p>
          HMM World
37.42 2.94
Subjective Measures For subjective evaluation we ran a web-based MUltiple
Stimuli with Hidden Reference and Anchor (MUSHRA) [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ] listening test5. The
participants were asked to rate the stimuli in terms of naturalness, given the
reference speech recording. 34 people participated, and after post-screening 20
participants remained (the minimum to be signi cant [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ]). Participants who
scored the hidden reference stimuli less than 90 for more than 20% of the test
set were removed. The results are given in Figure 2.
        </p>
        <p>We also calculated the Wilcoxon signed-rank test to determine if the results
in Figure 2 are statistically signi cant between the voice pairs. The results are
given in Table 3.</p>
        <p>5Speech samples available at https://abylouw.github.io/fair2019_samples.
html</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Discussion and Conclusion</title>
      <p>It is interesting to note that the DNN World voice had the lowest MCD in
comparison to the reference test set and that this does not translate into better
perceived quality. The RMSE value of the DNN World voice is relatively high
in comparison to the other voices, but this is due to one outlier in the test
set, and therefore we also calculated the MAE. In total there were 200 combined
observations (20 participants and 10 audio sequences) of the DNN LPCNet voice
and the hidden reference (the MUSHRA subjective assessment has a hidden
reference waveform). Of the 200 combinations, there were 52 instances where
the DNN LPCNet voice was rated equal or better than the reference recording.
Although not statistically signi cant, it is still remarkable given that the corpus
is less than 1 hour in duration and that the synthesized test samples were not
seen by the model during the training stage.</p>
      <p>In this work we found that the possible gains brought on by the move from an
HMM-based acoustic model to a DNN-based acoustic model seem to be
dependent on the speci c vocoder, as there is not a statistically signi cant di erence
in the subjective evaluation results between the HMM World and DNN World
voices, but there is a signi cant di erence between the HMM LPCNet and DNN
LPCNet voices. It might be that our chosen architecture was too small for the
size of the feature set of the World vocoder (198 features) and this will require
more tests in the future. Another possible reason is that the DNN architecture
can learn the LPCNet features better than the HMM architectures, as the
difference as found in the subjective naturalness tests between DNN LPCNet and
DNN World are much larger than between HMM LPCNet and HMM World.</p>
      <p>In terms of training time the di erence between the traditional HMM-based
voices and the proposed architecture for the DNN-based voices are negligible on
CPUs, but the DNN-based voices can utilise GPUs for training which more than
halves the training time. In terms of run-time we found that the HMM-based
voices are about 27.83 times faster than real time, whilst the proposed
architecture for the DNN-based voices is about 5.25 times faster than real time, both
on a Intel i7 4-core, 8-thread CPU (2.80GHz). The HMM-based voices are thus
about 5.3 times faster than the DNN-based voices. In our view this is not a
significant hindrance towards the adoption of the proposed DNN-based architecture,
as the naturalness improvements brought on outweigh the speed de cit and the
proposed DNN-based architecture can still be utilised in real time settings. In
preliminary tests we also found that by using a sliding-window approach to the
MLPG parameter smoothing calculation utilising only the bottleneck context
size for the number of acoustic frames we can synthesize speech in a streaming
fashion with minimal loss in synthesized speech quality (imperceivable) versus
using the all the acoustic frames of the whole utterance.</p>
      <p>In future work we will focus on the duration model as well as intonation.
The tonal languages in South Africa represent a signi cant challenge for speech
synthesis, especially given the resource-scarce environment. We will also explore
using variational autoencoders (VAE) for the bottleneck model, given their
ability to learn a latent space.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Black</surname>
            ,
            <given-names>A.W.:</given-names>
          </string-name>
          <article-title>CMU Wilderness Multilingual Speech Dataset</article-title>
          .
          <source>In: ICASSP 2019- 2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)</source>
          . pp.
          <volume>5971</volume>
          {
          <fpage>5975</fpage>
          .
          <string-name>
            <surname>IEEE</surname>
          </string-name>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Campbell</surname>
          </string-name>
          , N.:
          <article-title>Developments in corpus-based speech synthesis: Approaching natural conversational speech</article-title>
          .
          <source>IEICE transactions on information and systems 88(3)</source>
          ,
          <volume>376</volume>
          {
          <fpage>383</fpage>
          (
          <year>2005</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Chung</surname>
            ,
            <given-names>Y.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hsu</surname>
            ,
            <given-names>W.N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhang</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Skerry-Ryan</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          :
          <article-title>Semi-Supervised Training for Improving Data E ciency in End-to-End Speech Synthesis</article-title>
          . arXiv e-prints arXiv:
          <year>1808</year>
          .
          <volume>10128</volume>
          (
          <year>Aug 2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Fujimoto</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hashimoto</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Oura</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nankaku</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tokuda</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          :
          <article-title>Impacts of Input Linguistic Feature Representation on Japanese End-to-End Speech Synthesis</article-title>
          .
          <source>In: 10th ISCA Speech Synthesis Workshop</source>
          . ISCA, Vienna, Austria (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>ITU-R</surname>
          </string-name>
          , R.:
          <source>BS</source>
          .
          <fpage>1534</fpage>
          -
          <lpage>1</lpage>
          .
          <article-title>Method for the subjective assessment of intermediate sound quality (MUSHRA)</article-title>
          .
          <source>International Telecommunications Union</source>
          ,
          <string-name>
            <surname>Geneva</surname>
          </string-name>
          (
          <year>2001</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Kalchbrenner</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Elsen</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Simonyan</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Noury</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Casagrande</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lockhart</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stimberg</surname>
          </string-name>
          , F., van den Oord, A.,
          <string-name>
            <surname>Dieleman</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kavukcuoglu</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          :
          <article-title>E cient Neural Audio Synthesis</article-title>
          . arXiv e-prints arXiv:
          <year>1802</year>
          .
          <volume>08435</volume>
          (
          <year>Feb 2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>King</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Measuring a decade of progress in text-to-speech</article-title>
          .
          <source>Loquens</source>
          <volume>1</volume>
          (
          <issue>1</issue>
          ),
          <volume>2386</volume>
          {
          <fpage>2637</fpage>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Kingma</surname>
            ,
            <given-names>D.P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ba</surname>
          </string-name>
          , J.:
          <article-title>Adam: A method for stochastic optimization</article-title>
          .
          <source>arXiv preprint arXiv:1412.6980</source>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Kominek</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schultz</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Black</surname>
            ,
            <given-names>A.W.</given-names>
          </string-name>
          :
          <article-title>Synthesizer voice quality of new languages calibrated with mean mel cepstral distortion</article-title>
          .
          <source>In: Spoken Languages Technologies for Under-Resourced Languages</source>
          (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Louw</surname>
            ,
            <given-names>J.A.</given-names>
          </string-name>
          :
          <article-title>Speect: a multilingual text-to-speech system</article-title>
          .
          <source>In: Proceedings of the Nineteenth Annual Symposium of the Pattern Recognition Association of South Africa</source>
          . pp.
          <volume>165</volume>
          {
          <fpage>168</fpage>
          .
          <string-name>
            <surname>Cape</surname>
            <given-names>Town</given-names>
          </string-name>
          , South Africa (
          <year>November 2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Louw</surname>
            ,
            <given-names>J.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Moodley</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Speaker Speci c Phrase Break Modeling with Conditional Random Fields for Text-to-Speech. In: Pattern Recognition Association of South Africa and Robotics</article-title>
          and Mechatronics International Conference (PRASARobMech). pp.
          <volume>1</volume>
          {
          <issue>6</issue>
          . IEEE, Stellenbosch, South Africa (
          <year>December 2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Morise</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yokomori</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ozawa</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          : WORLD:
          <article-title>a vocoder-based high-quality speech synthesis system for real-time application</article-title>
          .
          <source>IEICE TRANSACTIONS on Information and Systems</source>
          <volume>99</volume>
          (
          <issue>7</issue>
          ),
          <year>1877</year>
          {
          <year>1884</year>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13. van Niekerk,
          <string-name>
            <given-names>D.</given-names>
            ,
            <surname>de Waal</surname>
          </string-name>
          ,
          <string-name>
            <surname>A.</surname>
          </string-name>
          , Schlunz, G.:
          <article-title>Lwazi II Afrikaans TTS Corpus</article-title>
          . https://hdl.handle.
          <source>net/20.500.12185/443 (November</source>
          <year>2015</year>
          ), ISLRN:
          <fpage>570</fpage>
          -
          <lpage>884</lpage>
          - 577-153-6
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Shen</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pang</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Weiss</surname>
            ,
            <given-names>R.J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schuster</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jaitly</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yang</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          , Zhang,
          <string-name>
            <given-names>Y.</given-names>
            ,
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            ,
            <surname>Skerry-Ryan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            ,
            <surname>Saurous</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.A.</given-names>
            ,
            <surname>Agiomyrgiannakis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            ,
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <surname>Y.</surname>
          </string-name>
          :
          <article-title>Natural TTS Synthesis by Conditioning WaveNet on Mel Spectrogram Predictions</article-title>
          . arXiv e-prints
          <source>arXiv:1712.05884 (Dec</source>
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Silverman</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Beckman</surname>
            ,
            <given-names>M.E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pitrelli</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ostendorf</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wightman</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Price</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pierrehumbert</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hirschberg</surname>
            ,
            <given-names>J.:</given-names>
          </string-name>
          <article-title>ToBI: a standard for labeling English prosody</article-title>
          .
          <source>In: Proceedings of the Second International Conference on Spoken Language Processing (ICSLP)</source>
          . pp.
          <volume>867</volume>
          {
          <fpage>870</fpage>
          .
          <string-name>
            <surname>Alberta</surname>
          </string-name>
          , Canada (
          <year>October 1992</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Sproat</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Olive</surname>
            ,
            <given-names>J.:</given-names>
          </string-name>
          <article-title>An Approach to Text-to-Speech Synthesis</article-title>
          . In: Kleijn,
          <string-name>
            <given-names>W.</given-names>
            ,
            <surname>Paliwal</surname>
          </string-name>
          ,
          <string-name>
            <surname>K</surname>
          </string-name>
          . (eds.)
          <source>Speech Coding and Synthesis</source>
          . pp.
          <volume>611</volume>
          {
          <fpage>633</fpage>
          .
          <string-name>
            <surname>Elsevier</surname>
          </string-name>
          , Amsterdam, Netherlands (
          <year>1995</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Tachibana</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Uenoyama</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Aihara</surname>
            ,
            <given-names>S.:</given-names>
          </string-name>
          <article-title>E ciently Trainable Text-to-Speech System Based on Deep Convolutional Networks with Guided Attention</article-title>
          .
          <source>arXiv eprints arXiv:1710.08969 (Oct</source>
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Tokuda</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nankaku</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Toda</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zen</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yamagishi</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Oura</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          :
          <article-title>Speech synthesis based on hidden Markov models</article-title>
          .
          <source>Proceedings of the IEEE</source>
          <volume>101</volume>
          (
          <issue>5</issue>
          ),
          <volume>1234</volume>
          {
          <fpage>1252</fpage>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Tokuda</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yoshimura</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Masuko</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kobayashi</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kitamura</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Speech parameter generation algorithms for HMM-based speech synthesis</article-title>
          .
          <source>In: 2000 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No. 00CH37100)</source>
          . vol.
          <volume>3</volume>
          , pp.
          <volume>1315</volume>
          {
          <fpage>1318</fpage>
          .
          <string-name>
            <surname>IEEE</surname>
          </string-name>
          (
          <year>June 2000</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>Valin</surname>
            ,
            <given-names>J.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Skoglund</surname>
            ,
            <given-names>J.:</given-names>
          </string-name>
          <article-title>A Real-Time Wideband Neural Vocoder at 1.6 kb/s Using LPCNet</article-title>
          . arXiv preprint arXiv:
          <year>1903</year>
          .
          <volume>12087</volume>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <surname>Valin</surname>
            ,
            <given-names>J.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Skoglund</surname>
          </string-name>
          , J.: LPCNet:
          <article-title>Improving neural speech synthesis through linear prediction</article-title>
          .
          <source>In: ICASSP 2019-2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)</source>
          . pp.
          <volume>5891</volume>
          {
          <fpage>5895</fpage>
          .
          <string-name>
            <surname>IEEE</surname>
          </string-name>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          22. van den Oord, A.,
          <string-name>
            <surname>Dieleman</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zen</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Simonyan</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vinyals</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Graves</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kalchbrenner</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Senior</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kavukcuoglu</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          :
          <article-title>WaveNet: A Generative Model for Raw Audio</article-title>
          . arXiv e-prints
          <source>arXiv:1609.03499 (Sep</source>
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          23.
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Skerry-Ryan</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stanton</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wu</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Weiss</surname>
            ,
            <given-names>R.J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jaitly</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yang</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Xiao</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bengio</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Le</surname>
            ,
            <given-names>Q.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Agiomyrgiannakis</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Clark</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Saurous</surname>
            ,
            <given-names>R.A.</given-names>
          </string-name>
          :
          <article-title>Tacotron: Towards End-to-End Speech Synthesis</article-title>
          . arXiv e-prints
          <source>arXiv:1703.10135 (Mar</source>
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          24.
          <string-name>
            <surname>Watts</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Henter</surname>
            ,
            <given-names>G.E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fong</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Valentini-Botinhao</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Where do the improvements come from in sequence-to-sequence neural TTS? In: 10th ISCA Speech Synthesis Workshop</article-title>
          . ISCA, Vienna, Austria (
          <year>September 2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          25.
          <string-name>
            <surname>Wu</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>King</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Improving trajectory modelling for dnn-based speech synthesis by using stacked bottleneck features and minimum generation error training</article-title>
          .
          <source>IEEE/ACM Transactions on Audio, Speech and Language Processing (TASLP) 24(7)</source>
          ,
          <volume>1255</volume>
          {
          <fpage>1265</fpage>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          26.
          <string-name>
            <surname>Wu</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Valentini-Botinhao</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Watts</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>King</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Deep neural networks employing multi-task learning and stacked bottleneck features for speech synthesis</article-title>
          .
          <source>In: 2015 IEEE international conference on acoustics, speech and signal processing (ICASSP)</source>
          . pp.
          <volume>4460</volume>
          {
          <fpage>4464</fpage>
          .
          <string-name>
            <surname>IEEE</surname>
          </string-name>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          27.
          <string-name>
            <surname>Wu</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Watts</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>King</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Merlin: An Open Source Neural Network Speech Synthesis System</article-title>
          .
          <source>In: SSW</source>
          . pp.
          <volume>202</volume>
          {
          <issue>207</issue>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          28.
          <string-name>
            <surname>Yamagishi</surname>
            ,
            <given-names>J.:</given-names>
          </string-name>
          <article-title>An Introduction to HMM-Bbased Speech Synthesis</article-title>
          .
          <source>Tech. rep., The Centre for Speech Technology Research</source>
          , The University of Edinburgh (
          <year>October 2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          29.
          <string-name>
            <surname>Yamagishi</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>King</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Simple methods for improving speaker-similarity of HMMbased speech synthesis</article-title>
          .
          <source>In: 2010 IEEE International Conference on Acoustics, Speech and Signal Processing</source>
          . pp.
          <volume>4610</volume>
          {
          <fpage>4613</fpage>
          .
          <string-name>
            <surname>IEEE</surname>
          </string-name>
          (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          30.
          <string-name>
            <surname>Young</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Evermann</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gales</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hain</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kershaw</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Liu</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Moore</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Odell</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ollason</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Povey</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          , et al.:
          <article-title>The HTK book</article-title>
          . Cambridge University Engineering Department 3,
          <issue>175</issue>
          (
          <year>2002</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          31.
          <string-name>
            <surname>Yu</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Young</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Continuous f0 modeling for hmm based statistical parametric speech synthesis</article-title>
          .
          <source>IEEE Transactions on Audio, Speech, and Language Processing</source>
          <volume>19</volume>
          (
          <issue>5</issue>
          ),
          <volume>1071</volume>
          {
          <fpage>1079</fpage>
          (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          32.
          <string-name>
            <surname>Ze</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Senior</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schuster</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Statistical parametric speech synthesis using deep neural networks</article-title>
          .
          <source>In: 2013 ieee international conference on acoustics, speech and signal processing</source>
          . pp.
          <volume>7962</volume>
          {
          <fpage>7966</fpage>
          .
          <string-name>
            <surname>IEEE</surname>
          </string-name>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref33">
        <mixed-citation>
          33.
          <string-name>
            <surname>Zen</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tokuda</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Masuko</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kobayasih</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kitamura</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>A Hidden SemiMarkov Model-Based Speech Synthesis System</article-title>
          .
          <source>IEICE Transactions on Information and Systems E90-D(5)</source>
          ,
          <volume>825</volume>
          {834 (May
          <year>2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref34">
        <mixed-citation>
          34.
          <string-name>
            <surname>Zen</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tokuda</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Black</surname>
            ,
            <given-names>A.W.</given-names>
          </string-name>
          :
          <article-title>Statistical parametric speech synthesis</article-title>
          .
          <source>speech communication</source>
          <volume>51</volume>
          (
          <issue>11</issue>
          ),
          <volume>1039</volume>
          {
          <fpage>1064</fpage>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>