<!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>A hybrid convolutional and recurrent network approach for conversational AI in spoken language understanding</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>1st Bassel Zaity</string-name>
          <email>bassel.zaity@gmail.com</email>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>2nd Hazem Wannous</string-name>
          <email>hazem.wannous@univ-lille.fr</email>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>3rd Zein Shaheen 4th Igor Chernoruckiy</string-name>
          <email>shahin.z@edu.spbstu.ru igcher@spbstu.ru</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>5thPavel Drobintsev 6th Vadim Pak</string-name>
          <email>drob@ics2.ecd.spbstu.ru</email>
          <email>drob@ics2.ecd.spbstu.ru vadim.pak@cit.icc.spbstu.ru</email>
          <email>vadim.pak@cit.icc.spbstu.ru</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Computer Intelligent Technologies Graduate School of Software Engineering, Peter the Great St.Petersburg Polytechnic University (SPbPU) Peter the Great St.Petersburg Polytechnic University (SPbPU)</institution>
          ,
          <addr-line>Saint Petersburg, Russia Saint Petersburg</addr-line>
          ,
          <country country="RU">Russia</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Graduate School of Software Engineering Computer Intelligent Technologies, Peter the Great St.Petersburg Polytechnic University (SPbPU) Peter the Great St.Petersburg Polytechnic University (SPbPU)</institution>
          ,
          <addr-line>Saint Petersburg, Russia Saint Petersburg</addr-line>
          ,
          <country country="RU">Russia</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Graduate School of Software Engineering, Peter the Great St.Petersburg Polytechnic University (SPbPU)</institution>
          ,
          <addr-line>Saint Petersburg</addr-line>
          ,
          <country country="RU">Russia</country>
        </aff>
        <aff id="aff3">
          <label>3</label>
          <institution>IMT Lille Douai, CRIStAL UMR 9189, University of Lille</institution>
          ,
          <addr-line>Lille</addr-line>
          ,
          <country country="FR">France</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>-The deep learning revolution has an impact on almost all parts of our life, it brought us improved momental machine translators, modern human-like conversation voice assistant like Siri, Alexa, Alisa. This revolution had become truth because of deep learning methods which improved multiple processing layers to learn a hierarchical representation of data, and have achieved the state-of-the-art results in many lives domains. In this paper, we are focusing on one of the most famous NLP (Natural language processing) problems which is slot filling to approach the state-of-the-art results on the ticketing problem to make the Spoken Dialogue systems work more efficiently. We propose a hybrid architecture, as a combination of a Recurrent Neural Network and a Convolutional Neural Network models, for Slot Filling in Spoken Language Understanding. In particular, our network model is built from stacked units of 1-dimensional CNN (Convolutional Neural Network) across the temporal domain, which are used to train an RNN (Recurrent neural network) layer to model dependencies in the temporal domain. Experimental tests show extensive comparisons between different models for NER (Named Entities Recognition). Results demonstrate the effectiveness of hybrid models that combine benefits from both RNN and CNN architecture compared over distinct RNN and CNN models and also compared with other traditional models. Experimental results show that our model achieves F1-score of 95.11 on benchmark ATIS dataset. Index Terms-SLU, slot-filling, Hybrid CNN and RNN, Deep learning</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>I. INTRODUCTION</title>
      <p>
        The methodological revolution in spoken language research
had been started about 20 years ago when the machine learning
algorithms started to take place in the programmer society.
However, the last five years brought the real change after
the new deep learning architectures, which leds to a new
level of solutions and the Spoken Dialogue Systems (SDS)
is one of the fields which had really improved recently. SDS
and chatbots are taking a wider place day by day in the
scientific conferences as a case study. They already have great
commercial potential according to the changing of the way
humans interact with machines. The improvement of deep
learning in general, and the Natural Language Processing
(NLP) researchers in special, led to place a lot of difficult
problems under the microscope, and the research teams over
the world trying to test different architecture models to get the
state-of-the-art results to solve these problems. In our days,
the importance of chatbots has increased, most websites tend
to have their own chatbots to communicate with customers
and facilitate their work. The goal of such bots is to know
users needs and give responses in their natural language. This
will lead to a better understanding of the users queries when
communicating with the users in a natural way throw these
chatbots. It will also help to ask the users about whatever
missing points they have to bring the best accurate answers,
such assistants could help disabled people and bring more
solutions to the market to build a more intelligent world.
The implementation of a voice assistant comes with different
parts, as speech to text and text to speech models, but the
most challenging part comes in the task of NLP to extract
the needs of the user and to know his intent from the
conversation. The processing pipeline comes here into two
parts, intent classification and slot filling after the intent is
known. At this stage, the bot needs to generate a response
to the user and give feedback about whatever missing data
there are. The whole system that organizes this process is the
dialogue manager which processes the users input, extract the
meaning and generates the desired response. From a research
perspective, the design of spoken dialogue systems provides a
number of significant challenges, as these systems depend on
solving several difficult NLP and decision making tasks, and
combining these into a functional dialogue system pipeline [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ].
Intent detection and slot filling are usually processed
separately. Intent detection can be treated as a semantic utterance
classification problem, and popular classifiers like support
vector machines (SVMs) [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] and deep neural network
methods [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] can be applied. Slot filling can be treated as a
sequence labeling task. Popular approaches to solving sequence
labeling problems include maximum entropy Markov models
(MEMMs) [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], conditional random fields (CRFs) [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], and
recurrent neural networks (RNNs) [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. Joint model
for intent detection and slot filling has also been proposed
in literature [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]. Such joint model simplifies the spoken
language understanding (SLU) system, as only one model
needs to be trained and fine-tuned for the two tasks.
This work focuses on the slot-filling part by building a model
that extracts information from text in a reliable way. Before
the era of deep learning the task of Named Entity Recognition
(NER) was solved using grammars-based models and
rulebased approaches, these models have proven to achieve good
results in terms of precision but fail to capture all
humantext varieties and thus the recall will be bad. Probabilistic
approaches came with models built on HMM, which were
stateof-art for many years and achieved an impressive achievement.
With the recent revolution, many deep learning methods has
replaced traditional previous ones and pushed state-of-art for
these tasks in. Recurrent Neural Networks (RNN) models have
replaced models based on HMM, that is RNN achieved the
same task in a simpler way and deep RNNs are able to
capture complex representations for the input. The problem
with such models was that they need to handle the input
tokenby-token in sequence. Therefore, such structures could not be
parallelized and the models will be slow to train and inference
if the neural network structure is deep. Convolution Neural
Networks (CNN) added a way to extract relations between
tokens by mixing them in a way similar to extracting
ngrams in the traditional NLP tasks. Such architectures that
contain CNN could be optimized by parallelization so adding
a convolutional layer could reduce the complexity and control
the size of the neural network. In this paper, we discuss
different approaches to solve slot filling for ticketing task
as a NER problem, and showed different architectures that
contain distinct RNN, CNN or hybrid architectures ones.
We conducted many experiments with different values of the
hyper-parameters and different optimization methods.
      </p>
    </sec>
    <sec id="sec-2">
      <title>II. RELATED WORK</title>
      <p>
        Rule-based approaches are done manually, at first you all
needed roles should be written need to achieve the goal, this
operation is time-consuming and therefore not so efficient,
it will be notable that the recall is not very nice because
its so difficult to write all the varieties, but the positives of
ruled-based approaches the precision will be quite high [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ].
The most widely used formal system for modeling constituent
structure in English and other natural languages is the
ContextFree Grammar or CFG. A context-free grammar consists of
a set of rules or productions, each of which expresses the
ways that symbols of the language can be grouped and ordered
together, and a lexicon of words and symbols [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ].
In machine learning methods, we need a dataset of text with
markup, in this dataset, each word should be assigned to a
tag, this problem is known as slots filling problem. The first
which we should do is making some Feature engineering, for
example, see whether the word is capitalized or it is a name of
a city, some cities consists of two words, maybe you check the
previous or the next words (context). Probabilistic modeling
and Conditional Random Field not only assume that features
are dependent on each other but also considers the future
observations while learning a pattern [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ]. This combines the
best of both HMM and MEMM. In terms of performance,
it is considered previously to be the best method for entity
recognition problem. Another paper studied the comprehensive
investigations of RNNs for the task of slot filling in SLU.
They implemented and compared several RNN architectures,
including the Elman-type and Jordan-type networks with their
variants [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ]
      </p>
    </sec>
    <sec id="sec-3">
      <title>III. DEEP LEARNING METHODS</title>
      <sec id="sec-3-1">
        <title>A. Recurrent Neural Network RNN</title>
        <p>Recurrent Neural Networks “Fig. 1” are used for sequence
modeling, it accepts input xt at time step t and a hidden state
ht and use this hidden state to produce output yt, and this
hidden state will be passed to the next time step. So, we can
think of the hidden state as a summary of the previous inputs
to the neural network, we use activation function such as tanh
or ReLU to calculate hidden state. Output yt is the prediction
of the next tag, it would be a vector of probabilities across our
vocabulary, the following formulas explain the general form
of RNN:
ht = f (U xt + W ht 1)
yt = softmax(V ht)
(1)
(2)</p>
        <p>
          Long Short Term Memory (LSTM) and Gated Recurrent
Units (GRU) are used as RNN units, these units can capture
long term dependency. The LSTM does have the ability to
remove or add information to the cell state, carefully regulated
by structures called gates. Gates are a way to optionally let
information through. They are composed out of a sigmoid
neural net layer and a pointwise multiplication operation [
          <xref ref-type="bibr" rid="ref19">19</xref>
          ].
The sigmoid layer outputs numbers between zero and one,
describing how much of each component should be let through.
A value of zero means let nothing through, while a value of
one means let everything through! An LSTM has three of
these gates “Fig. 2”, to protect and control the cell state. The
following formulas explain how does LSTM cell work:
ft = (Wf [ht 1; xt] + bf )
it = (Wi[ht 1; xt] + bi)
Ct = tanh(Wc[ht 1; xt] + bc)
        </p>
        <p>Ct = ft:Ct 1 + it:Ct
ot = (Wo[ht 1; xt] + bo)
ht = ot:tanh(Ct)
(3)
(4)
(5)
(6)
(7)
(8)</p>
        <p>
          GRU has a simpler design “Fig. 3” it was introduced by
Cho, et al. (2014) [
          <xref ref-type="bibr" rid="ref20">20</xref>
          ], The key difference between a GRU
and an LSTM is that a GRU has two gates (reset and update
gates) whereas an LSTM has three gates (namely input, output
and forget gates) [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ]. The GRU unit controls the flow of
information like the LSTM unit, but without having to use a
memory unit. It just exposes the full hidden content without
any control. GRU is relatively new but computationally more
efficient. The following formulas describe the GRU
mechanism:
zt = (W z:[ht 1; xt])
(9)
        </p>
        <p>rt = (W r:[ht 1; xt])
ht = tanh(W:[r:ht 1; xt])
htt = (1
zt):ht 1 + zt
ht
(10)
(11)
(12)</p>
        <p>In our experiments, we used both GRU and LSTM units
and compared between them. Other sequence architectures
like Encoder-decoder architecture could be used to solve this
task, at first the whole input will be encoded into hidden
representation (encoder), and then this hidden representation is
used to produce sequence of tags (decode). Some architectures
use attention mechanism to give attention to parts of the input
sequence and use these information to produce the output
token.</p>
      </sec>
      <sec id="sec-3-2">
        <title>B. Convolution Neural Network for sequences</title>
        <p>RNNs operate sequentially, the output for the second
input depends on the first one and so we cant parallelize
an RNN. Convolutions have no such problem, each patch
a convolutional kernel operates on is independent of the
other, meaning that we can go over the entire input layer
concurrently. Convolutions grow a larger receptive beld as we
stack more and more layers. That means that by default, each
step in the convolutions representation views all of the input
in its receptive field, from before and after it “Fig. 4”. In
our experiments we used 1D convolution to mix the tokens
and extract relations between the consequence tokens, it is
equivalent to n-gram relation where n is the size of the used
filter, for example: if we care about the last 3 tokens we use
filter size 3. Using CNN will result in some benefits, it runs
faster than RNN and beats RNN in some tasks. If we divide
convolution output into two parts, A and B, one of which will
gate the other through element-wise multiplication, where A
is liner and B through sigmoid, we get GLU (gated linear
unit). Here we increased receptive field as it is shown in the
following formula:</p>
        <p>A = (X:W + b)
B = (X:V + c)
ht(x) = A</p>
        <p>B
ht(x) = (X:W + b)
(X:V + c)
(13)
(14)
(15)
(16)
following the IOB tagging representation, except for a more
specific granularity.</p>
        <p>1) Training Details: In training, we compared between
different models for NER (Named Entities Recognition) system,
all the models were trained using 100 epochs. We tuned our
models using different dropout values (0.1, 0.25, 0.5) and
we used different optimization methods (ADAM, RMSProb,
SGD). For the embedding layer, we represent each token by a
vector of size 100, and for our choice for the convolution
layer we used 64 filters of size 5 and used ReLU as an
activation function. The hidden size of the GRU/LSTM unit
is 100 “Fig. 5”.</p>
        <p>Our architecture will go as following, input layer which is
a sequence of tokens represented by indices using bag of
words, embedding layer will represent each token with a
vector, the vector size is a hyperparameter for the network,
this embedding layer is followed by one of the main choices
of the layers discussed above, recurrent neural network,
convolutional neural network or a hybrid model which contains
layer of CNN followed by layer of RNN.</p>
        <p>2) Evaluation Metrics: For evaluation, we computed
precision, recall and F1 score for training and validation sets, and
we picked the model with the best value of the F1 score.
For Slot filling, the error rate can be computed in two ways:
The more common metric is the F-measure using the slots as
units. This metric is similar to what is being used for other
sequence classification tasks in the natural language processing
community, such as parsing and named entity extraction. In
this technique, usually the IOB schema is adopted, where each
of the words is tagged with their position in the slot: beginning
(B), in (I) or other (O). Then, recall and precision values are
computed for each of the slots. A slot is considered to be
correct if its range and type are correct. The F-Measure is
defined as the harmonic mean of recall and precision:</p>
        <p>
          This model combines the benefits of both CNN and RNN,
where RNN helps to capture the dependencies between tokens
in the users query, using LSTM or GRU units will have
resulted in a model that captures long-range dependencies
between tokens using memory cell in their architecture. CNN
will help with mixing the consequence tokens and extract
relations between them [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ]. In the task of slot filling, the
hybrid architecture contains several convolution layers stacked
with the same padding and the output of these layers will be
the input for RNN layers as in Fig. 5, we can also stack several
RNN layers. After these RNN layers, there will be a dense
layer with softmax activations, this layer represents the output
of the network.
        </p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>IV. EXPERIMENTS</title>
      <sec id="sec-4-1">
        <title>A. Dataset</title>
        <p>
          ATIS (Airline Travel Information System) corpus (Tur et
al., 2010) is one of the main data resources used in many
studies over the past two decades for SLU research in spoken
dialog systems e.g. [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ] [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ] [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ]. Two primary tasks in SLU
are intent determination (ID) and slot filling (SF). The dataset
contains audio recordings of people making flight reservations.
        </p>
        <p>
          The training set contains 4,478 utterances and the test set
contains 893 utterances. We use another 500 utterances for
development set. There are 120 slot labels and 21 intent types
in the training set [
          <xref ref-type="bibr" rid="ref22">22</xref>
          ].
        </p>
        <p>The IOB format (inside, outside, beginning) is a common F1-Score = 2 Recall Precision (17)
tagging format for tagging tokens in a chunking task in Recall + Precision
computational linguistics, The B- prefix before a tag indicates where:
that the tag is the beginning of a chunk, and an I- prefix before Recall = #correct slots Found (18)
a tag indicates that the tag is inside a chunk. The B- tag is #true slots
used only when a tag is followed by a tag of the same type #correct slots Found
without O tokens between them. An O tag indicates that a Precision = #found slots (19)
token belongs to no chunk.</p>
        <p>The Table I shows an example in the ATIS dataset , with B. Results
the annotation of slot/concept, named entity, intent as well During evaluation process we focused on the difference
as domain. The latter two annotations are for the other two between the use of different architectures of neural networks,
tasks in SLU: domain detection and intent determination. We we compared also between different optimization methods for
can see that the slot filling is quite similar to the NER task, the best neural network structure and at the end we included
a comparison based on the type of recurrent unit used in the
model. We concluded the experiments 25 times, and we took
the mean of the samples and calculated the standard error. We
reported our results in the tables.</p>
        <p>Our results show that hybrid architectures perform better than
other pure RNN or pure CNN models Table II, when we
used dropout 0.25 and RMSProb optimization method , we
got F1-score 95.04 for hybrid model compared with 91.16 for
convolution model and 93.07 for recurrent model.</p>
        <p>Our results show also that the use of RMSProb resulted in the
best models according to F1-score metrics Table III, under the
same dropout 0.25 and hybrid model, we got F1-score equals
to 95.04 for RMSProb compared with 94.83 when we used
ADAM optimization model, and 94.44 when we used SGD.</p>
        <p>Result show that the effect the Hybrid structure Convolution1D
and RNN/GRU without dropout using RMSProp optimizer is
giving the best F1-score 95.11 comparing with different levels
of dropout on the same architecture Table IV Based on the
recurrent unit used in our experiments, GRU based hybrid
methods with F1-score 95.04 compared with LSTM based
hybrid models with F1-score 94.67, GRU units improved
the score by 0.37% Table V. Our results show that the
hybrid CNN/RNN-based models outperform Bi-dir.
JordanRNN baseline by 1.13% on the ATIS benchmark Table VI.</p>
        <p>This paper addresses the problem of slot filling in Spoken
Language Understanding. In particular, we focused on slot
tagging without paying attention to the other intent
classification part. We formulated our learning architecture as a
hierarchy of spatial CNN features followed by the RNNs to
model dependencies in the temporal domain. Experimental
results on the ATIS dataset consistently demonstrated the
effectiveness of the proposed approach. It is good to mention
that combined models that solve the two tasks at the same
time could be implemented and these models had proven to
lead to better performance. But still, in the way to implement
a full chatbot, we will need to generate human-like text in
response to users input. In future work, we intend to explore
the incorporation of attentional mechanism in our model,
which could provide additional information to the slot label
prediction, and learn our architecture using another data-sets
to generalize the results.</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>P.</given-names>
            <surname>Su</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Mrksic</surname>
          </string-name>
          ,
          <string-name>
            <surname>I.</surname>
          </string-name>
          <article-title>Casanueva and I. Vulic, “Deep Learning for Conversational AI NAACL</article-title>
          <year>2018</year>
          Tutorial,“ PolyAI, University of Cambridge,
          <year>2018</year>
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>P.</given-names>
            <surname>Haffner</surname>
          </string-name>
          , G. Tur, and
          <string-name>
            <given-names>J. H.</given-names>
            <surname>Wright</surname>
          </string-name>
          , “
          <article-title>Optimizing svms for complex call classification</article-title>
          ,“ Acoustics, Speech, and
          <string-name>
            <given-names>Signal</given-names>
            <surname>Processing</surname>
          </string-name>
          ,
          <year>2003</year>
          .
          <source>Proceedings.(ICASSP03)</source>
          .
          <source>2003 IEEE International Conference on, vol. 1</source>
          . IEEE,
          <year>2003</year>
          , pp.
          <fpage>I632</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>R.</given-names>
            <surname>Sarikaya</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. E.</given-names>
            <surname>Hinton</surname>
          </string-name>
          , and
          <string-name>
            <given-names>B.</given-names>
            <surname>Ramabhadran</surname>
          </string-name>
          , “
          <article-title>Deep belief nets for natural language call-routing,“</article-title>
          <source>Acoustics, Speech and Signal Processing (ICASSP)</source>
          ,
          <source>2011 IEEE International Conference on. IEEE</source>
          ,
          <year>2011</year>
          , pp.
          <fpage>56805683</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>A.</given-names>
            <surname>McCallum</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Freitag</surname>
          </string-name>
          , and
          <string-name>
            <given-names>F. C.</given-names>
            <surname>Pereira</surname>
          </string-name>
          , “
          <article-title>Maximum entropy markov models for information extraction and segmentation</article-title>
          .
          <source>“ ICML</source>
          , vol.
          <volume>17</volume>
          ,
          <year>2000</year>
          , pp.
          <fpage>591598</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>C.</given-names>
            <surname>Raymond</surname>
          </string-name>
          and G. Riccardi, “
          <article-title>Generative and discriminative algorithms for spoken language understanding</article-title>
          ,
          <source>“ INTERSPEECH</source>
          ,
          <year>2007</year>
          , pp.
          <fpage>16051608</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>K.</given-names>
            <surname>Yao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Peng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Yu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Zweig</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Y.</given-names>
            <surname>Shi</surname>
          </string-name>
          , “
          <article-title>Spoken language understanding using long short-term memory neural networks</article-title>
          ,
          <source>“ Spoken Language Technology Workshop (SLT)</source>
          ,
          <year>2014</year>
          IEEE. IEEE,
          <year>2014</year>
          , pp.
          <fpage>189194</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <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.</given-names>
            <surname>HakkaniTur</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Heck</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Tur</surname>
          </string-name>
          and
          <string-name>
            <given-names>D.</given-names>
            <surname>Yu</surname>
          </string-name>
          et al.,
          <article-title>“Using recurrent neural networks for slot filling in spoken language understanding,“ Audio, Speech, and Language Processing</article-title>
          , IEEE/ACM Transactions on, vol.
          <volume>23</volume>
          , no.
          <issue>3</issue>
          , pp.
          <fpage>530539</fpage>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>B.</given-names>
            <surname>Liu</surname>
          </string-name>
          and
          <string-name>
            <surname>I. Lane</surname>
          </string-name>
          , “
          <article-title>Recurrent neural network structured output prediction for spoken language understanding</article-title>
          ,
          <source>“ Proc. NIPS Workshop on Machine Learning for Spoken Language Understanding and Interactions</source>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>D.</given-names>
            <surname>Guo</surname>
          </string-name>
          , G. Tur, W.-t. Yih, and G. Zweig, “
          <article-title>Joint semantic utterance classification and slot filling with recursive neural networks</article-title>
          ,
          <source>“ Spoken Language Technology Workshop (SLT)</source>
          ,
          <year>2014</year>
          IEEE. IEEE,
          <year>2014</year>
          , pp.
          <fpage>554559</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>P.</given-names>
            <surname>Xu</surname>
          </string-name>
          and
          <string-name>
            <given-names>R.</given-names>
            <surname>Sarikaya</surname>
          </string-name>
          , “
          <article-title>Convolutional neural network based triangular crf for joint intent detection and slot filling,“ Automatic Speech Recognition and Understanding (ASRU</article-title>
          ),
          <source>2013 IEEE Workshop on. IEEE</source>
          ,
          <year>2013</year>
          , pp.
          <fpage>7883</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>M.</given-names>
            <surname>Surdeanu</surname>
          </string-name>
          and
          <string-name>
            <given-names>H.</given-names>
            <surname>Ji</surname>
          </string-name>
          , “
          <article-title>Overview of the English Slot Filling Track at the TAC2014 Knowledge Base Population Evaluation“</article-title>
          ,
          <source>3rd International Workshop on Knowledge Discovery on the WEB</source>
          ,
          <year>2017</year>
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>U.</given-names>
            <surname>Schade and M. R. Hieb</surname>
          </string-name>
          , “
          <article-title>Formalizing Battle Management Language:A Grammar for Specifying Orders“</article-title>
          ,
          <source>06S-SIW-068 Spring</source>
          <year>2006</year>
          ,
          <year>2006</year>
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>G.</given-names>
            <surname>Kurata</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Xiang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Zhou</surname>
          </string-name>
          , and
          <string-name>
            <given-names>M.</given-names>
            <surname>Yu</surname>
          </string-name>
          , “
          <article-title>Leveraging sentencelevel information with encoder lstm for natural language understanding</article-title>
          ,
          <source>“ arXiv preprint arXiv:1601.01530</source>
          ,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>S. T.</given-names>
            <surname>Hsu</surname>
          </string-name>
          , C. Moon,
          <string-name>
            <given-names>P.</given-names>
            <surname>Jones</surname>
          </string-name>
          and
          <string-name>
            <given-names>N. F.</given-names>
            <surname>Samatova</surname>
          </string-name>
          “
          <article-title>A Hybrid CNN-RNN Alignment Model for Phrase-Aware Sentence Classification,“ 15th Conference of the European Chapter of the Association for Computational Linguistics, 2017</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>Y.</given-names>
            <surname>He</surname>
          </string-name>
          and
          <string-name>
            <given-names>S.</given-names>
            <surname>Young</surname>
          </string-name>
          , “
          <article-title>A data-driven spoken language understanding system,“ in IEEE ASRU</article-title>
          <year>2003</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>C.</given-names>
            <surname>Raymond</surname>
          </string-name>
          and G. Riccardi, “
          <article-title>Generative and discriminative algorithms for spoken language understanding,“ in Interspeech 2007</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>G.</given-names>
            <surname>Tur</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Hakkani-Tur</surname>
          </string-name>
          , and L. Heck, “
          <article-title>What is left to be understood in ATIS¿</article-title>
          ' in IEEE SLT,
          <year>2010</year>
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>G.</given-names>
            <surname>Mesnil</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Deng</surname>
          </string-name>
          and
          <string-name>
            <given-names>Y.</given-names>
            <surname>Bengio</surname>
          </string-name>
          , “
          <article-title>Investigation of RecurrentNeural-Network Architectures and Learning Methods for Spoken Language Understanding</article-title>
          ,
          <source>“ INTERSPEECH</source>
          <year>2013</year>
          , pp
          <fpage>3771</fpage>
          -
          <lpage>3775</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>B.</given-names>
            <surname>Qu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Tao</surname>
          </string-name>
          , and
          <string-name>
            <given-names>X.</given-names>
            <surname>Lu</surname>
          </string-name>
          , “
          <article-title>Deep semantic understanding of high resolution remote sensing image</article-title>
          ,“ in 2016 International Conference on Computer,
          <source>Information and Telecommunication Systems (CITS)</source>
          ,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>J.</given-names>
            <surname>Chung</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Gulcehre</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Cho</surname>
          </string-name>
          and
          <string-name>
            <surname>Y.</surname>
          </string-name>
          <article-title>Bengio “Empirical Evaluation of Gated Recurrent Neural Networks on Sequence Modeling</article-title>
          ,“ arXiv:
          <fpage>1412</fpage>
          .3555 [cs.NE],
          <year>2014</year>
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>C.</given-names>
            <surname>Sutton</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>McCallum</surname>
          </string-name>
          and
          <string-name>
            <given-names>K.</given-names>
            <surname>Rohanimanesh</surname>
          </string-name>
          , “
          <article-title>Dynamic Conditional Random Fields: Factorized Probabilistic Models for Labeling and Segmenting Sequence Data</article-title>
          ,“ JMLR,
          <year>2007</year>
          , pp.
          <fpage>693</fpage>
          -
          <lpage>723</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>G.</given-names>
            <surname>Gao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Hsu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Huo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <surname>K</surname>
          </string-name>
          , Hsu and
          <string-name>
            <given-names>Y.</given-names>
            <surname>Che</surname>
          </string-name>
          , “
          <article-title>Slot-Gated Modeling for Joint Slot Filling</article-title>
          and Intent Prediction,
          <source>“ Proceedings of NAACL-HLT</source>
          <year>2018</year>
          , pp
          <fpage>753</fpage>
          -
          <lpage>757</lpage>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>