<!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>CitySAT: a System for the Semantic Answer Type Prediction Task⋆</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Chaeyoon Kim</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ernesto Jimen´ez-Ruiz</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>City, University of London</institution>
          ,
          <addr-line>London</addr-line>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>SIRIUS, University of Oslo</institution>
          ,
          <country country="NO">Norway</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>This paper describes the CitySAT system that we developed for the DBpedia Answer Type (AT) prediction task of the SMART 2021 challenge. The challenge can be interpreted as a multi-class classification task that takes natural language questions and returns pairs of the predicted answer category and types. For training, we merged the SMART 2021 DBpedia dataset with the 2020 dataset given for the previous year's AT task. In this study, three local Machine Learning (ML) models are deployed to cover the three diferent types of task and question (category prediction, literal type prediction and resource type prediction). The best model obtains a 98.36% accuracy for the category prediction using a Logistic Regression (LR) classifier. Similarly, another LR model results in 97.90% accuracy for the literal type prediction task. Lastly we also built a Multi-Layer Perceptron (MLP) model to deal with several ontology classes (∼ 760 classes for DBpedia) in the resource type prediction task. The best MLP model achieves 79.34% on the merged training dataset. The final system output obtained a 98.4% accuracy, 84.2% NDCG@5, and 85.4% NDCG@10 on the (oficial) test dataset.</p>
      </abstract>
      <kwd-group>
        <kwd>Semantic answer type prediction</kwd>
        <kwd>SMART DBpedia challenge</kwd>
        <kwd>multi-class classification</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>In computer science, Answer Type prediction (AT) is a research domain
providing with simplified tasks of the Question Answering (QA) discipline. It inherits
the QA task missions to understand the meaning of natural language
questions but identifies their answer types instead of retrieving the most relevant
information among the answer candidates. Due to the number of classes of the
categorical answer type candidates, AT task can be interpreted as a multi-class
text classification task upon pre-defined classes.</p>
      <p>
        The SeMantic Answer type and Relation prediction Task (SMART),1
organized by the International Semantic Web Conference (ISWC), expands the AT
⋆ Copyright ©2021 for this paper by its authors. Use permitted under Creative
Commons License Attribution 4.0 International (CC BY 4.0).
1 https://smart-task.github.io/
challenge to a more complicated structure of knowledge base data which
consists of the answer category and type in two hierarchical levels. They provide
two versions of large-scale dataset for the AT task; one edition using DBpedia
ontology (∼ 760 classes) and the other edition using the Wikidata taxonomy
(∼ 50K classes). This paper demonstrates our participation in the SMART 2021
AT task [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], concentrating only on the DBpedia dataset, that takes a set of
natural language questions alongside with the corresponding answer category and
ontological type classes of DBpedia to predict a suitable type for new questions.
The reason of the dataset choice is because of the clearer separation between
ontology (i.e., terminology) and data (i.e., assertions) in DBpedia.
      </p>
      <p>The CitySAT system firstly verifies the accuracy score of the answer category
prediction and additionally uses the lenient Normalized Discounted Cumulative
Gain (NDCG) at each 5 and 10 answer type values to compete with comparable
systems. The best optimization confirms 98.4% accuracy, 84.2% NDCG@5, and
85.4% NDCG@10. As NDCG evaluation metric follows a linear decay, NDCG@10
is highly valued and our result proves to the beneficiaries that the more
predeifned knowledge the better the system predicts.</p>
      <p>The rest of the paper is structured as follows. Section 2 (Context) surveys the
used materials and related work. Section 3 (Methods) presents a detailed view of
the entire research progress from data loading to evaluation with justifications
for each of the steps. Section 4 (Results) summarizes the respective high-valued
experiments. Section 5 (Discussion and Future work) examines what is a
meaningful correlation between our research motivation and results that conclude
the next stage of studies. The code for reproducing the experimental results
of this study is publicly available at https://github.com/chaeyoonyunakim/
smart-2021-AT.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Context: Materials and related work</title>
      <p>
        SMART 2020 [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] published eight AT systems on the DBpedia dataset that our
research aimed at comparing as reference models for SMART 2021.
      </p>
      <p>
        To start with training datasets, the previous work (e.g., [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] and [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ])
supports the positive efect of larger training datasets and thereby this study also
tried to maximize the volume of the training data by merging every relevant
resource. Table 1 gives an overview of our merged training dataset size compared to
SMART 2020 and 2021 challenge dataset. Originally the prior DBpedia edition
contained 21,940 questions but the later edition has increased the data size up
to 45,774. At the end, our study settled down on the merged training data with
39,556 set of questions and model answers. SMART datasets are designed to
provide a single answer category either “boolean”, “literal”, or “resource”. They
assign the “boolean” category as “boolean”, “literal” category into an answer
type either “number”, “date”, or “string”. For the “resource” category, DBpedia
ontology classes are placed in the answer type.
      </p>
      <p>Another one of the most important observations over the previous work is
that they presented a very high accuracy for their answer category classifier
on the upper level of the hierarchical data structure. For the 2020 performance
results, Table 2 shows that top ranked outputs even exceeded over 90% accuracy.
It led an initial decision that our experiments can be conducted on traditional
Central Processing Units (CPUs). Due to the increased data volume, however, it
is worth to define how to selectively adapt the referencing models in this study.
Hence, some initial data analysis on lower level hierarchy (i.e., targets on the
answer type) is following in next section.
2.1</p>
      <sec id="sec-2-1">
        <title>Initial data analysis</title>
        <p>
          Regarding the shape of the bottom level data for answer type, Figure 1 gives
details how many ontological classes are located in the resource type. Both 2020
and 2021 DBpedia editions are mostly consisted of equal or less than 6 answer
types, but the distribution of type value numbers is more positively skewed in the
2020 edition. Therefore, the previous systems considered the first five (e.g., [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ])
or six values (e.g., [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ]) for their local classifier to predict the resource type. Some
questions of 2021 edition are shown to have more than 10 ontology classes: 666
questions are assigned between 11 and 30 types, and 9 questions have up to 627
types which are all going to be excluded from the NDCG evaluation matrix as it
measures up to 10 classes. In this study, we would try to train by every number
of type values up to 10 so that it can be compared with last year performance.
        </p>
        <p>
          To understand the context of the answer type, Figure 2 illustrates an example
question and how its ontological classes are lined up in the given dataset. Among
the classes, there is an exception (dbo:Location) which is defined as an entity
in DBpedia but it is considered as a class having an equal level with dbo:Place
specifically in SMART 2020 and SMART 2021 shared tasks. As explained in [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ],
the 2020 edition is sorted to have the most general class at the end. In spite
of that, the 2021 edition is in the mixed order of classes. For example, the
answer “type” in Figure 2 can be rearranged to [“dbo:River”, “dbo:Stream”,
· · · , “dbo:NaturalPlace”, “dbo:Place”, “dbo:Location”] if the same principle as
in the 2020 edition is applied. Because of the computational logic in NDCG, this
study has an initial hypothesis that the order of the classes in the answer type
does not afect the later normalised distance thereby there is no need to apply
extra logic to sort the term orders.
3
        </p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Methods</title>
      <sec id="sec-3-1">
        <title>Data loading and manipulation</title>
        <p>In SMART AT task, the training dataset and test dataset share the same JSON
format (see example below). Comparing the DBpedia datasets from the two
SMART editions, at first glance, we found the “id” attribute changed its value
from “dbpedia 1” to “1” and this has been taken into account when merging the
datasets according to the arrangement in the 2021 edition.
{
"id": "1",
"question": "Who are the gymnasts coached by Amanda Reddin?",
"category": "resource",
"type": ["dbo:Gymnast", "dbo:Athlete", "dbo:Person", "dbo:Agent"]
}</p>
        <p>
          This study uses Python pandas library [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ] for data manipulation. Firstly,
it loads each year’s dataset into a tabular representation as shown in Figure 3.
Through the data cleaning, both year’s datasets match a single answer
category (either boolean, literal, or resource) and at least one answer type per each
question. Lastly, the duplicates are removed when a question and
corresponding answer are the same, however, the diverse answers for a questions are kept.
Figure 4 gives example cases of our dataset pre-processing.
        </p>
        <p>To construct a robust data structure, feature engineering is necessary to drop
the missing value observations such as zero number of type values in resource
category and invalid values such as “n/a” in question. Due to the NDCG evaluation
at the 10th answer type, we justify outliers as having more than 10 components
in the answer type. In the case of not having the counter number of components,
an indicator of missing value has to be marked since the evaluation matrix will
return infinite distance of type path that means no relevance between the output
(i.e., prediction types) and the ground truth (i.e., gold types).</p>
        <p>
          As the ground truth was not open for the 2021 challenge, this study used
20% of the merged training dataset for validation to check the performance of
the system. For submission, the test dataset (9,104 questions) is predicted by
the best model trained with the entire training dataset (39,556 questions and
answers).
This study uses the NLTK library [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ] to parse natural language question inputs
into tokenized words, and also normalise text with PorterStemmer (stemming)
and WordNetLemmatizer (lemmatization) after stop-words removal.
        </p>
        <p>Initially, this study was specifically interested in dealing with Wh-terms
(Who, What, When, Where, Which, Whom, Whose, Why, and include How)
questions which accounts for 84.4% of the training questions. So, we customized
stop words dictionaries to exclude the Wh-terms. Unfortunately, however, the
new stop-words removal works less eficiently in despite of the initial interests.
Hence, this study keeps the original NLTK stop words for further analysis.</p>
        <p>
          Additionally, this study explores term-frequency (TF) and inverse
termfrequency (TF-IDF) in text feature extraction using CountVectorizer and
TFIDFVectorizer from the scikit-learn library [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ] from lessons of [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ]. Empirical
evidence concludes that applying the combination of stemming and TF for the first
10,000 unigram or bigrams is the best suitable for the SMART AT task.
        </p>
        <p>Categorical targets (answer category and type) are mapped into numerical
labels. In particular, we distribute the answer type by wish-number of training
target classes and encode “missing” if nothing exists in the location. For example,
Figure 5 illustrates a sample conceptual data when we select the 10 values of
the answer type across all categories. The classifiers can be programmed to have
the first and single value (i.e., type1 column in Figure 5) if the category is
either “boolean” or “literal”. However, one or more values are taken when the
category is “resource”. The order of values is mixed as stated in Figure 2, and
our justification is to select the first five to ten values.</p>
        <p>
          Furthermore, the selective number of features are mapped into a dictionary
with keys for an indicator of the value’s location. For example, by setting the
argument type no 11 (i.e., type1 to type10) in the reference code below,
dictionary keys [“type1”, · · · , “type10”] and dictionary values [{“dbo:Opera”: 0,
· · · “dbo:RadioStation”: 297}, · · · , {“dbo:Politician”: 0, · · · , “dbo:Entomologist”:
21}] will create 10 json files for {“type1”: {“dbo:Opera”: 0, · · · “dbo:RadioStation”:
297}} to {“type10: {“dbo:Settlement”: 0, · · · , “dbo:Village”: 21}}. The final
accumulated dictionary of type maps is {“type1”: {”dbo:EducationalInstitution”:
0, · · · , “dbo:Holiday”: 282}, “type2”: {“dbo:MusicalWork”: 0, · · · “dbo::Presenter”:
171}, · · · , “type10”: {“dbo:Politician”: 0, · · · , “dbo:Entomologist”: 21}}.
To perform hierarchical classification, this study considers local classifiers per
level as shown in Figure 6 which is widely used in the state-of-the-art (e.g., [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ],
[
          <xref ref-type="bibr" rid="ref10">10</xref>
          ], and [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ]) because of the imbalanced number of classes among the
classification group. Whilst both the category prediction and the “literal” type prediction
are for each three unique classes, the “resource” type prediction is towards ∼ 760
unique classes.
        </p>
        <p>
          To decide a suitable classifier for each level, we implemented a small
sample batch of python codes with several Machine Learning (ML) algorithms by
importing SVM, LogisticRegression (LR), and MLPClassifier (MLP) from
scikitlearn [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ] and used them on SMART 2020 dataset (17,571 questions and answers
for training, 4,360 questions for test) for comparison with reference models
performance. To check the baseline performance, three sample ML models are
initially determined for answer category classification and they return the
acceptable performance: SVM (kernel = ‘linear’, random state = 0, probability=True)
results 87%, LogisticRegression(multi class=‘multinomial’, solver=‘lbfgs’) results
88%, and MLPClassifier (hidden layer sizes = (11, 11, 11), max iter = 500)
results 85% respectively. Additionally, this study finds that the MLP model is
more eficient in many number of classes such as resource type ( ∼ 760 classes)
than literal type (3 classes) classification. Then, we moved the confirmed
implementation to the merged training dataset to align with the SMART 2021 task
requirements.
3.4
        </p>
      </sec>
      <sec id="sec-3-2">
        <title>Multi-classification model implementation</title>
        <p>CitySAT system is programmed in Google Colab CPU environment with two
processing threads. The evaluation of each stage algorithms has been conducted
with validation data which is 20% of the training dataset.</p>
        <p>By expanding experiments from Section 3.3, we get the best optimised
hyperparameters in a combination system of two LRs and a MLP as briefly captured
in the Appendix. Figure 7 shows the results of the design of our classification
model from top to bottom level, starting from a single LR model which classifies
the answer category at the top level. Two diferent models are used to classify the
answer type at the bottom level: a LR model for the type of the literal category
and a MLP model for the type of the resource category.</p>
        <p>As last step, to meet the submission format specifications, it is essential to
decode all mapping data and convert the format back to the JSON format as
shown by the JSON below. The CitySAT system workflow is depicted in Figure 8.
{
"id": "5586",
"category": "resource",
"type": ["dbo:Company", "dbo:Activity", "dbo:RecordLabel", "dbo:Agent",
"dbo:Species", "dbo:Organisation", "dbo:AdministrativeRegion",
"dbo:Location", "dbo:Country", "dbo:PopulatedPlace"]
}
other two scores (Accuracy, NDCG@5) are similar. The best results of CitySAT
is ranked at the top in DBpedia AT task.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Discussion and future works</title>
      <p>With the given DBpedia data in the SMART 2021 AT challenge, this study
tried various explorations on text normalization. Including filters of Wh-terms
in stop words, there were multiple congfiuration settings we could have imagined
to have improvement in classification performance which was not the case for
this challenge. This opens the door for future work in finding how to improve
the text features involving semantic meanings in a more human thought process.</p>
      <p>Although CitySAT models are optimised in Section 3.4 to find the best
combination of local classifiers for two levels, there might be more options and diferent
combinations of models that can be discovered in the future. Especially, once we
expand our evaluation environment to a Graphics Processing Unit (GPU), there
are more applicable ML models for our problem.</p>
      <p>
        As in previous studies, we have also found that several of the participating
systems used the fine-tuned BERT models [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. Because of limitations on
computing resources, however, this study intentionally deploys the ML models in
CPU computation with inexpensive computational cost during the project. In
the future, injecting the BERT model in CitySAT is possible to check if any
performance benefits in the AT task.
      </p>
    </sec>
    <sec id="sec-5">
      <title>Acknowledgements</title>
      <p>We would like to thank the ISWC conference and the SMART challenge
organisers. This work was partially supported by the SIRIUS Centre for Scalable Data
Access (Research Council of Norway).
Appendix
# distribute categorical targets (answer category &amp; type) to numericals
def type_to_int(self, data, type_no):
return data.type.map(
lambda x: self.type_maps[f"type{type_no}"][x[type_no - 1]]
if len(x) &gt;= type_no
else self.type_maps[f"type{type_no}"]["missing"]
)</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Ammar</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mehryar</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Celebi</surname>
            ,
            <given-names>R.:</given-names>
          </string-name>
          <article-title>A methodology for hierarchical classification of semantic answer types of questions</article-title>
          .
          <source>In: SMART@ ISWC</source>
          . pp.
          <fpage>41</fpage>
          -
          <lpage>48</lpage>
          (
          <year>2020</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Bill</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <article-title>Jimen´ez-</article-title>
          <string-name>
            <surname>Ruiz</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          :
          <article-title>Question embeddings for semantic answer type prediction</article-title>
          .
          <source>In: SMART@ ISWC</source>
          (
          <year>2020</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Bird</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Klein</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Loper</surname>
          </string-name>
          , E.:
          <article-title>Natural language processing with Python: analyzing text with the natural language toolkit</article-title>
          . ”
          <string-name>
            <surname>O'Reilly Media</surname>
          </string-name>
          , Inc.” (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Devlin</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chang</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lee</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Toutanova</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          :
          <article-title>BERT: pre-training of deep bidirectional transformers for language understanding</article-title>
          .
          <source>In: Proceedings of the</source>
          <year>2019</year>
          <article-title>Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, NAACL-HLT 2019, Minneapolis</article-title>
          , MN, USA, June 2-7,
          <year>2019</year>
          , Volume
          <volume>1</volume>
          (Long and Short Papers). pp.
          <fpage>4171</fpage>
          -
          <lpage>4186</lpage>
          (
          <year>2019</year>
          ). https://doi.org/10.18653/v1/n19-1423, https://doi.org/10.18653/v1/n19-
          <fpage>1423</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Kertkeidkachorn</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nararatwong</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nguyen</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yamada</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Takeda</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ichise</surname>
          </string-name>
          , R.:
          <article-title>Hierarchical contextualized representation models for answer type prediction</article-title>
          .
          <source>In: SMART@ ISWC</source>
          . pp.
          <fpage>49</fpage>
          -
          <lpage>56</lpage>
          (
          <year>2020</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Mihindukulasooriya</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dubey</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gliozzo</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lehmann</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ngomo</surname>
            ,
            <given-names>A.N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Usbeck</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rossiello</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kumar</surname>
            ,
            <given-names>U.</given-names>
          </string-name>
          :
          <article-title>Semantic answer type and relation prediction task (SMART 2021)</article-title>
          .
          <source>CoRR abs/2112</source>
          .07606 (
          <year>2021</year>
          ), https://arxiv.org/abs/ 2112.07606
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Mihindukulasooriya</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dubey</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gliozzo</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lehmann</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ngonga</surname>
            <given-names>Ngomo</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>A.C.</given-names>
            ,
            <surname>Usbeck</surname>
          </string-name>
          , R.:
          <article-title>SeMantic AnsweR Type Prediction Task at ISWC 2020 Semantic Web Challenge</article-title>
          .
          <source>CEUR-WS</source>
          <volume>2774</volume>
          (
          <year>2020</year>
          ), http://ceur-ws.
          <source>org/</source>
          Vol-
          <volume>2774</volume>
          /
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Nikas</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fafalios</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tzitzikas</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          :
          <article-title>Two-stage semantic answer type prediction for question answering using bert and class-specificity rewarding</article-title>
          .
          <source>In: SMART@ ISWC</source>
          . pp.
          <fpage>19</fpage>
          -
          <lpage>28</lpage>
          (
          <year>2020</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Pedregosa</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Varoquaux</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gramfort</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Michel</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Thirion</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Grisel</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Blondel</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Prettenhofer</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Weiss</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dubourg</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vanderplas</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Passos</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cournapeau</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Brucher</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Perrot</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Duchesnay</surname>
          </string-name>
          , E.:
          <article-title>Scikit-learn: Machine learning in Python</article-title>
          .
          <source>Journal of Machine Learning Research</source>
          <volume>12</volume>
          ,
          <fpage>2825</fpage>
          -
          <lpage>2830</lpage>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Perevalov</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Both</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Augmentation-based answer type classification of the smart dataset</article-title>
          .
          <source>In: SMART@ ISWC</source>
          . pp.
          <fpage>1</fpage>
          -
          <lpage>9</lpage>
          (
          <year>2020</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Setty</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Balog</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          :
          <article-title>Semantic answer type prediction using bert: Iai at the iswc smart task 2020</article-title>
          . arXiv preprint arXiv:
          <volume>2109</volume>
          .06714 (
          <year>2021</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Steinmetz</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sattler</surname>
          </string-name>
          , K.U.:
          <article-title>Coala-a rule-based approach to answer type prediction</article-title>
          .
          <source>In: SMART@ ISWC</source>
          . pp.
          <fpage>29</fpage>
          -
          <lpage>40</lpage>
          (
          <year>2020</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13. pandas development team, T.: pandas-dev/pandas: Pandas (Feb
          <year>2020</year>
          ). https://doi.org/10.5281/zenodo.3509134, https://doi.org/10.5281/zenodo. 3509134
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Vallurupalli</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sleeman</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Finin</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          , et al.:
          <article-title>Fine and ultra-fine entity type embeddings for question answering</article-title>
          . In: International Semantic Web Conference (
          <year>2020</year>
          )
          <article-title># model for category classification clf_category = LogisticRegression( random_state=seed,penalty='elasticnet',solver='saga', l1_ratio=0.2,n_jobs=-1,verbose=2,max_iter=200) .fit(X_train_category,y_train_category) # model for type of literal category clf_literal = LogisticRegression( random_state=seed,penalty='elasticnet',solver='saga', l1_ratio=0.5,n_jobs = -1,verbose = 2,max_iter = 200) .fit(X_train_category[train_literal_rows</article-title>
          ,:], y_train_literal) #
          <article-title>model for type of resource category clf_type = MLPClassifier( random_state=seed</article-title>
          ,max_iter=10, hidden_layer_sizes=(
          <volume>1000</volume>
          ,
          <fpage>500</fpage>
          ,300),
          <source>verbose=2)</source>
          <article-title>.fit(X_train_category[train_resource_rows],y_train_type)</article-title>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>