<!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>Structured Knowledge and Kernel-based Learning: the case of Grounded Spoken Language Learning in Interactive Robotics</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Roberto Basili</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Danilo Croce</string-name>
          <email>croceg@info.uniroma2.it</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Enterprise Engineering University of Roma</institution>
          ,
          <addr-line>Tor Vergata</addr-line>
        </aff>
      </contrib-group>
      <abstract>
        <p>Recent results achieved by statistical approaches involving Deep Neural Learning architectures suggest that semantic inference tasks can be solved by adopting complex neural architectures and advanced optimization techniques. This is achieved even by simplifying the representation of the targeted phenomena. The idea that representation of structured knowledge is essential to reliable and accurate semantic inferences seems to be implicitly denied. However, Neural Networks (NNs) underlying such methods rely on complex and bene cial representational choices for the input to the network (e.g., in the so-called pre-Training stages) and sophisticated design choices regarding the NNS inner structure are still required. While optimization carries strong mathematical tools that are crucially useful, in this work, we wonder about the role of representation of information and knowledge. In particular, we claim that representation is still a major issue, and discuss it in the light of Spoken Language capabilities required by a robotic system in the domain of service robotics. The result is that adequate knowledge representation is quite central for learning machines in real applications. Moreover, learning mechanisms able to properly characterize it, through expressive mathematical abstractions (i.e. trees, graphs or sets), constitute a core research direction towards robust, adaptive and increasingly autonomous AI systems.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        Recent results achieved by statistical approaches involving Deep Neural
Learning architectures (as in [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]) suggest that semantic inference tasks can be solved
by adopting complex neural architectures and advanced mathematical
optimization techniques, but simplifying the representation of the targeted phenomena.
The idea that representation of structured knowledge is essential to reliable and
accurate semantic inferences seems to be implicitly denied. As an example, the
application of Deep Neural Networks architectures in the context of Natural
Language Processing or Machine Translation is quite radical in this respect, since
the work presented in [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ].
      </p>
      <p>
        However, Neural Networks (NNs) underlying such methods rely on bene
cial representational choices for the input to the network (e.g., in the so-called
pre-training stages) and complex design choices regarding the NNs inner
structure are still required ([
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]). Moreover, some recent works suggest that optimal
hyper-parameterization of huge networks is possible, thus making the di erences
between di erent architectures even less relevant (as discussed for example in
[
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]). While optimization carries strong mathematical tools that are crucially
useful, in this work, we wonder here about the role of representation of information
and knowledge.
      </p>
      <p>
        A large body of research on the integration of background knowledge with the
learning algorithms has been early carried out within the framework of Inductive
Logic Programming (ILP), presented in [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. ILP is useful for logically encoding
background knowledge and extensions to standard ILP algorithms have been
proposed for encoding syntactic and semantic relational information of a
knowledge base in the kernel function, thus providing a uni ed, exible treatment of
structured and non-structured data. More recently, in [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], the induction of set
of clauses in a First Order Inductive Learner has been integrated and used as
features in standard kernel methods. In this way, principled, theory-driven data
representations result in kernels that allow consistent inferences in SVM-based
classi cation and regression tasks.
      </p>
      <p>
        In this work, we claim that representation is still a major issue, and discuss
it in the light of Spoken Language capabilities required by a robotic system in
the domain of service robotics. End-to-end communication processes in natural
language are challenging for robots for the deep interaction of di erent cognitive
abilities. For a robot to react to a user command like \Take the book on the
table" a number of implicit assumptions should be met to understand its possibly
ambiguous content. First, at least two entities, a book and a table, must exist in
the environment and the speaker expects the robot to be aware of such entities.
Accordingly, the robot must have access to an inner representation of the objects,
e.g. an explicit map of the environment. Second, mappings from words, i.e. lexical
references, to real world entities must be available. Grounding here [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] links
symbols (e.g. words) to the corresponding perceptual information.
      </p>
      <p>
        Spoken Language Understanding (SLU) in interactive dialogue systems
acquires a speci c nature, when applied in Interactive Robotics. Linguistic
interactions are context aware in the sense that both the user and the robot access
and make reference to the environment (i.e. entities of the real world). In the
above example, \taking " is the intended action whenever a book is actually on
the table, so that the book on the table refers to a unique semantic role, i.e.
to one entity playing an explicit role in the command (that is "the book to be
taken actually located on a table"). On the contrary, the command may refer to
a \bringing " action, when no book is on the table and the book and on the table
correspond to di erent roles. Robot interactions need thus to be grounded, as
meaning must correspond to the physical world and interpretation is strongly
interlaced with what is perceived, as pointed out by psycho-linguistic theories [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ].
As a consequence, a correct interpretation is more than a linguistically motivated
mapping from an audio signal (e.g. the spoken command) to a meaning
representation formalism compatible with a linguistic theory (e.g., semantic frames
as discussed in [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]). Correctness implies also physical coherence, as entities in
the environment must be known and the intended predicates must correspond
to (possibly known) actions coherent with the environment, too.
      </p>
      <p>Language</p>
      <p>Level
Knowledge</p>
      <p>Level
Physical
Perception</p>
      <p>Level
Real
World</p>
      <p>“take the book on the table”
Platform
Level
Domain
Level</p>
      <p>TAKE(object:_)
book
b1</p>
      <p>While traditional SLU mostly relies on linguistic information contained in
texts (i.e., derived only from transcribed words), its application in Interactive
Robotics depends on a variety of other factors, including the perception of the
environment.</p>
      <p>
        We can organize these factors into a layered representation as shown in
Figure 1. First, we rely on the language level that governs linguistic inferences: it
includes observations (e.g. sequences of transcribed words) as well as the
linguistic assumptions of the speaker, here modeled through frame-like predicates
by which the inner lexicon can be organized. Similarly, evidences involved by
the robot's perception of the world must be taken into account. The physical
level, i.e. the real world, is embodied in the physical perception level : we assume
that the robot has an image of this world where the existence and the spatial
properties of entities are represented. Such representation is built by mapping
the direct input of robot sensors into geometrical representations, e.g. metric
maps. These provide a structure suitable for anchoring the knowledge level. Here
symbols (i.e., knowledge primitives) are used to refer to real world entities and
their properties inside the domain level. This comprises all active concepts the
robot is aware of, as they are realized in a speci c environment, that refer to
general knowledge (e.g. conceptual categories) it has about the domain. All this
information plays a crucial role during linguistic interactions. The integration of
topological, i.e. metric, information with notions related to the knowledge level
provides an augmented representation of the environment, called semantic map
[
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]. In this map, the existence of real world objects can be associated to
lexical information, in the form of entity names given by a knowledge engineer or
spoken by a user while pointing to an object, as in Human-Augmented Mapping
[
        <xref ref-type="bibr" rid="ref11 ref12">11,12</xref>
        ]. It is worth noticing that the robot itself is a special entity described at
this knowledge level: it does know its constituent parts as well as its capabilities,
that are the actions it is able to perform. In our case, we introduce an additional
level (namely platform level ), whose information is instantiated in a knowledge
base called Platform Model. In this way, a comprehensive perceptual knowledge
level is made available, including both a model of the world and a model of the
robot itself.
      </p>
      <p>
        While SLU for Interactive Robotics have been mostly carried out over the
evidences speci c to the linguistic level, e.g., in [
        <xref ref-type="bibr" rid="ref13 ref14 ref15">13,14,15</xref>
        ], we argue that such
process should deal with all the aforementioned layers in an harmonized and
coherent manner. All linguistic primitives, including predicates and semantic
arguments, correspond to perceptual counterparts, such as plans, robot's actions
or entities involved in the underlying events.
      </p>
      <p>
        The positive impact of such layers of knowledge in the automatic
interpretation of robotic commands expressed in natural language has been presented
in [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ], where the nal interpretation process depends not only on the linguistic
information, but also on the perceptual knowledge level. This process is expected
to produce interpretations that coherently mediate among the world (with all
the entities composing it), the robotic platform (with all its inner
representations and its capabilities) and the pure linguistic level triggered by a sentence.
To this end, a discriminative approach1 to SLU has been adopted. Grounded
information is here directly injected within a structured learning algorithm, that is
SVM-HMM [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ]. Such integration of linguistic and perceptual knowledge signi
cantly improves the quality and robustness of the overall interpretation process,
as up to a 38% of reduction in the relative error is observed ([
        <xref ref-type="bibr" rid="ref16">16</xref>
        ]). Integration
is achieved by feeding the learning algorithms with a representation where
perceptual knowledge extracted from a semantic map is made available through
explicit features: it derives from a grounding mechanism based on the evidences
triggered by linguistic references and distributional semantic similarity.
Moreover, SVM classi cation based on multiple kernels is adopted to integrate the
di erent features.
      </p>
      <p>
        Kernels introduce a second crucial issue in the role of representations in
machine learning method, in particular those applied to complex decision
functions: the readability of the resulting models. Understanding why a data-driven
method provided a speci c answer will be crucial as this model will be integrated
in everyday life. This issue has been for example faced in the task of Automatic
Generation of Image caption [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]: an Attention-based model has been there used
to extend a Deep Learning architecture and focus on the image portion that
stimulated the generation of a particular caption. In semantic inference tasks
involving natural language, it will be crucial to understand the reason a text
triggered a particular output of a data-driven method: for example, in sentiment
analysis over Twitter, we should know which words in an input tweet are
responsible to evoke the output sentiment class. We foster here the importance
of kernel methods [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ]. They allow the application of learning algorithms over
discrete structures that directly express the linguistic information underlying
1 This method is implemented in the adaptive spoken Language Understanding For
      </p>
      <p>
        Robots (LU4R) processing chain: http://sag.art.uniroma2.it/lu4r.html
input texts. As an example, the adoption of Tree Kernels [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ] methods allows
to directly apply machine learning methods, such as Support Vector Machines,
over tree structures that are directly produced by a Syntactic Parser. The
cognitive role of trees in most syntactic theories implies that tree-kernel based feature
engineering is most closely related to human-like language learning and suggest
more natural generalization processes.
      </p>
      <p>
        Moreover, the model underlying the decision function for this class of
methods, for example a classi er recognizing the target of a question in natural
language or the semantic role to be assigned to the argument of a linguistic predicate
([
        <xref ref-type="bibr" rid="ref20 ref21">20,21</xref>
        ]), depends only an a subset of training examples, the core that is crucial
for the nal decision. The learning algorithm (e.g. a batch SVM) just assigns
non-zero weights to only those training examples at the frontier (i.e. the so-called
support vectors): these are the only ones that contribute to the nal decision.
Notice that for this class of leaning algorithms, examples are directly selected
by the learning algorithm. They can be expected to re ect the implicit linguistic
knowledge used by the speaker to decide. The linguistic structures
corresponding to such selected core example set, i.e. the trees or subtrees corresponding to
the support vectors, provide important information to increase the readability
of the system behavior. Kernels corresponds thus to a straightforward
learning method where a good trade-o between readability and accuracy is quite
naturally achieved.
      </p>
      <p>In synthesis, adequate representations for many di erent aspects of human
knowledge appears still quite central for learning machines in real applications.
Although these give rise to very powerful and accurate inferences regarding
uncertain decisions, they are usually the side e ects of complex design choices
regarding the task and the input representation: these are all but ontological
assumptions about the inference process and the background world model.
However, complex learning mechanisms able to properly characterize the di erent
representational properties through expressive mathematical models (i.e. trees,
graphs or sets as in convolution kernels) exist and have already successfully
applied. They constitute a core research direction towards robust, adaptive and
increasingly autonomous AI systems whose models are readable and increasingly
expressive.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>LeCun</surname>
          </string-name>
          , Y.,
          <string-name>
            <surname>Bengio</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hinton</surname>
          </string-name>
          , G.:
          <article-title>Deep learning</article-title>
          .
          <source>Nature</source>
          <volume>521</volume>
          (
          <issue>7553</issue>
          ) (
          <year>05 2015</year>
          )
          <volume>436</volume>
          {
          <fpage>444</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Collobert</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Weston</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bottou</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Karlen</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kavukcuoglu</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kuksa</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Natural language processing (almost) from scratch</article-title>
          .
          <source>J. Mach. Learn. Res. 12 (November</source>
          <year>2011</year>
          )
          <volume>2493</volume>
          {
          <fpage>2537</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Xu</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ba</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kiros</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cho</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Courville</surname>
            ,
            <given-names>A.C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Salakhutdinov</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zemel</surname>
            ,
            <given-names>R.S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bengio</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          :
          <article-title>Show, attend and tell: Neural image caption generation with visual attention</article-title>
          .
          <source>CoRR abs/1502</source>
          .03044 (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Levy</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Goldberg</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dagan</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          :
          <article-title>Improving distributional similarity with lessons learned from word embeddings</article-title>
          .
          <source>Transactions of the Association for Computational Linguistics</source>
          <volume>3</volume>
          (
          <year>2015</year>
          )
          <volume>211</volume>
          {
          <fpage>225</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Muggleton</surname>
          </string-name>
          , S.,
          <string-name>
            <surname>de Raedt</surname>
          </string-name>
          , L.:
          <article-title>Inductive logic programming: Theory and methods</article-title>
          .
          <source>The Journal of Logic Programming</source>
          <volume>19</volume>
          (
          <year>1994</year>
          )
          <volume>629</volume>
          {
          <fpage>679</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Landwehr</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Passerini</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Raedt</surname>
            ,
            <given-names>L.D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Frasconi</surname>
          </string-name>
          , P.:
          <article-title>kfoil: Learning simple relational kernels</article-title>
          . In: AAAI, AAAI Press (
          <year>2006</year>
          )
          <volume>389</volume>
          {
          <fpage>394</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Harnad</surname>
            ,
            <given-names>S.:</given-names>
          </string-name>
          <article-title>The symbol grounding problem</article-title>
          .
          <source>Physica D: Nonlinear Phenomena</source>
          <volume>42</volume>
          (
          <issue>1-3</issue>
          ) (
          <year>1990</year>
          )
          <volume>335</volume>
          {
          <fpage>346</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Tanenhaus</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Spivey-Knowlton</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Eberhard</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sedivy</surname>
          </string-name>
          , J.:
          <article-title>Integration of visual and linguistic information during spoken language comprehension</article-title>
          .
          <source>Science</source>
          <volume>268</volume>
          (
          <year>1995</year>
          )
          <volume>1632</volume>
          {
          <fpage>1634</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Fillmore</surname>
            ,
            <given-names>C.J.</given-names>
          </string-name>
          :
          <article-title>Frames and the semantics of understanding</article-title>
          .
          <source>Quaderni di Semantica</source>
          <volume>6</volume>
          (
          <issue>2</issue>
          ) (
          <year>1985</year>
          )
          <volume>222</volume>
          {
          <fpage>254</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10. Nuchter,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Hertzberg</surname>
          </string-name>
          , J.:
          <article-title>Towards semantic maps for mobile robots</article-title>
          .
          <source>Robot. Auton. Syst</source>
          .
          <volume>56</volume>
          (
          <issue>11</issue>
          ) (
          <year>2008</year>
          )
          <volume>915</volume>
          {
          <fpage>926</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Diosi</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Taylor</surname>
          </string-name>
          , G.R.,
          <string-name>
            <surname>Kleeman</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>Interactive SLAM using laser and advanced sonar</article-title>
          .
          <source>In: Proceedings of the 2005 IEEE International Conference on Robotics and Automation, ICRA 2005, April 18-22</source>
          ,
          <year>2005</year>
          , Barcelona,
          <string-name>
            <surname>Spain.</surname>
          </string-name>
          (
          <year>2005</year>
          )
          <volume>1103</volume>
          {
          <fpage>1108</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Bastianelli</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bloisi</surname>
            ,
            <given-names>D.D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Capobianco</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cossu</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gemignani</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Iocchi</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nardi</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>On-line semantic mapping</article-title>
          .
          <source>In: Advanced Robotics (ICAR)</source>
          ,
          <year>2013</year>
          16th International Conference on.
          <source>(Nov</source>
          <year>2013</year>
          )
          <volume>1</volume>
          {
          <fpage>6</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>D.L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mooney</surname>
          </string-name>
          , R.J.:
          <article-title>Learning to interpret natural language navigation instructions from observations</article-title>
          .
          <source>In: Proceedings of the 25th AAAI Conference on AI</source>
          . (
          <year>2011</year>
          )
          <volume>859</volume>
          {
          <fpage>865</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Matuszek</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Herbst</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zettlemoyer</surname>
            ,
            <given-names>L.S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fox</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Learning to parse natural language commands to a robot control system</article-title>
          . In Desai,
          <string-name>
            <given-names>J.P.</given-names>
            ,
            <surname>Dudek</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            ,
            <surname>Khatib</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            ,
            <surname>Kumar</surname>
          </string-name>
          , V., eds.
          <source>: ISER</source>
          . Volume
          <volume>88</volume>
          of Springer Tracts in Advanced Robotics., Springer (
          <year>2012</year>
          )
          <volume>403</volume>
          {
          <fpage>415</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Bastianelli</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Castellucci</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Croce</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Basili</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nardi</surname>
          </string-name>
          , D.:
          <article-title>E ective and robust natural language understanding for human-robot interaction</article-title>
          .
          <source>In: Proceedings of ECAI</source>
          <year>2014</year>
          , IOS Press (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Bastianelli</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Croce</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vanzo</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Basili</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nardi</surname>
            ,
            <given-names>D.:</given-names>
          </string-name>
          <article-title>A discriminative approach to grounded spoken language understanding in interactive robotics</article-title>
          .
          <source>In: Proceedings of the Twenty-Fifth International Joint Conference on Arti cial Intelligence</source>
          ,
          <source>IJCAI</source>
          <year>2016</year>
          , New York. (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Altun</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tsochantaridis</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hofmann</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Hidden Markov support vector machines</article-title>
          .
          <source>In: Proc. of ICML</source>
          . (
          <year>2003</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Shawe-Taylor</surname>
          </string-name>
          , J.,
          <string-name>
            <surname>Cristianini</surname>
          </string-name>
          , N.:
          <article-title>Kernel Methods for Pattern Analysis</article-title>
          . Cambridge University Press, New York, NY, USA (
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19. Collins,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Du</surname>
          </string-name>
          <string-name>
            <surname>y</surname>
          </string-name>
          , N.:
          <article-title>Convolution kernels for natural language</article-title>
          .
          <source>In: Proceedings of Neural Information Processing Systems</source>
          (NIPS'
          <year>2001</year>
          ).
          <article-title>(</article-title>
          <year>2001</year>
          )
          <volume>625</volume>
          {
          <fpage>632</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>Croce</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Moschitti</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Basili</surname>
          </string-name>
          , R.:
          <article-title>Structured lexical similarity via convolution kernels on dependency trees</article-title>
          .
          <source>In: Proceedings of EMNLP</source>
          . (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <surname>Croce</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Moschitti</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Basili</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Palmer</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Verb classi cation using distributional similarity in syntactic and semantic structures</article-title>
          .
          <source>In: 50th Annual Meeting of the Association for Computational Linguistics, ACL 2012 - Proceedings of the Conference</source>
          . (
          <year>2012</year>
          )
          <volume>263</volume>
          {
          <fpage>272</fpage>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>