<!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>Code Mixed Entity Extraction in Indian Languages using Neural Networks</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Manish Shrivastava LTRC</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>IIIT-H Hyderabad</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>India m.shrivastava@iiit.ac.in</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Irshad Ahmad Bhat LTRC, IIIT-H Hyderabad</institution>
          ,
          <country country="IN">India</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Riyaz Ahmad Bhat LTRC, IIIT-H Hyderabad</institution>
          ,
          <country country="IN">India</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>In this paper we present our submission for FIRE 2016 Shared Task on Code Mixed Entity Extraction in Indian Languages. We describe a Neural Network system for Entity Extraction in Hindi-English Code Mixed text. Our method uses distributed word representations as features for the Neural Network and therefore, can easily be replicated across languages. Our system ranked first place for Hindi-English with an F1-score of 68.24% .</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>INTRODUCTION</title>
      <p>This paper describes our system for the FIRE 2016 Shared Task
on Code Mixed Entity Extraction in Indian Languages. The
workshop focuses on NLP approaches for identifying named entities
such as Person names, Organization names, Product names,
Location names etc. in code mixed text.</p>
      <p>In this paper, we present a simple feed forward neural network
for Named Entity Recognision (NER) that use distributed word
representations built using word2vec [2] and no other
languagespecific resources but the unlabeled corpora.</p>
      <p>The rest of the paper is organized as follows: In Section 2, we
discuss about the data of the shared task. In Section 3, we
discuss the methodology we adapted to address the problem of NER,
in detail. Experiments and Results based on our methodology are
discussed in Section 4. Finally we conclude in Section 5.</p>
    </sec>
    <sec id="sec-2">
      <title>DATA</title>
      <p>The Entity Extraction in the Code-Mixed (CM) data in Indian
Languages shared task is meant for NER in 2 language pairs namely,
Hindi-English (H-E) and Telugu-English (T-E). However, we only
recived data for Hindi-English language pair.</p>
    </sec>
    <sec id="sec-3">
      <title>Data Format</title>
      <p>
        The training data is provided into two files; a raw-tweets file and
an annotation file. (
        <xref ref-type="bibr" rid="ref1">1</xref>
        ) below, shows the format of raw tweets in
train and test data, while (
        <xref ref-type="bibr" rid="ref2">2</xref>
        ) shows the format of named entity
annotations for the training data.
      </p>
      <p>
        (
        <xref ref-type="bibr" rid="ref1">1</xref>
        ) TweetID, UserID, Tweet
(
        <xref ref-type="bibr" rid="ref2">2</xref>
        ) TweetID, UserID, NE-Tag, NE, startIndex, Length
      </p>
    </sec>
    <sec id="sec-4">
      <title>Data Statistics</title>
      <p>Table 1 shows the train and test data stattictics after tokenization.
Table 2 shows the tag statistics in the training data. Note that the
OTHER tag in table 2 is not any NE tag. We introduced this tag for
all non-NE tokens.</p>
      <p>Data-set</p>
      <p>Train
Test
# Tweets
2,700
7,429
# Tokens
39,216
1,50,056</p>
      <p>Tag
ENTERTAINMENT</p>
      <p>PERSON</p>
      <p>LOCATION
ORGANIZATION</p>
      <p>COUNT
PERIOD
ARTIFACT</p>
      <p>DATE
MONEY</p>
      <p>DAY</p>
      <p>Tag
LOCOMOTIVE</p>
      <p>YEAR
MATERIALS</p>
      <p>TIME
FACILITIES
LIVTHINGS</p>
      <p>DISEASE</p>
      <p>SDAY
MONTH
OTHER
3.</p>
    </sec>
    <sec id="sec-5">
      <title>METHODOLOGY</title>
      <p>We modelled the task into a classification problem where each
token needs to be labelled with one of the 20 tags as given in table 2.
For this classification task, we use a simple neural network
architecture. The neural network model is the standard feed-forward
neural network with a single layer of hidden units. The output
layer uses softmax function for probabilistic multi-class
classification. The model is trained by minimizing cross entropy loss with an
l2-regularization over the entire training data. We use mini-batch
Adagrad for optimization and apply dropout.</p>
      <p>We explored various token level and contextual features to build
an optimal Neural Network using the provided training data. These
features can be broadly grouped as described below:
Contextual Word Features: They constitute the current word and
2 words to either side of the current word.</p>
      <p>Contextual Prefix Features: They constitute the current word
prefix and prefixes of 2 words to either side of the current word. All
these prefixes are of length 3.</p>
      <p>Contextual Suffix Features: They constitute the current word
suffix and suffixes of 2 words to either side of the current word. All
these suffixes are of length 3.</p>
      <p>Non-lexical Features: They constitute capitalization feature and
length feature. Capitalization feature represents if a word is in
upper-case, lower-case or title-case. Length feature represents the
token length in the form of bins: 1-5, 6-8 and rest. The non-lexical
features are added for the current word only.</p>
      <p>We include the lexical features in the input layer of the
Neural Network using the distributed word representations while for
the non-lexical features we use randomly initialized 3-dimensional
vectors within a range of 0:25 to +0:25. We use Hindi and
English monolingual corpora to learn the distributed representation of
the lexical units. The English monolingual data contains around
280M sentences, while the Hindi data is comparatively smaller
and contains around 40M sentences. To learn the suffix and
prefix embeddings, we simply crated prefix and suffix corpora from
the original monolingual corpora of Hindi and English and then
use word2vec to learn their embeddings.</p>
      <p>Instead of a single language specific word embedding for each
lexical feature, we use a concatenated vector from Hindi and
English word embeddings. This approach has three main benefits.
First, we do not need a language identification system to choose
the embedding space of a lexical item. Second, we do not depend
on a joint word embedding space which is usually trained using
a costly bilingual lexicon. Third, the named entities are usually
shared between the languages. This provides a two-way evidence
to the training model to learn named entities. We use [1]
transliteration system 1 to transliterate Roman words to Devanagari, so that
we can extract their embeddings from the Hindi embeddings space.
Apart from named entities Hindi words will not be present in the
English embedding space and English words will not be present in
the Hindi embedding space.</p>
    </sec>
    <sec id="sec-6">
      <title>EXPERIMENTS AND RESULTS</title>
      <p>In any non-linear neural network model, we need to tune a
number of hyperparameters for an optimal performance. The
hyperparameters include number of hidden units, choice of activation
function, choice of optimizer, learning rate, dropout,
dimensionality of input units, etc. We used 20% of training data for
tuning these parameters. The optimal parameters include: 200 hidden
units, adagrad optimizer, rectilinear activation function, 200 bacth
size, 0.025 learning rate, 0.5 dropout and 25 training iterations.
We obtained best development set accuracy at 80 dimensional word
embeddings and 20 dimensional prefix and suffix embeddings.
Development set results are given in Table 3. Test set results are given
in Table 4</p>
      <p>NE-TAG
ARTIFACT</p>
      <p>COUNT
DATE</p>
      <p>DAY</p>
      <p>DISEASE
ENTERTAINMENT</p>
      <p>LOCATION
LOCOMOTIVE
MATERIALS</p>
      <p>MONEY</p>
      <p>MONTH
ORGANIZATION</p>
      <p>PERIOD
PERSON</p>
      <p>TIME</p>
      <p>YEAR
avg / total</p>
      <p>Precision
1.00
0.67
1.00
1.00
0.00
0.98
0.88
0.00
0.00
0.00
0.00
1.00
0.64
0.98
0.00
1.00
0.92</p>
      <p>Recall
0.10
0.46
0.43
1.00
0.00
0.62
0.54
0.00
0.00
0.00
0.00
0.07
0.78
0.68
0.00
1.00
0.57</p>
      <p>F1-score
0.18
0.55
0.60
1.00
0.00
0.76
0.67
0.00
0.00
0.00
0.00
0.13
0.70
0.80
0.00
1.00
0.68
5.</p>
    </sec>
    <sec id="sec-7">
      <title>CONCLUSION</title>
      <p>In this paper, we proposed a resource light Neural Network
architecture for Entity Extraction in Hindi-English Code Mixed text.
The Neural Network uses distributed representation of lexical
features learned from monolingual corpora. Despite the simplesity of
our architecture we achieved best results.
6.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>I. A.</given-names>
            <surname>Bhat</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Mujadia</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Tammewar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. A.</given-names>
            <surname>Bhat</surname>
          </string-name>
          , and
          <string-name>
            <given-names>M.</given-names>
            <surname>Shrivastava</surname>
          </string-name>
          .
          <article-title>Iiit-h system submission for fire2014 shared task on transliterated search</article-title>
          .
          <source>In Proceedings of the Forum for Information Retrieval Evaluation</source>
          , FIRE '
          <volume>14</volume>
          , pages
          <fpage>48</fpage>
          -
          <lpage>53</lpage>
          , New York, NY, USA,
          <year>2015</year>
          . ACM.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>T.</given-names>
            <surname>Mikolov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Chen</surname>
          </string-name>
          , G. Corrado, and
          <string-name>
            <given-names>J.</given-names>
            <surname>Dean</surname>
          </string-name>
          .
          <article-title>Efficient estimation of word representations in vector space</article-title>
          .
          <source>arXiv preprint arXiv:1301.3781</source>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>