<!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>IIT-BHU at CIQ 2019 : Classification of Insincere Questions</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Akanksha Mishra</string-name>
          <email>akanksham.rs.cse17@itbhu.ac.in</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Sukomal Pal</string-name>
          <email>spal@itbhu.ac.in</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Computer Science and Engineering, Indian Institute of Technology (BHU)</institution>
          ,
          <addr-line>Varanasi - 221005</addr-line>
          ,
          <country country="IN">India</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2019</year>
      </pub-date>
      <abstract>
        <p>This paper presents details of the work done by the team of IIT (BHU) Varanasi for the “Classification of Insincere Questions” track organized in the FIRE 2019. We implement bidirectional long short term memory using pre trained GloVe word embedding. Further, we analysed the results with diferent other embeddings. 1 https://expandedramblings.com/index.php/quora-statistics/</p>
      </abstract>
      <kwd-group>
        <kwd>Quora Insincere question</kwd>
        <kwd>Bidirectional Long Short Term Memory</kwd>
        <kwd>GloVe embedding</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>In today’s era, all the major websites on the internet are facing the challenge of
providing appropriate content on their space. They are relying on the user of the
website for marking unsafe content so that they can remove those contents and
hence make the content of their website safe. Quora is one of the widely used
websites on the internet with the user base of 300 million monthly users1. We
can ask questions on any topic that afect us or the world; moreover, if we want
to have an opinion of experts about any real-world incidents or how others would
have tackled any particular situation. We can get interesting answers about all
the stuf that we care about.
The people are frequently using web forums like StackOverflow, Quora, and
many more for getting answers to their information-seeking questions. However,
with the vast user base, some people tend to ask questions with objectionable
content. Sometimes, some questions are posted to target some specific group
or spread hate speech. It is challenging for the human moderators to filter out
insincere questions manually due to the vast number of questions. The task is
about the identification of non-information seeking questions with the varying
characteristics into one of the six
categories:– Rhetorical questions
– Sexual Content
– Hate Speech
– Hypothetical
– Other
– Not an Insincere question
3</p>
    </sec>
    <sec id="sec-2">
      <title>Data and Resources</title>
      <p>Task organizers provided participants with the question id and label assigned
to each question for 900 training instances. Due to dataset sharing constraints
of kaggle, they could not provide the question text; hence the participants were
supposed to extract the question text from the competition organized on the
kaggle2 website using question id. We extracted the question text from the data
section of the competition on kaggle and formed the training set. Each instance
of the training set consists of the question id, question text, and label assigned
to it. A sample of the training set is given below in table 1.</p>
      <p>Figure 1 shows the distribution of training instances among diferent categories.
It can be seen from figure 1 that there is an imbalance of training instances
among diferent categories.</p>
      <p>Data Preprocessing: We perform preprocessing by removing punctuation,
‘#’,‘@’ and ‘https’ symbols. We keep the stop words and hashtag words to get a
better understanding of the context during training. Also, we removed numerals
as with diferent contexts they play diferent roles in question texts; hence, we
feel it is better to remove them. We also lowercased all the texts of the question.
2 https://www.kaggle.com/c/quora-insincere-questions-classification
Algorithm 1: System Description</p>
      <p>
        Feature Representation: We use pre-trained GloVe [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] word embedding to
represent words in the form of vectors. Diferent versions of glove pre-trained
embedding exist; however, we use embedding trained of dimension 300 on common
crawl using 840B tokens and 2.2M vocabulary3. We generated random
embedding of dimension 300 for out of vocabulary words.
      </p>
      <p>
        Model Description: We determine the maximum length of the sentence from
question texts of all training instances. We perform padding of the question text
in each training instance whose sentence length is less than the maximum length
of the question texts. We use bidirectional Long Short Term Memory[
        <xref ref-type="bibr" rid="ref1 ref4">1, 4</xref>
        ] layer
followed by dropout layer to avoid overfitting. We added a fully connected dense
layer at the end.
5
      </p>
    </sec>
    <sec id="sec-3">
      <title>Results</title>
      <p>In this section, we will discuss the experimental settings, results obtained with
the model, and further analysis of the results.</p>
      <p>
        Experimental Settings: We use Keras4 neural network library for training our
model which uses Tensorflow as backend. The model is trained for ten epochs
with a batch size of 32. We use a validation split of 0.3 to analyze the overfitting
using validation loss that may occur during training. Table 2 list out the values
for parameters and hyperparameters used for training the model.
Analysis: The task organizers shared the true labels of the test instances hence
we used diferent other word embeddings for further analysis. The accuracy
obtained using diferent embeddings with Bidirectional LSTM model is listed in
the table 3. Model M2 was submitted for the evaluation. We trained vocabulary
of the train set using word2vec[
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] continuous bag of words architecture in model
3 https://nlp.stanford.edu/projects/glove/
4 https://keras.io
M1; however, we used pre-trained embedding paragram[
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] in model M3. In the
case of GloVe, it is observed that there are 60 out of vocabulary words; however,
only 40 words of the vocabulary were not present in paragram embedding. All
three embeddings represent each word of dimension 300.
      </p>
    </sec>
    <sec id="sec-4">
      <title>Conclusion</title>
      <p>We used a bidirectional Long short term memory model for classification of
insincere questions on Quora. The system can be used for the automatic classification
of insincere questions. We obtained an accuracy of 64.35% on the test set. We
can incorporate linguistic features to improve the system.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <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 Comput</source>
          .
          <volume>9</volume>
          (
          <issue>8</issue>
          ),
          <fpage>1735</fpage>
          -
          <lpage>1780</lpage>
          (
          <year>Nov 1997</year>
          ). https://doi.org/10.1162/neco.
          <year>1997</year>
          .
          <volume>9</volume>
          .8.1735, http://dx.doi.org/10.1162/neco.
          <year>1997</year>
          .
          <volume>9</volume>
          .8.
          <fpage>1735</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Mikolov</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Corrado</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dean</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          :
          <article-title>Eficient estimation of word representations in vector space (</article-title>
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Pennington</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Socher</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Manning</surname>
          </string-name>
          , C.D.: Glove:
          <article-title>Global vectors for word representation</article-title>
          .
          <source>In: Empirical Methods in Natural Language Processing (EMNLP)</source>
          . pp.
          <fpage>1532</fpage>
          -
          <lpage>1543</lpage>
          (
          <year>2014</year>
          ), http://www.aclweb.org/anthology/D14-1162
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Schuster</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Paliwal</surname>
            ,
            <given-names>K.:</given-names>
          </string-name>
          <article-title>Bidirectional recurrent neural networks</article-title>
          .
          <source>Trans. Sig. Proc</source>
          .
          <volume>45</volume>
          (
          <issue>11</issue>
          ),
          <fpage>2673</fpage>
          -
          <lpage>2681</lpage>
          (
          <year>Nov 1997</year>
          ). https://doi.org/10.1109/78.650093, http://dx.doi.org/10.1109/78.650093
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Wieting</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bansal</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gimpel</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Livescu</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          :
          <article-title>From paraphrase database to compositional paraphrase model and back</article-title>
          .
          <source>Transactions of the Association for Computational Linguistics</source>
          <volume>3</volume>
          ,
          <fpage>345</fpage>
          -
          <lpage>358</lpage>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>