<!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>Towards a Response Selection System for Spoken Requests in a Physical Domain</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Andisheh Partovi</string-name>
          <email>andi.partovi@monash.edu</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ingrid Zukerman</string-name>
          <email>ingrid.zukerman@monash.edu</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Quan Tran</string-name>
          <email>quan.tran@monash.edu</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Faculty of Information Technology, Monash University Clayton</institution>
          ,
          <addr-line>VICTORIA 3800</addr-line>
          ,
          <country country="AU">AUSTRALIA</country>
        </aff>
      </contrib-group>
      <fpage>20</fpage>
      <lpage>27</lpage>
      <abstract>
        <p>In this paper, we introduce a corpus comprising requests for objects in physical spaces, and responses given by people to these requests. We generated two datasets based on this corpus: a manually-tagged dataset, and a dataset which includes features that are automatically extracted from the output of a Spoken Language Understanding module. These datasets are used in a classification-based approach for generating responses to spoken requests. Our results show that, surprisingly, classifiers trained on the second dataset outperform those trained on the first, and produce acceptable levels of performance.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>In recent times, there have been significant improvements
in Automatic Speech Recognition (ASR) [Chorowski et al.,
2015; Bahdanau et al., 2016]. For example, a research
prototype of a spoken slot-filling dialogue system reported a Word
Error Rate (WER) of 13.8% when using “a generic dictation
ASR system” [Mesnil et al., 2015], and Google reported an
8% WER for its ASR API.1 However, this API had a WER
of 54.6% when applied to the Let’s Go corpus [Lange and
Suendermann-Oeft, 2014].</p>
      <p>ASR errors not only produce wrongly recognized entities
or actions, but may also yield ungrammatical utterances that
cannot be processed by a Spoken Language Understanding
(SLU) system (e.g., “the plate inside the microwave” being
mis-heard as “of plating sight the microwave”), or yield
incorrect results when processed by an SLU system (e.g., due
to fillers such as “hmm” being mis-heard as “and” or “on”).</p>
      <p>The problems caused by ASR errors are exacerbated by the
fact that people often express themselves ambiguously or
inaccurately [Trafton et al., 2005; Moratz and Tenbrink, 2006;
Funakoshi et al., 2012; Zukerman et al., 2015]. An
ambiguous reference to an object matches several objects well, while
an inaccurate reference matches one or more objects partially.
For instance, in a household domain, a reference to a “big
blue mug” is ambiguous if there is more than one big blue
mug in the room, and inaccurate if there are two mugs in the
1venturebeat.com/2015/05/28/google-says-its-speechrecognition-technology-now-has-only-an-8-word-error-rate.
room, one big and red, and one small and blue. Further,
ambiguous or inaccurate references may occur as a result of
differences in parse trees (e.g., due to variants in prepositional
attachments).</p>
      <p>In addition to improving ASR and SLU modules,
Spoken Dialogue Systems (SDSs) must be able to cope with
these problems by generating appropriate responses to users’
spoken utterances. Recently, deep-learning algorithms have
been used for response generation [Serban et al., 2016;
Yang et al., 2016]. However, these algorithms rely solely on
requests and responses, without taking into account the
(extra linguistic) context, and typically require large amounts of
data, which may not be available in some applications. In this
paper, we offer a supervised-learning approach to
responsegeneration that is suitable for smaller datasets. Our approach
harnesses the properties of utterances, dialogue history and
context to choose response types for users’ requests.</p>
      <p>To obtain an upper bound for classifier performance, we
trained a classifier using human-observable features of
spoken requests and response types selected by participants for
these requests. We then trained a second classifier using
features that were automatically extracted from the output
produced by our SLU system (Section 5). Surprisingly, the
second classifier produced significantly better results than the
first one.</p>
      <p>The rest of this paper is organized as follows. In the next
section, we discuss related work. Our corpus is described
in Section 3. In Section 4, we detail the human-observable
features and the response-classification results obtained with
them. We then offer a brief account of our SLU system,
followed by a description of the features that are automatically
extracted from its output and the resultant classification
performance. Concluding remarks appear in Section 7.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Related Work</title>
      <p>Decision-theoretic approaches have been the accepted
standard for response generation in dialogue systems for some
time [Carlson, 1983]. These approaches were initially
implemented in SDSs in the form of Influence Diagrams that make
myopic (one-shot) decisions regarding dialogue acts [Paek
and Horvitz, 2000], procedures that optimize responses
[Inouye and Biermann, 2005; Sugiura et al., 2009], and
Dynamic Decision Networks that make decisions about
dialogue acts over time [Horvitz et al., 2003; Liao et al., 2006].
Later on, reinforcement learning was employed to learn
optimal policies over time [Lemon, 2010], with particular
attention being paid to Partially Observable Markov Decision
Processes [Williams and Young, 2007; Young et al., 2013;
Gasˇic´ and Young, 2014], and their extension Hidden
Information State [Young et al., 2007; Young et al., 2013].
Owing to the complexity of these formalisms, they have been
used mainly in slot-filling applications, e.g., making airline
and restaurant reservations [Young et al., 2013].</p>
      <p>Recently, deep learning has been applied to various aspects
of SDSs [Wen et al., 2015; Li et al., 2016; Mrksˇic et al., 2016;
Prakash et al., 2016; Serban et al., 2016; Yang et al., 2016].
Wen et al. [2015] focused on the generation of
linguistically varied responses, and Mrksˇic et al. [2016] proposed a
dialogue-state tracking framework. The generation of
dialogue contributions was studied in [Li et al., 2016; Prakash et
al., 2016] for chatbots; in [Serban et al., 2016] for help-desk
responses and Twitter follow-up statements; and in [Yang
et al., 2016] for slot tagging, and user-intent and
systemaction prediction in slot-filling applications. A combination
of deep learning and reinforcement learning has been used
in end-to-end dialogue systems that query a knowledge-base,
where user utterances are mapped to a clarification
question or a knowledge-base query [Williams and Zweig, 2016;
Zhao and Eskenazi, 2016; Dhingra et al., 2017]. All these
systems learn to generate complete responses from large
corpora comprising request-response pairs.</p>
      <p>Our work follows this supervised-learning trend in a setting
where the appropriateness of a response depends both on the
request and on the physical context. Further, our dataset is
significantly smaller than those used by neural mechanisms.
3</p>
    </sec>
    <sec id="sec-3">
      <title>The Corpus</title>
      <p>Our corpus, which was gathered in two experiments,
comprises requests to fetch or move household objects, and
responses to these requests.</p>
      <p>Experiment 1 – This experiment replicates the experiment
described in [Zukerman et al., 2015] using the Google ASR
API, instead of Microsoft Speech SDK 6.1 — the WER of
the Google API was 13% for our corpus. 35 participants were
asked to describe 12 designated objects (labelled A to L) in
the scenarios depicted in Figure 1. Each scenario contains
between 8 and 16 household objects varying in size, colour and
position. The participants were allowed to repeat a
description up to two times. In total, they recorded 478 descriptions
such as the following: “the computer under the table”, “the
picture on the wall”, “the green plate next to the screwdriver
at the top of the table”, “the plate in the corner of the table”,
and “the large pink ball in the middle of the room”.
Experiment 2 – This experiment took the form of an online
survey where participants had to indicate how they would
respond to a (potentially mis-heard) request. Each participant
was shown the top four ASR outputs for the request versions
of 12 descriptions generated by one participant in the first
experiment, along with the images in Figure 1. For instance,
“the pot plant on the table”, uttered in the context of
Figure 1(a), was converted to “get the pot plant on the table”; and
“the green bookcase”, uttered in the context of Figure 1(d),
was presented as “move the green bookcase”.</p>
      <p>Each participant was then asked to choose a response for
each request from the following four response types
(participants were given a description of each response type):
DO: suitable when the addressee is sure about which
object the request refers to.</p>
      <p>CONFIRM: suitable when the addressee feels the need to
confirm the requested object before taking action.
CHOOSE: suitable when the addressee hesitates between
several objects.</p>
      <p>REPHRASE: suitable when part or all of a request is so
unintelligible that the addressee cannot understand it.</p>
      <p>These choices were made under two cost settings: low-cost
– where participants were told that the requested object must
be delivered to someone in the same room; and high-cost –
where they were told that the object must be delivered to a
faraway location. These settings were designed to discriminate
between situations where mistakes are fairly inconsequential
and situations where mistakes are costly.</p>
      <p>40 people took part in this experiment (six of them also
participated in the first experiment); half of the participants were
native English speakers, and half were male. Thirteen
people participated in an initial version of the experiment where
they first chose response types for all the requests under the
low-cost setting, and then chose response types for the same
requests under the high-cost setting. We modified the
experiment on the basis of the participants’ feedback, so that
the remaining 27 participants considered each request under
the low-cost setting, and were immediately asked how their
response would differ under the high-cost setting. This
experimental variation had no effect on response-classification
performance (Sections 4.1 and 6.1).</p>
      <p>To determine the effect of personal variations on
classification performance, one of the authors, who is familiar with
the system, selected response types for all the requests.</p>
      <sec id="sec-3-1">
        <title>3.1 Analysis and Post Processing</title>
        <p>In total, we collected 960 request-response pairs (=
12 requests 2 cost factors 40 participants). 24.2% of these
requests had an unintelligible semantic role in at least one
ASR output, with the vast majority occurring in the OBJECT
of the descriptions; 17.9% were ambiguous (i.e., they had
more than one reasonable referent); and only 3.8% were
inaccurate (i.e., they did not match perfectly any referent).</p>
        <p>In order to train both classifiers on the same corpus, we
removed requests that don’t fit the requirements of the
automatic feature-extraction process (Section 6). Specifically,
we excluded 62 descriptions (13%) that had more than one
prepositional phrase, and 43 descriptions (9%) that could not
be processed by our SLU module [Zukerman et al., 2015]
(Section 5). As a result, our corpus contains 375
descriptions, which yield a total of 750 requests for both cost
settings. The responses to these requests were distributed as
follows: 51.9% DO (majority class), 21.6% CHOOSE, 14.1%
REPHRASE, and 12.4% CONFIRM.</p>
        <p>It is worth noting that the response types chosen for the
excluded requests were included in the dataset as features in
(a) Positional relations in a room
(b) Colour, size and positional relations on a table
(c) Projective and positional relations on a table
(d) Colour, size and positional relations in a room
order to enable us to determine the effect of dialogue
history on performance (Sections 4 and 6). Clearly, removing
requests disrupts the actual sequence of events, which has
an adverse effect on the performance of sequence classifiers
(Section 4.2). In the near future, we will address this problem
by including a feature set for all the requests in a sequence.
4</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Classification with Manually-Tagged</title>
    </sec>
    <sec id="sec-5">
      <title>Features</title>
      <p>Two team members annotated each description obtained from
the first experiment with the following features, which are
indicative of inaccuracy and ambiguity, and were deemed
relevant to a person’s decision regarding how to respond to a
request (the first annotator labelled the features, and the
second annotator verified the annotations; disagreements were
resolved by consensus).
1. Unintelligible role – This is the semantic role of a
garbled portion of a description, where the possible values
are fNONE, ALL, OBJECT, LANDMARK, OTHERg. For
example, “the hottest under the table” has an
unintelligible OBJECT, and “the green plate on the left of the Blues
play” has an unintelligible LANDMARK.
2. # of reasonable interpretations – How many objects are
reasonable referents for a description? For instance, the
first of the above requests has two reasonable referents in
the context of Figure 1(a), as there are only two objects
under the table. Similarly, the two green plates on the
to Feature #3. However, since we are considering only
interpretations that match a request perfectly, there is no
need to take into account phonetic similarity.</p>
      <sec id="sec-5-1">
        <title>4.1 Response Classification</title>
        <p>We experimented with several classification algorithms,
including Na¨ıve Bayes, Support Vector Machines, Decision
Trees (DT) and Random Forests (RF), to learn response types
from the data collected in our experiments. Here we report on
the results obtained with DT and RF, which had the best
performance.2 We used the above features to determine baseline
performance, and experimented with four additional features:
Gender; English nativeness – whether the participant is a
native English speaker; 3-Back responses (vector of length 4) –
the counts of the response types provided by an Experiment 2
participant for the three preceding requests;3 and Cost – high
or low. This feature worsened performance in all cases, and
was removed.</p>
        <p>We performed 10-fold cross-validation to evaluate
classifier performance; statistical significance was computed using
the Wilcoxon signed-ranked test. Rows 2-4 in Table 1 display
the best results obtained by our classifiers for each feature
configuration.</p>
        <p>RF yielded the best results for the manually-tagged
features alone, and for these features plus Gender and English
nativeness; while DT produced the best results overall when
3-Back responses were added (statistically significant with
pvalue=0.05). The most influential features in the decision tree
were # of perfect interpretations, # of reasonable
interpretations with phonetic similarity, and # of rephrases in 3-Back
responses. The per-class performance of DT appears in the
second and third columns of Table 5. Note the poor precision
and recall obtained for CONFIRM, which was often confused
with DO. DT’s deficient performance for REPHRASE may be
attributed to the fact that requests that had the same features,
in particular those with partially or completely unintelligible
ASR outputs, elicited the different responses from the
participants.</p>
        <p>As mentioned in Section 3, we also trained and tested the
classifiers using response types selected by only one
person – the first author. The best performance was achieved
with an RF classifier that includes 3-Back responses, denoted
RF1P. This performance was much better than of the
classifiers trained with the response types of 40 participants, which
indicates that personal attributes affect people’s responses.4</p>
      </sec>
      <sec id="sec-5-2">
        <title>4.2 Sequence Classification</title>
        <p>In order to investigate the influence of a sequence of
requestresponse pairs on future responses, we trained and tested a
2We used over- and under-sampling to try to deal with the large
majority class, but neither affected the classifiers’ performance.</p>
        <p>3We experimented with several sequence lengths, of which
3Back yielded the best results. We also investigated a setting where
the counts of the response types chosen for all the other 23 requests
were used as features. This setting, which is clearly unfeasible, gave
the best results, achieving 0.70 precision and 0.68 recall.</p>
        <p>4We tried to address this issue by clustering users based on the
number of times they chose each response type, but didn’t get good
clusters for k &lt; 10.
Recurrent Neural Network (RNN) as a sequence classifier.</p>
        <p>Our RNN model is based on the Long-Short-Term-Memory
(LSTM) architecture [Hochreiter and Schmidhuber, 1997],
which can capture long-range dependencies. If we denote
the features of the t-th utterance as ft, the hidden state of the
RNN at time step t + 1 is calculated as a function of the input
at time step t + 1, ft+1, and the previous hidden state, ht:
ht+1 = LSTM(ht; ft+1). With this mechanism, the model
maps the sequence of features to a sequence of hidden
vectors, which are decoded into a sequence of labels by a linear
neural net layer: yt softmax(W ht + b):</p>
        <p>A natural extension of this model is to stack the LSTM
layers, i.e., the outputs of the first LSTM layer are given as input
to the second layer, and so on; our model stacks 15 layers of
LSTMs. This model was implemented with Keras [Chollet,
2017] and Theano [Theano Development Team, 2016], and
was trained to minimize categorical cross-entropy loss using
the Adam SGD learner [Kingma and Ba, 2014].</p>
        <p>Owing to time limitations, we performed only 5-fold
crossvalidation. The results of the RNN appear in the penultimate
row of Table 1. The RNN’s disappointing performance may
be attributed to the relatively small dataset combined with the
disruption of several sequences due to the removal of
requestresponse pairs (in order to reduce sequence disruption, we
retained the 43 pairs corresponding to descriptions that could
not be processed by our SLU system).
5</p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>The SLU System Scusi?</title>
      <p>Scusi? [Zukerman et al., 2015] is a system that implements
an anytime, numerical mechanism for the interpretation of
spoken descriptions, focusing on a household context. It has
four processing stages, where (intermediate) interpretations
in each stage can have multiple parents in the previous stage,
Speech wave:
tAhSeRboruotwpunt s1t:ool near the table
UCG−1
ICG−1
and can produce multiple children in the next stage; early
processing stages may be probabilistically revisited; and only the
most promising options in each stage are explored further.
Scusi’s workflow – The system takes as input a speech signal,
and uses an ASR to produce candidate texts. Each text is
assigned a score given the speech wave, and passed to an
errordetection module that postulates which words were correctly
or wrongly recognized by the ASR [Zukerman and Partovi,
2017] — this component is required, as in real life we don’t
have access to transcriptions. Next, Scusi? applies Charniak’s
probabilistic parser (bllip.cs.brown.edu/resources.
shtml#software) to syntactically analyze the texts,
yielding at most 50 parse trees per text. The third stage applies
mapping rules to the parse trees to generate Uninstantiated
Concept Graphs (UCGs) [Sowa, 1984] that represent the
semantics of the descriptions. The final stage instantiates the
UCGs with objects and relations from the current context, and
returns candidate Instantiated Concept Graphs (ICGs) ranked
in descending order of merit (score).</p>
      <p>Figure 3 illustrates this process for the description “the
brown stool near the table” in the context of Figure 1(d). All
stages produce several outputs, but we show only two outputs
for each of three stages (ASR, UCG and ICG). In addition,
in this example, both UCGs are parents of the two ICGs, but
only the match with ICG-1 is shown in Figure 3. The first
ASR output is correct, and the second has “blown store”
instead of “brown stool”. Each of these outputs yields one UCG
(via a parse tree), where the object in the second UCG has
an unknown attribute, as Scusi? doesn’t recognize the
modifier “blown” (unknown attributes occur when a user employs
out-of-vocabulary noun modifiers or the ASR mis-recognizes
noun modifiers).</p>
      <p>The score of each ICG depends on two factors: (1) how
well the concepts and relations in it match the corresponding
concepts and relations in its parent UCGs, and (2) how well
the relations in the ICG match the context. For example,
ICG1 matches UCG-1 well, as stool-L can be called “stool” and
it is brown, and table-1 can be called “table”; but its
matchscore with UCG-2 is lower, as stool-L cannot be called
“store” and doesn’t match the unknown attribute specified in
UCG-2. ICG-1 matches the context well, as stool-L is near
table-1. The details of the calculation of the scores are
described in [Zukerman et al., 2015]. The aspects that are most
relevant to this paper are that scores are represented on a
logarithmic scale in order to avoid underflow, and scores of value
0 are smoothed to a low value in order not to invalidate any
interpretation.
6</p>
    </sec>
    <sec id="sec-7">
      <title>Classification with Automatically-Extracted</title>
    </sec>
    <sec id="sec-8">
      <title>Features</title>
      <p>We automatically extracted features from the top-10 ICGs
generated by Scusi? for each description (the correct
interpretation is in the top-10 ICGs in about 90% of the cases)
— these features appear in Tables 2 and 3. The features in
Table 2, extracted from the output of Scusi?’s word-error
detector, pertain to the intelligibility of the descriptions. The
second and third feature in Table 2 are among the most
influential ones.5 The last feature is noteworthy because, even
though only one ASR output is correct, the error-detection
component may decide that several ASR outputs are correct,
e.g., “the flower on the table” and “the flour on the table”.</p>
      <p>The first feature in Table 3 represents the ambiguity of a
description through the similarity between the scores of
successive top-ranked ICGs, which is encoded as the ratio
between the (logarithmic) score of the i+1-th ICG and the score
of the i-th ICG. When this ratio between neighbouring ICGs
is below an empirically-derived threshold, they are deemed
similar. This feature is among the most influential ones.</p>
      <p>The remaining features in Table 3 pertain to the accuracy
of a description, which is represented by the goodness of the
match between an ICG and its parent UCGs, and between
an ICG and the context. The second feature, which
represents the accuracy of the location specified in a description,
is among the most influential ones (for ICGs ranked 4th, 6th
and 9th).</p>
      <p>5The frequency of features in the top-two levels of 100 trees
generated by RF was used as a proxy for their importance.</p>
      <p>As seen in Figure 3, content nodes (objects and landmarks)
in UCGs may have colour and size descriptors, as well as
unknown attributes. The first six per-node features in Table 3
represent the goodness of attribute matches between the
content nodes (object and landmark) of an ICG and the
corresponding nodes in its parent UCGs. Two size-match features,
one colour-match feature and one unknown feature for
objects of ICGs at various ranks are among the most influential
features.</p>
      <p>The last row in Table 3 represents the goodness of lexical
matches between the nodes in an ICG and the corresponding
nodes in its parent UCGs. This feature is among the most
influential for the objects of most of the top-10 ICGs.</p>
      <p>To illustrate these features, let’s return to the UCG-ICG
matches in Figure 3 for the request “move the brown stool
near the table” in the context of Figure 1(d). The score of the
top-ranked ICG, viz ICG-1, is significantly higher than that
of ICG-2. Hence, the value of the first feature in Table 3 is
1. As mentioned above, stool-L is near table-1, yielding
a high location match score for ICG-1. 50% of the UCG
parents have a lexical match with the object in ICG-1, as “store”
doesn’t match any designation of stool-L; but 100% of the
UCG parents have a lexical match with the landmark in
ICG1 (table-1). Due to the unknown attribute in the object of
UCG-2, the maximum number of unknowns for the ICG-1
object is 1, and the percentage of UCG parents that have
unknowns for the ICG-1 object is 50%; while 0% of UCG
parents have unknowns for the ICG-1 landmark. Since the colour
specified in UCG-1 matches the colour of stool-L, the
maximum colour match for the object of ICG-1 is 1, but the
percentage of UCG parents with a colour match for the ICG-1
object is 50%, as UCG-2 doesn’t have a colour attribute.
6.1</p>
      <sec id="sec-8-1">
        <title>Response Classification</title>
        <p>We experimented with the classifiers considered in
Section 4.1, except the RNN, using the 165 features described
in Tables 2 and 3, instead of the manually-obtained ones.6
The RNN was omitted due to the above-described removal
of requests, which disrupts the sequence. As before, we
performed 10-fold cross-validation.</p>
        <p>Table 4 displays our results. The classifier with the
best performance for a particular configuration of
manuallytagged features also had the best performance for the
corresponding configuration of automatically-extracted features.
Surprisingly, overall performance with these features was
significantly better (with p-value=0.01) than the performance
obtained with the manually-tagged features, both for the
responses given by 40 participants and for the responses
provided by one person. In the former case, 3-Back responses
had an adverse effect on performance, and in the latter case,
it had no effect. The best performance for the 40-participant
dataset was obtained with RF plus Gender and English
nativeness, but the differences between the classifiers were not
statistically significant. The per-class performance of this
classifier appears in the fourth and fifth columns of Table 5.
As for the manually-tagged features, the worst precision and
6Applying Principal Components Analysis to reduce the number
of features had no effect on the classifiers’ performance.
recall were obtained for CONFIRM, but the performance for
REPHRASE was only slightly worse than for the other classes.
7</p>
      </sec>
    </sec>
    <sec id="sec-9">
      <title>Conclusion and Future Work</title>
      <p>We have offered a corpus comprising requests for objects in
physical spaces, and the responses given by people for these
requests. We generated two datasets based on this corpus: a
manually-tagged dataset, and a dataset which includes
features that are automatically extracted from the output of an
SLU module. These datasets were used in a
classificationbased approach for generating responses to spoken requests.</p>
      <p>Our results show that, surprisingly, classifiers trained on
the second dataset outperformed those trained on the first.
As mentioned in Section 4, analysis of the data reveals that
different users often provide different responses for requests
that have identical manually-tagged features. For instance,
three participants who were shown the following ASR
outputs responded with DO, CONFIRM and REPHRASE (the
option chosen by our classifier): (1) “get a blade in the rights of
the disabled”, (2) “get I played in the rights of the disabled”,
(3) “get I played in the right of the devil”, and (4) “get a blade
in the right of the devil”. This discrepancy may be partially
due to a mixture of individual ability to compensate for
misheard utterances combined with risk-taking attitude — traits
that may be related to the English nativeness and Gender
features respectively, which improve performance. In light of
this, we posit that additional features that reflect personal
disposition could yield further improvements. This notion is
reinforced by the significantly better classification performance
for the responses obtained from a single user (albeit one
familiar with the system) compared with the performance for
the responses of 40 participants.</p>
      <p>A complementary explanation for the worse classification
performance obtained for the manually-tagged dataset is that
this dataset encodes intelligibility, ambiguity and accuracy
of descriptions in a general way, while the specific
information encoded in the automatically-extracted dataset (i.e.,
lexical, colour, size and location match for each of the
top10 ICGs) is important for classification. The only aspect
where the manual encoding is more informative than the
automatic encoding pertains to phonetic similarity, which is one
of the most influential features for this dataset. In the future,
we will incorporate specific features about lexical, colour,
size and location match and out-of-vocabulary words into
the manually-generated tags, and phonetic-similarity into the
automatically-extracted features.</p>
      <p>In terms of dialogue history, our results are
inconclusive. Our hypothesis that dialogue history affects users’
choices was confirmed (for three preceding requests) for
the manually-tagged requests, but not for the
automaticallytagged ones.</p>
      <p>Finally, as noted in [Inouye and Biermann, 2005; Singh
et al., 2002], users may be satisfied with responses that
differ from those provided by human consultants. To test this
idea, we propose to conduct a follow-up experiment, where
participants will be asked to rate the suitability of responses
generated by our best classifier.</p>
    </sec>
    <sec id="sec-10">
      <title>Acknowledgements</title>
      <p>This research was supported in part by grant DP120100103
from the Australian Research Council.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [Bahdanau et al.,
          <year>2016</year>
          ]
          <string-name>
            <given-names>D.</given-names>
            <surname>Bahdanau</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Chorowski</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Serdyuk</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Y.</given-names>
            <surname>Bengio</surname>
          </string-name>
          .
          <article-title>End-to-end attention-based large vocabulary speech recognition</article-title>
          .
          <source>In ICASSP'2016 - Proceedings of the 2016 IEEE International Conference on Acoustic, Speech and Signal Processing</source>
          , pages
          <fpage>4945</fpage>
          -
          <lpage>4949</lpage>
          , Shanghai, China,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          <source>[Carlson</source>
          , 1983]
          <string-name>
            <given-names>L.</given-names>
            <surname>Carlson</surname>
          </string-name>
          .
          <article-title>Dialogue Games: An Approach to Discourse Analysis</article-title>
          . D. Reidel Publishing Company, Dordrecht, Holland, Boston,
          <year>1983</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          <source>[Chollet</source>
          , 2017]
          <string-name>
            <given-names>F.</given-names>
            <surname>Chollet</surname>
          </string-name>
          . Keras. https://github.com/ fchollet/keras,
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [Chorowski et al.,
          <year>2015</year>
          ]
          <string-name>
            <given-names>J.K</given-names>
            <surname>Chorowski</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Bahdanau</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Serdyuk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Cho</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Y.</given-names>
            <surname>Bengio</surname>
          </string-name>
          .
          <article-title>Attention-based models for speech recognition</article-title>
          . In C. Cortes,
          <string-name>
            <given-names>N. D.</given-names>
            <surname>Lawrence</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. D.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Sugiyama</surname>
          </string-name>
          , and R. Garnett, editors,
          <source>Advances in Neural Information Processing Systems</source>
          <volume>28</volume>
          , pages
          <fpage>577</fpage>
          -
          <lpage>585</lpage>
          . Curran Associates, Inc.,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [Dhingra et al.,
          <year>2017</year>
          ]
          <string-name>
            <given-names>B.</given-names>
            <surname>Dhingra</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Gao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.N.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Ahmed</surname>
          </string-name>
          , and
          <string-name>
            <given-names>L.</given-names>
            <surname>Deng</surname>
          </string-name>
          .
          <article-title>Towards end-to-end reinforcement learning of dialogue agents for information access</article-title>
          .
          <source>In ACL'17 - Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics</source>
          , Vancouver, Canada,
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [Funakoshi et al.,
          <year>2012</year>
          ]
          <string-name>
            <given-names>K.</given-names>
            <surname>Funakoshi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Nakano</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Tokunaga</surname>
          </string-name>
          , and
          <string-name>
            <given-names>R.</given-names>
            <surname>Iida</surname>
          </string-name>
          .
          <article-title>A unified probabilistic approach to referring expressions</article-title>
          .
          <source>In SIGDIAL'2012 - Proceedings of the 13th SIGdial Meeting on Discourse and Dialogue</source>
          , pages
          <fpage>237</fpage>
          -
          <lpage>246</lpage>
          , Seoul, South Korea,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          <source>[Gasˇic´ and Young</source>
          , 2014]
          <string-name>
            <surname>M.</surname>
          </string-name>
          <article-title>Gasˇic´ and</article-title>
          <string-name>
            <given-names>S.J.</given-names>
            <surname>Young</surname>
          </string-name>
          .
          <article-title>Gaussian processes for POMDP-based dialogue manager optimization</article-title>
          .
          <source>IEEE/ACM Transactions on Audio, Speech &amp; Language Processing</source>
          ,
          <volume>22</volume>
          (
          <issue>1</issue>
          ):
          <fpage>28</fpage>
          -
          <lpage>40</lpage>
          ,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          <source>[Hochreiter and Schmidhuber</source>
          , 1997]
          <string-name>
            <given-names>S.</given-names>
            <surname>Hochreiter</surname>
          </string-name>
          and
          <string-name>
            <given-names>J.</given-names>
            <surname>Schmidhuber</surname>
          </string-name>
          .
          <article-title>Long short-term memory</article-title>
          .
          <source>Neural Computation</source>
          ,
          <volume>9</volume>
          (
          <issue>8</issue>
          ):
          <fpage>1735</fpage>
          -
          <lpage>1780</lpage>
          ,
          <year>1997</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [Horvitz et al.,
          <year>2003</year>
          ]
          <string-name>
            <given-names>E.</given-names>
            <surname>Horvitz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Kadie</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Paek</surname>
          </string-name>
          , and
          <string-name>
            <given-names>D.</given-names>
            <surname>Hovel</surname>
          </string-name>
          .
          <article-title>Models of attention in computing and communication: From principles to applications</article-title>
          .
          <source>Communications of the ACM</source>
          ,
          <volume>46</volume>
          (
          <issue>3</issue>
          ):
          <fpage>52</fpage>
          -
          <lpage>57</lpage>
          ,
          <year>2003</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          <source>[Inouye and Biermann</source>
          , 2005]
          <string-name>
            <given-names>B.</given-names>
            <surname>Inouye</surname>
          </string-name>
          and
          <string-name>
            <given-names>A.</given-names>
            <surname>Biermann</surname>
          </string-name>
          .
          <article-title>An algorithm that continuously seeks minimum length dialogs</article-title>
          .
          <source>In Proceedings of the 4th IJCAI Workshop on Knowledge and Reasoning in Practical Dialogue Systems</source>
          , pages
          <fpage>62</fpage>
          -
          <lpage>67</lpage>
          , Edinburgh, Scotland,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          <source>[Kingma and Ba</source>
          , 2014]
          <string-name>
            <given-names>D.</given-names>
            <surname>Kingma</surname>
          </string-name>
          and
          <string-name>
            <given-names>J.</given-names>
            <surname>Ba</surname>
          </string-name>
          .
          <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="ref12">
        <mixed-citation>
          [Lange and
          <string-name>
            <surname>Suendermann-Oeft</surname>
          </string-name>
          ,
          <year>2014</year>
          ]
          <string-name>
            <given-names>P.</given-names>
            <surname>Lange and D.</surname>
          </string-name>
          Suendermann-Oeft.
          <article-title>Tuning Sphinx to outperform Google's speech recognition API</article-title>
          .
          <source>In ESSV2014 - Proceedings of the Conference on Electronic Speech Signal Processing</source>
          , Dresden, Germany,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          <source>[Lemon</source>
          ,
          <year>2010</year>
          ]
          <string-name>
            <given-names>O.</given-names>
            <surname>Lemon</surname>
          </string-name>
          .
          <article-title>Learning what to say and how to say it: Joint optimisation of spoken dialogue management and natural language generation</article-title>
          .
          <source>Computer Speech and Language</source>
          ,
          <volume>25</volume>
          (
          <issue>2</issue>
          ):
          <fpage>210</fpage>
          -
          <lpage>221</lpage>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          <string-name>
            <surname>[Li</surname>
          </string-name>
          et al.,
          <year>2016</year>
          ]
          <string-name>
            <given-names>J.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Monroe</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Ritter</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Galley</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Gao</surname>
          </string-name>
          , and
          <string-name>
            <given-names>D.</given-names>
            <surname>Jurafsky</surname>
          </string-name>
          .
          <article-title>Deep reinforcement learning for dialogue generation</article-title>
          .
          <source>In EMNLP2016 - Proceedings of the 2016 Conference on Empirical Methods in Natural Language Processing</source>
          , pages
          <fpage>1192</fpage>
          -
          <lpage>1202</lpage>
          , Austin, Texas,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [Liao et al.,
          <year>2006</year>
          ]
          <string-name>
            <given-names>W.</given-names>
            <surname>Liao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Zhu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Ji</surname>
          </string-name>
          , and
          <string-name>
            <given-names>W.D.</given-names>
            <surname>Gray</surname>
          </string-name>
          .
          <article-title>Toward a decision-theoretic framework for affect recognition and user assistance</article-title>
          .
          <source>International Journal of HumanComputer Studies</source>
          ,
          <volume>64</volume>
          :
          <fpage>847</fpage>
          -
          <lpage>873</lpage>
          ,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [Mesnil et al.,
          <year>2015</year>
          ]
          <string-name>
            <given-names>G.</given-names>
            <surname>Mesnil</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Dauphin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Yao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Bengio</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Deng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.Z.</given-names>
            <surname>Hakkani-Tu¨</surname>
          </string-name>
          r,
          <string-name>
            <given-names>X.</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.P.</given-names>
            <surname>Heck</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Tur</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Yu</surname>
          </string-name>
          , and
          <string-name>
            <surname>G. Zweig.</surname>
          </string-name>
          <article-title>Using recurrent neural networks for slot filling in spoken language understanding</article-title>
          .
          <source>IEEE/ACM Transactions on Audio, Speech &amp; Language Processing</source>
          ,
          <volume>23</volume>
          (
          <issue>3</issue>
          ):
          <fpage>530</fpage>
          -
          <lpage>539</lpage>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          <source>[Moratz and Tenbrink</source>
          , 2006]
          <string-name>
            <given-names>R.</given-names>
            <surname>Moratz</surname>
          </string-name>
          and
          <string-name>
            <given-names>T.</given-names>
            <surname>Tenbrink</surname>
          </string-name>
          .
          <article-title>Spatial reference in linguistic human-robot interaction: Iterative, empirically supported development of a model of projective relations</article-title>
          .
          <source>Spatial Cognition &amp; Computation: An Interdisciplinary Journal</source>
          ,
          <volume>6</volume>
          (
          <issue>1</issue>
          ):
          <fpage>63</fpage>
          -
          <lpage>107</lpage>
          ,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [Mrksˇic et al.,
          <year>2016</year>
          ]
          <string-name>
            <given-names>N.</given-names>
            <surname>Mrksˇic</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O´ .S.</given-names>
            <surname>Diarmuid</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.H.</given-names>
            <surname>Wen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Thomson</surname>
          </string-name>
          , and
          <string-name>
            <given-names>S.J.</given-names>
            <surname>Young</surname>
          </string-name>
          .
          <article-title>Neural belief tracker: Data-driven dialogue state tracking</article-title>
          .
          <source>arXiv preprint arXiv:1606.03777v1</source>
          ,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          <source>[Paek and Horvitz</source>
          , 2000]
          <string-name>
            <given-names>T.</given-names>
            <surname>Paek</surname>
          </string-name>
          and
          <string-name>
            <given-names>E.</given-names>
            <surname>Horvitz</surname>
          </string-name>
          .
          <article-title>Conversation as action under uncertainty</article-title>
          .
          <source>In Proceedings of the 16th Conference on Uncertainty in Artificial Intelligence</source>
          , pages
          <fpage>455</fpage>
          -
          <lpage>464</lpage>
          , Stanford, California,
          <year>2000</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [Prakash et al.,
          <year>2016</year>
          ]
          <string-name>
            <given-names>A.</given-names>
            <surname>Prakash</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Brockett</surname>
          </string-name>
          , and
          <string-name>
            <given-names>P.</given-names>
            <surname>Agrawal</surname>
          </string-name>
          .
          <article-title>Emulating human conversations using convolutional neural networkbased IR</article-title>
          .
          <source>In Proceedings of the Neu-IR16 SIGIR Workshop on Neural Information Retrieval</source>
          , Pisa, Italy,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [Serban et al.,
          <year>2016</year>
          ]
          <string-name>
            <given-names>I.V.</given-names>
            <surname>Serban</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Klinger</surname>
          </string-name>
          , G. Tesauro,
          <string-name>
            <given-names>K.</given-names>
            <surname>Talamadupula</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Bengio</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <surname>A. Courville.</surname>
          </string-name>
          <article-title>Multiresolution recurrent neural networks: An application to dialogue response generation</article-title>
          .
          <source>arXiv preprint arXiv:1606.00776v1</source>
          ,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          <string-name>
            <surname>[Singh</surname>
          </string-name>
          et al.,
          <year>2002</year>
          ]
          <string-name>
            <given-names>S.</given-names>
            <surname>Singh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Litman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Kearns</surname>
          </string-name>
          , and
          <string-name>
            <given-names>M.</given-names>
            <surname>Walker</surname>
          </string-name>
          .
          <article-title>Optimizing dialogue management with reinforcement learning: Experiments with the NJFun system</article-title>
          .
          <source>Artificial Intelligence Research</source>
          ,
          <volume>16</volume>
          :
          <fpage>105</fpage>
          -
          <lpage>133</lpage>
          ,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          <source>[Sowa</source>
          , 1984]
          <string-name>
            <given-names>J.F.</given-names>
            <surname>Sowa</surname>
          </string-name>
          .
          <source>Conceptual Structures: Information Processing in Mind and Machine. Addison-Wesley</source>
          , Reading, MA,
          <year>1984</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [Sugiura et al.,
          <year>2009</year>
          ]
          <string-name>
            <given-names>K.</given-names>
            <surname>Sugiura</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Iwahashi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Kashioka</surname>
          </string-name>
          , and
          <string-name>
            <given-names>S.</given-names>
            <surname>Nakamura</surname>
          </string-name>
          .
          <article-title>Bayesian learning of confidence measure function for generation of utterances and motions in object manipulation dialogue task</article-title>
          .
          <source>In Proceedings of Interspeech</source>
          <year>2009</year>
          , pages
          <fpage>2483</fpage>
          -
          <lpage>2486</lpage>
          , Brighton, United Kingdom,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          <source>[Theano Development Team</source>
          ,
          <year>2016</year>
          ]
          <article-title>Theano Development Team</article-title>
          .
          <article-title>Theano: A Python framework for fast computation of mathematical expressions</article-title>
          . arXiv e-prints,
          <source>abs/1605.02688</source>
          ,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [Trafton et al.,
          <year>2005</year>
          ]
          <string-name>
            <given-names>J.G.</given-names>
            <surname>Trafton</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.L.</given-names>
            <surname>Cassimatis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.D.</given-names>
            <surname>Bugajska</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.P.</given-names>
            <surname>Brock</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.E.</given-names>
            <surname>Mintz</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <given-names>A.C.</given-names>
            <surname>Schultz</surname>
          </string-name>
          .
          <article-title>Enabling effective human-robot interaction using perspective-taking in robots</article-title>
          .
          <source>IEEE Transactions on Systems, Man and Cybernetics - Part A: Systems and Humans</source>
          ,
          <volume>35</volume>
          (
          <issue>4</issue>
          ):
          <fpage>460</fpage>
          -
          <lpage>470</lpage>
          ,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          [Wen et al.,
          <year>2015</year>
          ]
          <string-name>
            <given-names>T.H.</given-names>
            <surname>Wen</surname>
          </string-name>
          , M. Gasˇic´, N. Mrksˇic,
          <string-name>
            <given-names>P.</given-names>
            <surname>Hao Su</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Vandyke</surname>
          </string-name>
          , and
          <string-name>
            <given-names>S.J.</given-names>
            <surname>Young</surname>
          </string-name>
          .
          <article-title>Semantically conditioned LSTMbased natural language generation for spoken dialogue systems</article-title>
          .
          <source>In EMNLP2015 - Proceedings ot the Conference on Empirical Methods in Natural Language Processing</source>
          , pages
          <fpage>1711</fpage>
          -
          <lpage>1721</lpage>
          , Lisbon, Portugal,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          <source>[Williams and Young</source>
          , 2007]
          <string-name>
            <given-names>J.D.</given-names>
            <surname>Williams</surname>
          </string-name>
          and
          <string-name>
            <given-names>S.</given-names>
            <surname>Young</surname>
          </string-name>
          .
          <article-title>Partially observable Markov decision processes for spoken dialog systems</article-title>
          .
          <source>Computer Speech and Language</source>
          ,
          <volume>21</volume>
          (
          <issue>2</issue>
          ):
          <fpage>393</fpage>
          -
          <lpage>422</lpage>
          ,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          <source>[Williams and Zweig</source>
          , 2016]
          <string-name>
            <given-names>J.D.</given-names>
            <surname>Williams</surname>
          </string-name>
          and
          <string-name>
            <given-names>G.</given-names>
            <surname>Zweig</surname>
          </string-name>
          .
          <article-title>End-toend LSTM-based dialog control optimized with supervised and reinforcement learning</article-title>
          .
          <source>arXiv preprint arXiv:1606.01269</source>
          ,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          [Yang et al.,
          <year>2016</year>
          ]
          <string-name>
            <given-names>X.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.N.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <surname>D.</surname>
            Hakkani-Tu¨r, P. Gao, and
            <given-names>L.</given-names>
          </string-name>
          <string-name>
            <surname>Deng</surname>
          </string-name>
          .
          <article-title>End-to-end joint learning of natural language understanding and dialogue manager</article-title>
          .
          <source>arXiv preprint arXiv:1612.00913v1</source>
          ,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          [Young et al.,
          <year>2007</year>
          ]
          <string-name>
            <given-names>S.</given-names>
            <surname>Young</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Schatzmann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Thomson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Weilhammer</surname>
          </string-name>
          , and
          <string-name>
            <given-names>H.</given-names>
            <surname>Ye</surname>
          </string-name>
          .
          <article-title>The hidden information state dialogue manager: A real-world POMDP-based system</article-title>
          .
          <source>In NAACLHLT 2007 - Proceedings of Human Language Technologies: The Annual Conference of the North American Chapter of the Association for Computational Linguistics</source>
          , Demonstration Program, pages
          <fpage>27</fpage>
          -
          <lpage>28</lpage>
          , Rochester, New York,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          [Young et al.,
          <year>2013</year>
          ]
          <string-name>
            <given-names>S.J.</given-names>
            <surname>Young</surname>
          </string-name>
          , M. Gasˇic´,
          <string-name>
            <given-names>B.</given-names>
            <surname>Thomson</surname>
          </string-name>
          , and
          <string-name>
            <given-names>J.</given-names>
            <surname>Williams</surname>
          </string-name>
          .
          <article-title>POMDP-based statistical spoken dialogue systems: a review</article-title>
          .
          <source>Proceedings of IEEE</source>
          ,
          <volume>101</volume>
          (
          <issue>5</issue>
          ):
          <fpage>1160</fpage>
          -
          <lpage>1179</lpage>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref33">
        <mixed-citation>
          <source>[Zhao and Eskenazi</source>
          , 2016]
          <string-name>
            <given-names>T.</given-names>
            <surname>Zhao</surname>
          </string-name>
          and
          <string-name>
            <given-names>M.</given-names>
            <surname>Eskenazi</surname>
          </string-name>
          .
          <article-title>Towards endto-end learning for dialog state tracking and management using deep reinforcement learning</article-title>
          .
          <source>In SIGDIAL'2016 - Proceedings of the 17th SIGdial Meeting on Discourse and Dialogue</source>
          , pages
          <fpage>1</fpage>
          -
          <lpage>10</lpage>
          , Los Angeles, California,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref34">
        <mixed-citation>
          <source>[Zukerman and Partovi</source>
          , 2017]
          <string-name>
            <given-names>I.</given-names>
            <surname>Zukerman</surname>
          </string-name>
          and
          <string-name>
            <given-names>A.</given-names>
            <surname>Partovi</surname>
          </string-name>
          .
          <article-title>Improving the understanding of spoken referring expressions through syntactic-semantic and contextual-phonetic error correction</article-title>
          .
          <source>Computer Speech and Language</source>
          ,
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref35">
        <mixed-citation>
          [Zukerman et al.,
          <year>2015</year>
          ]
          <string-name>
            <given-names>I.</given-names>
            <surname>Zukerman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.N.</given-names>
            <surname>Kim</surname>
          </string-name>
          , Th. Kleinbauer, and
          <string-name>
            <given-names>M.</given-names>
            <surname>Moshtaghi</surname>
          </string-name>
          .
          <article-title>Employing distance-based semantics to interpret spoken referring expressions</article-title>
          .
          <source>Computer Speech and Language</source>
          , pages
          <fpage>154</fpage>
          -
          <lpage>185</lpage>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>