<!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>What's in a Food Name: Knowledge Induction from Gazetteers of Food Main Ingredient</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Bernardo Magnini</string-name>
          <email>magnini@fbk.eu</email>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Vevake Balaraman</string-name>
          <email>balaraman@fbk.eu</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Simone Magnolini</string-name>
          <email>magnolini@fbk.eu</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Marco Guerini</string-name>
          <email>guerini@fbk.eu</email>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Fondazione Bruno Kessler</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Via Sommarive</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Trento - Italy</string-name>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>AdeptMind Scholar</institution>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>University of Trento</institution>
          ,
          <country country="IT">Italy</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>English. We investigate head-noun identification in complex noun-compounds (e.g. table is the head-noun in three legs table with white marble top). The task is of high relevancy in several application scenarios, including utterance interpretation for dialogue systems, particularly in the context of e-commerce applications, where dozens of thousand of product descriptions for several domains and different languages have to be analyzed. We define guidelines for data annotation and propose a supervised neural model that is able to achieve 0.79 F1 on Italian food noun-compounds, which we consider an excellent result given both the minimal supervision required and the high linguistic complexity of the domain.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>Italiano. Affrontiamo il problema di
identificare head-noun in nomi composti
complessi (ad esempio "tavolo" is the
headnoun in "tavolo con tre gambe e piano in
marmo bianco"). Il compito é di alta
rilevanza in numerosi contesti applicativi,
inclusa l’interpretazione di enunciati nei
sistemi di dialogo, in particolare nelle
applicazioni di e-commerce, dove decine di
migliaia di descrizioni di prodotti per vari
domini e lingue differenti devono essere
analizzate. Proponiamo un modello
neurale supervisionato che riesce a
raggiungere lo 0.79 di F-measure, che
consideriamo un risultato eccellente data la minima
quantitá di supervisione richiesta e la alta
complessitá linguistica del dominio.</p>
    </sec>
    <sec id="sec-2">
      <title>1 Introduction</title>
      <p>
        Noun-compounds are nominal descriptions that
hold implicit semantic relations between their
constituents
        <xref ref-type="bibr" rid="ref13 ref4">(Shwartz and Dagan, 2018)</xref>
        . For
instance, an apple cake is a cake made of apples.
While in the literature there has been a large
interest in interpreting noun-compounds by
classifying them with a fixed set of ontological relations
        <xref ref-type="bibr" rid="ref10 ref11">(Nakov and Hearst, 2013)</xref>
        , in this paper we
focus on automatic recognition of the head-noun in
noun-compounds. We assume that in each
nouncompound there is a noun which can be
considered as the more informative, as it brings the most
relevant information that allows the correct
interpretation of the whole noun-compound. For
instance, in the apple cake example, we consider
cake as the head-noun, because it brings more
information than apple about the kind of food the
compound describes (i.e. a dessert), its
ingredients (i.e. likely, flour, milk and eggs), and the
typical amount a person may eat (i.e. likely, a slice).
While in simple noun-compounds the head-noun
usually corresponds to the syntactic head of the
compound, this is not the case for complex
compounds, where the head-noun can occur in
different positions of the compound, making its
identification challenging. As an example, in the Italian
food description filetto di vitellone senza grasso
visibile, there are three nouns (i.e. filetto, vitellone
and grasso) which are candidates to be the
headnoun of the compound.
      </p>
      <p>
        There are a number of tasks and application
domains where identifying noun-compound
headnouns is relevant. A rather general context is
ontology population
        <xref ref-type="bibr" rid="ref1">(Buitelaar et al., 2005)</xref>
        , where
entity names automatically recognized in text are
confronted against entity names already present in
an ontology, and have to be appropriately matched
in the ontology taxonomy. Our specific
application interest is conversational agents for the
ecommerce domain. Particularly, understanding
names of products (e.g. food, furniture, clothes,
digital equipment) as expressed by users in
different languages, requires the capacity to distinguish
the main element in a product name (e.g. a table in
I am looking for a three legs table with white
marble top), in order to match them against vendor
catalogues and to provide a meaningful dialogue with
the user. The task is made much more
challenging by the general lack of annotated data, so that
fully supervised approaches are simply not
feasible. Along this perspective, the long term goal of
our work is to develop unsupervised techniques
that can identify head-nouns in complex
nouncompounds by learning properties on the base of
the noun-compounds included in, possibly large,
gazetteers, regardless of the domain and language
in which they are described.
      </p>
      <p>
        In this paper we propose a supervised
approach based on a neural sequence-to-sequence
model
        <xref ref-type="bibr" rid="ref7">(Lample et al., 2016)</xref>
        augmented with
noun-compound structural features
        <xref ref-type="bibr" rid="ref4">(Guerini et al.,
2018)</xref>
        . This model identifies the more informative
token(s) in the noun-compound, that are finally
tagged as the head-noun. We run experiments on
Italian food names, and show that, although the
domain is very complex, results are promising.
      </p>
      <p>The paper is structured as follow: we first define
noun-compound head-noun identification, with
specific reference to complex noun-compound
(Section 2). Then we introduce the neural model
we have implemented (Section 3), and finally the
experimental setting and the results we have
obtained (Section 4).
2</p>
    </sec>
    <sec id="sec-3">
      <title>Food Compound-Nouns</title>
      <p>In this Section we focus on Italian
compoundnouns referring to food, the domain on which we
run our experiments. Similar considerations and
same methodology can be applied to
compoundnouns in different domains and languages.</p>
      <p>There is a very high variety of food
compoundnouns, describing various aspects of food,
including: simple food names, like mortadella di
fegato, pesce, gin and tonic, aglio fresco; recipes
mentioning their ingredients, like scaloppine al
limone, spaghetti al nero, passato di pollo, decotto
di carciofo; recipes focusing on preparation style,
like mandorle delle tre dame, cavolfiore alla
napoletana; food names focusing on visual or shape
properties, like filetto di vitellone senza grasso
visibile, palline di formaggio fritte; food
descriptions containing a course name, like antipasto
di capesante, dessert di mascarpone; food
using fantasy names, like frappé capriccioso, or
insalata arlecchino; food including proper names or
brands, like saint-honoré, tagliatelle Matilde,
formaggio bel paese; food names focusing on
cooking modalities, like pane fatto in casa, or peperoni
fritti; and focusing on alimentary properties, like
ragù di carne dietetico, or sangria analcolica.</p>
      <p>We assume that the head-noun of a food
description is the more informative noun in the
nouncompound, i.e. the noun that better allows to
answer questions about properties of the food being
described by the noun-compound. We consider
the following four property related questions, in
order of relevance:
1. What food category (e.g. meat, vegetable,
cake, soup, pasta, fish, liquid, salad, etc.) is
described by the noun-compound?
2. What course (e.g. main, appetizer, side
dish, dessert, etc.) is described by the
nouncompound?
3. Which is the main ingredient (in term of
quantity) described by the noun-compound?
4. Which could be the overall quantity
(expressed in grams) of food described by the
noun-compound?</p>
      <p>Although our approach does not require any
domain knowledge, for the purpose of human
annotation and evaluation it is useful to assume a
simple ontology for food, where we define the
properties used for judging head-nouns and the set of
possible values for each property. Table 1 reports
the food ontology at the base of our work.</p>
      <sec id="sec-3-1">
        <title>Property</title>
      </sec>
      <sec id="sec-3-2">
        <title>Food category</title>
      </sec>
      <sec id="sec-3-3">
        <title>Course</title>
      </sec>
      <sec id="sec-3-4">
        <title>Main ingredient</title>
        <p>quantity</p>
        <p>Values
meat, vegetable, cake, soup,</p>
        <p>pasta, fish, liquid, salad...
main, first, second, appetizer,
side , dessert...
&lt;simple food&gt;</p>
        <p>&lt;grams&gt;</p>
        <p>A good head-noun should be as much
informative as possible about the noun-compound
properties, or, in other terms, it should allow to infer as
much as possible answers to questions 1-4.
Answers to such questions are in most of the cases
graduated and probabilistic, as a noun-compound
contains just a fraction of the knowledge needed to
answer them. For instance, given question 1) for
the food noun-compound insalata noci e
formaggio should be posed in the following way:
knowing that formaggio is part of a food description,
which is the probability that the overall
description correctly refers to a food of category salad?
When the probability is very low, we assume a "no
guess" value for the answer.</p>
        <p>The core procedure for human annotations
considers each content word in a food description, fills
in the values of the four attributes, and then
select the noun with the best guesses. Below some
examples (in black the selected head of the food
description):
insalata noci e formaggio: because insalata
is a better predictor of the food category than
formaggio or noci.
involtini di peperoni: because peperoni is a
better predictor of food category (i.e.
vegetable) and of the main ingredient than
involtini.
budino al cioccolato fondente: because
budino is a good predictor of food category
(i.e. dessert) and a better predictor than
cioccolato of the main ingredient (i.e. milk) of
the noun-compound.
2.1</p>
        <sec id="sec-3-4-1">
          <title>Task and Data Set</title>
          <p>Given a food noun-compound, the task we address
is to predict its head-noun, labelling one or more
consecutive tokens in the food description. We
assume that a head is always present, even in case it
is poorly informative.</p>
          <p>Two annotators were selected to annotate a data
set of 436 food names, collected from recipe
books, with their head-noun. The inter annotator
agreement, computed at the token level, is Cohen’s
kappa: 0.91, which is considered very high.</p>
          <p>In table 2 we give an overview of the data set of
food-description head (FDH) we created focusing
on two main orthogonal characteristics: whether
the head-noun is comprised of a single token or
of a multi-token, and whether the head-noun
corresponds to the beginning of the food description
or not. As can be seen, the vast majority of
headnouns is either made of a single token (almost 90%
of cases), or starts at the beginning of the entity
name (almost 80% of cases). The combination of
Position
1st token
Not 1st token
Total
the two accounts for roughly 70% of the cases.
From the point of view of predicting the
headnoun of a food name, easier cases are given by
single token in first position, while harder cases are
given by multi-token head inside the food name.
3</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Model</title>
      <p>
        The architecture we use to recognize head-nouns
is based on a bidirectional LSTM (Long Short
Term Memory) network
        <xref ref-type="bibr" rid="ref1 ref3">(Graves and
Schmidhuber, 2005)</xref>
        , similar to the one presented in
        <xref ref-type="bibr" rid="ref7">(Lample et al., 2016)</xref>
        . We briefly describe the LSTM
model used in the approach and proceed with the
implementation details.
3.1
      </p>
      <sec id="sec-4-1">
        <title>LSTM</title>
        <p>
          Recurrent Neural Network (RNN) is a class of
artificial neural network that resemble a chain of
repeating modules to efficiently model sequential
data
          <xref ref-type="bibr" rid="ref9">(Mikolov et al., 2010)</xref>
          . They take sequential
data (x1; x2; ::::xn) as input and provide a
representation (h1; h2; ::::hn) which captures the
information at every time step in the input. Formally,
ht = f (U xt + W ht 1)
where xt is the input at time t, U is the
embedding matrix, f is a non-linear operation (such as
sigmoid, tanh or ReLU) and W is the parameter
of RNN learned during training.
        </p>
        <p>
          The hidden state ht of the network at time t
captures only the left context of the sequence for the
input at time t. The right context for the input at
time t can be captured by performing the same
operation in the negative time direction. The input
can be represented by both its left context !ht and
!
right context ht as ht = [ht ; ht ]. Similarly, the
representation of the completed sentence is given
by hT = [h!T ; h0]. Such processing of the input in
both forward and backward time-step is known as
bidirectional RNN. Though a vanilla RNN is good
at modelling sequential data, it struggles to
capture the long-term dependencies in the sequence.
Long Short Term Memory (LSTM)
          <xref ref-type="bibr" rid="ref5">(Hochreiter
and Schmidhuber, 1997)</xref>
          is a special kind of RNN
that is designed specifically to capture the
longterm dependencies in sequential data. They
compute the the hidden state ht as follows,
it = (Wi [ht 1; xt] + bi
ft = (Wf [ht 1; xt] + bf
C~t = tanh(WC [ht 1; xt] + bC )
        </p>
        <p>Ct = ft C(t 1) + it C~t
ot = (Wo [ht 1; xt] + bo</p>
        <p>ht = ot tanh(Ct)
where xt is the embedding for input at time t; it,
ft, ot are the input, forget and output gates,
respectively.</p>
      </sec>
      <sec id="sec-4-2">
        <title>3.2 Implementation</title>
        <p>The task of head-noun identification aims to
predict a sequence of tags y = fy1; y2; ::; yng given
an input sequence X = fx1; x2; ::xng. The
system is modeled as a sequence labelling task
and consists of three main steps: i) word
embedding: each word in the sequence is embedded to
a higher dimension; ii) Input encoder: encoding
the sequence of embeddings; iii) Classification:
labelling the sequence.</p>
        <p>
          Word embeddings. Each word in the input
sequence is represented by a vector of d-dimensions
that captures the syntactic and semantic
information of the word. The representation is carried by
a word embedding matrix E 2 Rd jvj where jvj
is the input vocabulary size. In addition to this,
the model combines a character embedding that is
learned during training using a Bi-LSTM network
to deal with out of vocabulary terms and possible
misspellings
          <xref ref-type="bibr" rid="ref8">(Ling et al., 2015)</xref>
          .
        </p>
        <p>
          To represent the core structure of a complex
noun-compound, we also use the following
handcrafted features of a head-noun candidate token
          <xref ref-type="bibr" rid="ref4">(Guerini et al., 2018)</xref>
          : (i) the actual position of the
token within the compound name; (ii) the length
of the candidate token; (iii) the frequency of the
token in the gazetteer; (iv) the average length of
the noun-compounds in the gazetteer containing
the token; (v) the average position of the token in
the noun-compound it appears in; (vi) the bigram
probability with reference to the previous token in
the noun-compound; (vii) if the token can be an
noun-compound; (viii) the ratio of the time the
token is the first token in a noun-compound; (ix) the
ratio of the time the token is the last token in a
noun-compound. These handcrafted features for
each word are extracted from a large corpus of
Italian food names reported in
          <xref ref-type="bibr" rid="ref4">(Guerini et al., 2018)</xref>
          .
        </p>
        <p>The concatenation of word embedding, final
states of bidirectional character embeddings
network, and hand crafted features is used as the word
representation.</p>
        <p>Input encoder. LSTM nodes are used to encode
the input sequence of word embeddings. We
employ a bidirectional LSTM (Bi-LSTM) to
capture the context in both forward and backward
timesteps. The hidden representation of a word
at time t is given as,</p>
        <p>
          ht = [!h t; h t]
Classification. The output layer receives the
hidden representation from the Bi-LSTM and
outputs a probability distribution over the possible
tag sequences. Then, a conditional random field
(CRF) layer
          <xref ref-type="bibr" rid="ref6">(Lafferty et al., 2001)</xref>
          is used to
model the dependency in labelling tags. The
hidden representations from the Bi-LSTM are
passed through a linear layer to obtain the score
Pi for each word in the input sequence X =
fx1; x2; ::; xng. The score for each possible output
tag sequence y^ 2 Y^ is then obtained as follows,
Score(y^) =
        </p>
        <p>n n
X Ayi;yi+1 + X Pi;yi
i=0 i=1
where A is the transition matrix representing the
transition scores from tag i to tag j. The
probability of the tag sequence is then computed using a
softmax operation as follows,
p(y^jX) = Py~2Y^ exp(Score(y~)</p>
        <p>exp(Score(y^))
The training is done by maximizing the log
probability of the correct output tag sequence.
4</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Experiments and Results</title>
      <sec id="sec-5-1">
        <title>4.1 Setup</title>
        <p>
          The dimension of character embedding is set to 30
and embeddings are learned using 50 hidden units
in each direction. For the word embeddings, as
learning this level of representation with a small
dataset is highly inefficient, we decided to use
pre-trained embeddings trained using skip-gram
          <xref ref-type="bibr" rid="ref10">(Mikolov et al., 2013)</xref>
          on the Italian corpus of
Wikipedia. The input encoder consists of 120
hidden units in each direction with a dropout
          <xref ref-type="bibr" rid="ref2">(E.
Hinton et al., 2012)</xref>
          of 0.5 applied between the
BiLSTM layer and the output layer.
4.2
        </p>
      </sec>
      <sec id="sec-5-2">
        <title>Baselines</title>
        <p>To compare the performance of the proposed
approach, we provide two baselines: i) 1st token,
where the 1st token of a noun-compound is chosen
as its head-noun; ii) Spacy1, where the root token
of the dependency tree for the noun-compound is
chosen as its head-noun.
1st token. This baseline implicitly accounts for
a number of linguistic behaviours of head-nouns
in Italian language: (a) avoids stop words as
headnouns, as they do not occur at the first position of
a noun-compound; (b) avoids adjectives as
headnouns, as they usually occur after the noun they
modify; (c) captures the syntactic head of the
noun-compound, which, in Italian is likely to be
the first noun in a Noun Phrase; as already seen in
Table 2. Summing up, the first-token baseline
captures relevant linguistic behaviours, and is a strong
competitor of our neural model, as in more than
80% of the entries in our dataset the first token
belongs to head-noun of the noun-compound.
Spacy. This is a widely known open-source
library for natural language processing and include
a syntactic dependency parser. Given an input
sequence, based on the result returned by the
dependency parser, the root of the sequence is chosen to
be the head-noun. We used the statistical model
it_core_news_sm2 released by Spacy for Italian
language.
4.3</p>
      </sec>
      <sec id="sec-5-3">
        <title>Evaluation metric</title>
        <p>
          The performance of the models are evaluated
using F1 score as in CoNLL-2003 NER evaluation
          <xref ref-type="bibr" rid="ref12">(Sang and Meulder, 2003)</xref>
          , which is a standard for
evaluating sequence tagging tasks.
4.4
        </p>
      </sec>
      <sec id="sec-5-4">
        <title>Results</title>
        <p>The results for the FDH dataset are shown in
Table 3. The baselines 1st token and Spacy achieve
1https://spacy.io/
2https://spacy.io/models/it
Baselines
1st token</p>
        <p>Spacy
Bi-LSTM
a) word_emb
b) a + hc_feat
c) a + char_emb
d) b + CRF
d) d + char_emb
a performance of 70.27 of 62.67 respectively. In
particular, the performance of syntactic
dependency parser from Spacy reiterates the difference
between the semantic and syntactic head. The
results are shown by incremental features, for the
proposed approach. The models reported
without CRF, are trained using a softmax function as
output layer to predict the tag. We can notice
from the results that using only the pre-trained
embeddings, the network suffers from a poor recall
and fails to achieve even the baseline performance.
However, using either character embedding or the
hand-crafted features, improves the performance
of the model on par with the baseline. Since the
single token head-noun in FDH dataset is very
high (as shown in table 2), learning the multi
token head-nouns and the dependency of tags is a
challenge. However, introducing the CRF layer to
jointly predict the sequence of tags in
combination with the hand crafted features, enables us to
predict multi-token heads and improve the
performance of the model to 78.09. Finally, the
character embeddings learned during training helps to
improves the recall further, reaching a F1 score of
79.58.
5</p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>Conclusion and Future Work</title>
      <p>We have addressed head-noun identification in
complex noun-compounds, a task of high
relevancy in utterance interpretation for dialogue
systems. We proposed a neural model, and
experiments on Italian food noun-compounds show that
the model is able to outperform strong baselines
even with a small amount of data. For the future
we plan to extend our investigation to other
domain and languages.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          <string-name>
            <given-names>Paul</given-names>
            <surname>Buitelaar</surname>
          </string-name>
          , Philipp Cimiano, and
          <string-name>
            <given-names>Bernardo</given-names>
            <surname>Magnini</surname>
          </string-name>
          .
          <year>2005</year>
          .
          <article-title>Ontology Learning from Text: Methods, Evaluation and Applications</article-title>
          , volume
          <volume>123</volume>
          <source>of Frontiers in Artificial Intelligence and Applications Series</source>
          . IOS Press, Amsterdam, 7.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          <string-name>
            <given-names>Geoffrey E.</given-names>
            <surname>Hinton</surname>
          </string-name>
          , Nitish Srivastava, Alex Krizhevsky, Ilya Sutskever, and
          <string-name>
            <surname>Ruslan</surname>
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Salakhutdinov</surname>
          </string-name>
          .
          <year>2012</year>
          .
          <article-title>Improving neural networks by preventing co-adaptation of feature detectors</article-title>
          . arXiv,
          <volume>07</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          <string-name>
            <given-names>A.</given-names>
            <surname>Graves</surname>
          </string-name>
          and
          <string-name>
            <given-names>J.</given-names>
            <surname>Schmidhuber</surname>
          </string-name>
          .
          <year>2005</year>
          .
          <article-title>Framewise phoneme classification with bidirectional lstm networks</article-title>
          .
          <source>In Proceedings. 2005 IEEE International Joint Conference on Neural Networks</source>
          ,
          <year>2005</year>
          ., volume
          <volume>4</volume>
          , pages
          <fpage>2047</fpage>
          -
          <lpage>2052</lpage>
          vol.
          <volume>4</volume>
          ,
          <string-name>
            <surname>July</surname>
          </string-name>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          <string-name>
            <given-names>Marco</given-names>
            <surname>Guerini</surname>
          </string-name>
          , Simone Magnolini, Vevake Balaraman, and
          <string-name>
            <given-names>Bernardo</given-names>
            <surname>Magnini</surname>
          </string-name>
          .
          <year>2018</year>
          .
          <article-title>Toward zeroshot entity recognition in task-oriented conversational agents</article-title>
          .
          <source>In Proceedings of the 19th Annual SIGdial Meeting on Discourse and Dialogue</source>
          , pages
          <fpage>317</fpage>
          -
          <lpage>326</lpage>
          , Melbourne, Australia, July.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          <string-name>
            <given-names>Sepp</given-names>
            <surname>Hochreiter</surname>
          </string-name>
          and
          <string-name>
            <given-names>Jürgen</given-names>
            <surname>Schmidhuber</surname>
          </string-name>
          .
          <year>1997</year>
          .
          <article-title>Long short-term memory</article-title>
          .
          <source>Neural computation</source>
          ,
          <volume>9</volume>
          (
          <issue>8</issue>
          ):
          <fpage>1735</fpage>
          -
          <lpage>1780</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          <string-name>
            <surname>John D. Lafferty</surname>
          </string-name>
          ,
          <string-name>
            <surname>Andrew McCallum</surname>
          </string-name>
          , and
          <string-name>
            <surname>Fernando</surname>
            <given-names>C. N.</given-names>
          </string-name>
          <string-name>
            <surname>Pereira</surname>
          </string-name>
          .
          <year>2001</year>
          .
          <article-title>Conditional random fields: Probabilistic models for segmenting and labeling sequence data</article-title>
          .
          <source>In Proceedings of the Eighteenth International Conference on Machine Learning, ICML '01</source>
          , pages
          <fpage>282</fpage>
          -
          <lpage>289</lpage>
          , San Francisco, CA, USA. Morgan Kaufmann Publishers Inc.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          <string-name>
            <given-names>Guillaume</given-names>
            <surname>Lample</surname>
          </string-name>
          , Miguel Ballesteros, Sandeep Subramanian, Kazuya Kawakami, and
          <string-name>
            <given-names>Chris</given-names>
            <surname>Dyer</surname>
          </string-name>
          .
          <year>2016</year>
          .
          <article-title>Neural architectures for named entity recognition</article-title>
          .
          <source>CoRR, abs/1603</source>
          .01360.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          <string-name>
            <given-names>Wang</given-names>
            <surname>Ling</surname>
          </string-name>
          , Chris Dyer, Alan W. Black, Isabel Trancoso, Ramon Fermandez, Silvio Amir, Luís Marujo, and
          <string-name>
            <given-names>Tiago</given-names>
            <surname>Luís</surname>
          </string-name>
          .
          <year>2015</year>
          .
          <article-title>Finding function in form: Compositional character models for open vocabulary word representation</article-title>
          .
          <source>In EMNLP.</source>
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          <string-name>
            <given-names>Tomáš</given-names>
            <surname>Mikolov</surname>
          </string-name>
          , Martin Karafiát, Lukáš Burget, Jan Cˇ ernocký, and
          <string-name>
            <given-names>Sanjeev</given-names>
            <surname>Khudanpur</surname>
          </string-name>
          .
          <year>2010</year>
          .
          <article-title>Recurrent neural network based language model</article-title>
          .
          <source>In Proceedings of the 11th Annual Conference of the International Speech Communication Association (INTERSPEECH</source>
          <year>2010</year>
          ), volume
          <volume>2010</volume>
          , pages
          <fpage>1045</fpage>
          -
          <lpage>1048</lpage>
          . International Speech Communication Association.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          <string-name>
            <given-names>Tomas</given-names>
            <surname>Mikolov</surname>
          </string-name>
          , Kai Chen, Greg Corrado, and
          <string-name>
            <given-names>Jeffrey</given-names>
            <surname>Dean</surname>
          </string-name>
          .
          <year>2013</year>
          .
          <article-title>Efficient estimation of word representations in vector space</article-title>
          .
          <source>CoRR, abs/1301</source>
          .3781.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          <string-name>
            <given-names>Preslav</given-names>
            <surname>Nakov</surname>
          </string-name>
          and
          <string-name>
            <given-names>Marti A.</given-names>
            <surname>Hearst</surname>
          </string-name>
          .
          <year>2013</year>
          .
          <article-title>Semantic interpretation of noun compounds using verbal and other paraphrases</article-title>
          .
          <source>TSLP</source>
          ,
          <volume>10</volume>
          (
          <issue>3</issue>
          ):
          <volume>13</volume>
          :
          <fpage>1</fpage>
          -
          <lpage>13</lpage>
          :
          <fpage>51</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          <string-name>
            <surname>Erik F. Tjong Kim Sang and Fien De Meulder</surname>
          </string-name>
          .
          <year>2003</year>
          .
          <article-title>Introduction to the conll-2003 shared task: Language-independent named entity recognition</article-title>
          .
          <source>CoRR, cs.CL/0306050.</source>
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          <string-name>
            <given-names>Vered</given-names>
            <surname>Shwartz</surname>
          </string-name>
          and
          <string-name>
            <given-names>Ido</given-names>
            <surname>Dagan</surname>
          </string-name>
          .
          <year>2018</year>
          .
          <article-title>Paraphrase to explicate: Revealing implicit noun-compound relations</article-title>
          .
          <source>In Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)</source>
          , pages
          <fpage>1200</fpage>
          -
          <lpage>1211</lpage>
          . Association for Computational Linguistics.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>