<!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>Method Description for CCKS 2018 Task 2: Instruction Understanding in the Field of Music</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>ECUST NLP</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>East China University of Science and Technology, School of Information Science and Engineering</institution>
          ,
          <addr-line>Shanghai, China 200237</addr-line>
        </aff>
      </contrib-group>
      <abstract>
        <p>The instruction understanding in the eld of music aim for intention judgment and slot lling. In this paper, we rst employ BiLSTM model to recognize named entities for slot lling, then adopt heuristic rules for intention judgment. The instruction understanding in the eld of music includes two tasks, namely intention judgment and slot lling. We rst employ Bi-LSTM model to recognize named entities for slot lling, then adopt heuristic rules for intention judgment.</p>
      </abstract>
      <kwd-group>
        <kwd>Instruction understanding</kwd>
        <kwd>Bi-LSTM model</kwd>
        <kwd>heuristic rule</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>2.1</p>
      <p>Bi-LSTM Model for slot lling</p>
      <p>The slot lling task aims to recognize named entities in the led of music.
The named entity recognition task can be seen as a sequence labeling problem,
that is, given a sequence X =&lt; x1, ..., xn &gt; from texts, the goal is to label X
with tag sequence Y =&lt; y1, ..., yn &gt;. We adopt the BIEO tag scheme, where
B indicates \xi is the beginning of a clinical named entity", I indicates \xi is
inside a clinical named entity", E indicates \xi is the end of a clinical named
entity", and O indicates \xi is outside a clinical named entity". Take X =&lt;请,
播, 放, 周, 杰, 伦, 的, 稻, 香&gt; as an example, its corresponding Y =&lt;O, O, O,
B-artist, I-artist, E-artist, O, B-song, E-song&gt;.</p>
      <p>
        We employ a Bi-LSTM Model model for this task. Note that we exploit
character embedding rather than word embedding, and has no additional features
used. As shown in Fig. 1, the raw natural language input sentence is processed
into sequence of characters X = [x]1T . The character sequence is fed into the
embedding layer, which produces dense vector representation of characters. The
softmax
forwardLSTM
backwardLSTM
charcaterembedding
character vectors are then fed into a bidirectional LSTM layer [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. Speci cally,
for each position t, LSTM [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] computes ht with input et and previous state ht 1,
as:
it = (Wiet + Uiht 1 + bi)
ft = (Wf et + Uf ht 1 + bf )
c~t = tanh(Wcet + Ucht 1 + bc)
ct = ft
ct 1 + it
      </p>
      <p>c~t
ot = (Woet + Uoht 1 + bo)
ht = ot
tanh(ct)
(1)
(2)
(3)
(4)
(5)
(6)
where h, i, f , o 2 Rdh are dh-dimensional hidden state (also called output
vector), input gate, forget gate and output gate, respectively; Wi, Wf , Wc,
Wo 2 R4dh de , Ui, Uf , Uc, Uo 2 R4dh dh and bi, bf , bc, bo 2 R4dh are the
parameters of the LSTM; is the sigmoid function, and denotes element-wise
production.</p>
      <p>In the bidirectional LSTM, for any given sequence, the network computes
both a left, h!t, and a right, ht, representations of the sequence context at every
input, xt. The nal representation is created by concatenating them as ht =
[h!t; ht]. Finally, ht is fed into a fully connected layer with a softmax function
to predict the tag yt.
2.2</p>
      <p>Heuristic Rules for Intention Judgment</p>
      <p>The intention judgment task can be seen as a classi cation task. We simply
adopt heuristic rules to deal with the task. If a sentence contains named entities
recognized by Bi-LSTM model, it is music related. If not, it is music unrelated.
Speci cally, if the sentence contains key words such as \唱", \放", \歌" , it will
be labeled as \Random" . If not, it will be labeled as \No music"
3</p>
      <p>Experimental Settings</p>
      <p>
        We rst clean the utterances and only process the third sentence in it. When
training, we use all the labeled data as training data. The Bi-LSTM model is
trained by Adam algorithm [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], and the loss function is cross entropy function.
      </p>
      <p>As for the Bi-LSTM model, each Chinese character is projected into the
continuous space of 256-dimensional Euclidean space to reduce the dimensionality.
The size of LSTM hidden layer is 256, and the batch size of the model is 32.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Graves</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schmidhuber</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          :
          <article-title>Framewise phoneme classi cation with bidirectional lstm networks</article-title>
          .
          <source>In: IEEE International Joint Conference on Neural Networks</source>
          ,
          <year>2005</year>
          . IJCNN '
          <fpage>05</fpage>
          .
          <string-name>
            <surname>Proceedings</surname>
          </string-name>
          . (
          <year>2005</year>
          )
          <year>2047</year>
          {2052 vol. 4
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Hochreiter</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schmidhuber</surname>
            ,
            <given-names>J.:</given-names>
          </string-name>
          <article-title>Long short-term memory</article-title>
          .
          <source>Neural Computation</source>
          <volume>9</volume>
          (
          <issue>8</issue>
          ) (
          <year>1997</year>
          )
          <volume>1735</volume>
          {
          <fpage>1780</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Kingma</surname>
            ,
            <given-names>D.P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ba</surname>
          </string-name>
          , J.:
          <article-title>Adam: A method for stochastic optimization</article-title>
          .
          <source>arXiv preprint arXiv:1412.6980</source>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>