<!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>Digging Into Prerequisite Annotation</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Chiara Alzetta</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ilenia Galluccio</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Frosina Koceva</string-name>
          <email>frosina.kocevag@edu.unige.it</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Samuele Passalacqua</string-name>
          <email>samuele.passalacqua@dibris.unige.it</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ilaria Torre</string-name>
          <email>ilaria.torre@unige.it</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>DIBRIS, University of Genoa</institution>
          ,
          <country country="IT">Italy</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Intelligent textbooks are often engineered with an explicit representation of their concepts and prerequisite relations (PR). PR identi cation is hence crucial for intelligent textbooks but still presents some challenges, also when performed by human experts. This may cause PRannotated datasets to be inconsistent and compromise the accuracy of automatic creation of enhanced learning materials. This paper investigates possible reasons for PR disagreement and the nature of PR itself, with the aim of contributing to the development of shared strategies for PR annotation, analysis and modelling in textbooks.</p>
      </abstract>
      <kwd-group>
        <kwd>prerequisite relation annotation agreement</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>
        Fundamental functionalities of intelligent textbooks, such as content enrichment
[
        <xref ref-type="bibr" rid="ref21 ref23 ref9">23, 21, 9</xref>
        ] and personalization [
        <xref ref-type="bibr" rid="ref2 ref31 ref35">35, 31, 2</xref>
        ], exploit the knowledge contained in the
text to select relevant content and organise it according to a structure that
re ects the prerequisite relations (PR) among concepts [
        <xref ref-type="bibr" rid="ref17 ref19">17, 19</xref>
        ]. PRs are utterly
relevant in education since they establish which concepts are needed by a student
to understand a further concept without loss of information or misconceptions
[
        <xref ref-type="bibr" rid="ref1 ref14 ref15 ref20">20, 15, 1, 14</xref>
        ]. Despite their importance, PRs recognition, both in manual and
automatic form, still presents many open challenges. PR manual annotation is
in many cases a common way to achieve a PR-enriched intelligent textbook, but
is also an essential step for developing automatic textbook content modelling.
Systems for automatic PR learning (e.g. [
        <xref ref-type="bibr" rid="ref1 ref22">22, 1</xref>
        ]) often rely on manually annotated
gold standards [
        <xref ref-type="bibr" rid="ref15 ref29 ref34">29, 34, 15</xref>
        ] for evaluating or training machine learning algorithms.
Agreement rates [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] are often used to estimate annotations' reliability [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ], but
these measures are conditioned by many factors, including the design of the
annotation task and the subjectivity of the phenomenon to be labelled [
        <xref ref-type="bibr" rid="ref28 ref5">5, 28</xref>
        ].
PR-annotations rarely achieve high agreement values unless the annotation task
is extremely guided [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ]. A broad literature discusses causes of disagreement in
annotation [
        <xref ref-type="bibr" rid="ref11 ref12 ref7">12, 11, 7</xref>
        ], however this has not been fully explored for PRs. Our goal
Copyright c 2020 for this paper by its authors. Use permitted under Creative
Commons License Attribution 4.0 International (CC BY 4.0).
is to investigate this matter and highlight possible causes of errors and issues, in
order to provide a way to improve PR modelling for intelligent textbooks. This
is useful especially when increasing the size of the dataset is not a practical way
to reduce the impact of errors (as in case of high demanding and time-consuming
annotation tasks like PR).
2
      </p>
    </sec>
    <sec id="sec-2">
      <title>Experimental Study, Results and Discussion</title>
      <p>
        Our analyses are conducted on PRET dataset described in [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], obtained by
asking ve domain experts to manually annotate PRs between the concepts
mentioned in a computer science textbook chapter[
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]. Experts had to read the
text and in parallel annotate PRs among the encountered concepts. We stressed
this point since our annotation goal is to model the textbook content rather
than elicit the PR of a domain from the expert's mind. For the purpose of this
paper, in order to investigate the variability of annotations, we performed an
incontext annotation check, showing to each expert a subset of her/his annotations
and asking to con rm or revise their annotation, after reading again the text.
This process involved only \rare" annotations (concept pairs annotated only by
him/her) since errors are known to be more probable among them [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]. In the
end, the manual annotation resulted in 25 concept pairs annotated by all ve
experts, 46 annotated by four experts, 83 by three, 214 by two and 477 by only
one annotator, for a total of 845 unique pairs.
2.1 Interpretation Variability and Annotation Errors. This section deals
with the research question, i.e. which are the main causes of disagreement and
errors. Our results cannot be generalised but are discussed in the light of the
literature. During the annotation check mentioned above, we asked experts to
specify the motivation for their revisions, among the following: a) Not a
Concept : at least one concept of the pair is not a domain term; b) Background
Knowledge: the PR derives form the expert's domain knowledge since it's not
expressed in the text; c) Too Far : the concepts are too distant in the path; d)
Annotation Error : mistake due to distraction; e) Wrong Direction: the concepts
should be reversed; f ) Co-Requisites : there is no dependency relation between
the two concepts. The table in Fig.1 reports the distribution of these labels in the
revised pairs. Not a Concept is the most recurrent problem for all annotators:
common-usage terms like channel and system were added as domain concepts,
but then revised. As it will be discussed below, this error does not seem mostly
a trivial one, but an interpretation error commonly observed for educational
concepts [
        <xref ref-type="bibr" rid="ref33">33</xref>
        ], whose boundaries verge on subjectivity [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. Other error types are
unevenly distributed: Too Far seems again related to interpretation and
subjectivity issues, that may arise from the expert questioning his/her annotation style
(e.g., annotating as PR also indirectly related concepts), Background Knowledge
might be again accounted as annotation style error, however in this case it is not
due to subjectivity, but to wrong interpretation of the task (i.e., the tendency
to infer from other sources PRs that are not explicitly written in the text). The
last three types seem all due to distraction. While distraction is inevitable (thus
some kind of revision could be a good practice), subjectivity and annotation
style errors are more tricky, but the possibility of revision could allow to obtain
a more reliable annotation [
        <xref ref-type="bibr" rid="ref24 ref26">26, 24</xref>
        ]. Concept interpretation error will be analysed
below more in depth since it is particularly critical for intelligent textbooks, even
independently of PR relations, as discussed also in [
        <xref ref-type="bibr" rid="ref33">33</xref>
        ].
      </p>
      <p>
        Concept Interpretation. Despite the guidelines, the notion of concept was faced
in di erent ways, using a ne vs coarse-grained interpretation. To understand
the role played by concepts on agreement, we performed Pearson correlation
between root and leaf nodes (those with zero in- and out-degree respectively)
in annotations' graphs [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ]. Our intuition is that graphs with high root nodes
correlation suggest an agreement on what is intended as core knowledge, i.e.
Primary Notions (PN) for the domain; similarly, correlation on leaves, re ecting the
paths' Learning Outcomes (LO), indicates a common interpretation of concepts
granularity. We noticed that revision helped to harmonise the annotations: while
prior the revision we obtained on average a stronger correlation between root
nodes (0.49) than leaves (0.29) (p &lt; 0:05), on the revised graphs the correlations
became similar (0.47 for roots and 0.46 for leaves with p &lt; 0:05).
2.2 Semantic and Lexical Relationships in PRs. We investigate here if
there are any semantic relations and linguistic patterns that can be identi ed as
frequently occurring in PRs with high vs low agreement. As Fig.2 shows, lexical
relations are the most frequent semantic type among PRs with high agreement,
covering more than 60% of cases, while Functional Relations are more common
among PRs with low agreement. This could be due to the fact that taxonomies,
by de nition, exploit a\dependency relation" to classify elements. On the other
hand the Functional Relation is highly a ected by the presentation of concepts in
the text, which entails a text interpretation and a subsequent low agreement due
to subjectivity. Such distributions highlight the need for annotation guidelines
with clear examples of PRs not involved in lexical relations, since those types
might be harder to identify along a text and could give raise to disagreement.
2.3 Holistic Nature of the Annotation Process. Previous work [
        <xref ref-type="bibr" rid="ref29 ref34 ref36">29, 34,
36</xref>
        ] mostly addressed PR annotation and evaluation as a pairwise combination
of concepts; we also used this approach [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. However, we believe that such
approach over-simpli es the annotation and may result in misinterpretations of
the relations contained in the text. Indeed, semantic annotations often result in
(directed) graphs [
        <xref ref-type="bibr" rid="ref25 ref27 ref30">27, 25, 30</xref>
        ] in which each path is an interpretation of a relation
that arises from reading the whole text (this explains their holistic nature) and
should be evaluated accounting for those peculiarities. The commonly adopted
pairwise evaluation of PRs misses the interdependence between concepts involved
in a PR path and does not take into account the pedagogical characteristics of
the annotated graph as a whole. Temporal relation processing may represent an
interesting ground of comparison for PR, since precedence relation also shows
a transitive and sequential nature. Researchers in both elds encounter similar
limitations using traditional performance metrics used in information retrieval,
e.g. precision, recall [
        <xref ref-type="bibr" rid="ref32">32</xref>
        ]. A common scenario in both elds is when three items
A; B; C (concepts or events) are annotated by a rater such that A &lt; B and
B &lt; C, but another rater identi es the relation A &lt; C: in such cases,
traditional agreement metrics will fail to identify A &lt; C as a shared relation, even if
it is an implicit consequence of the other two relations [
        <xref ref-type="bibr" rid="ref32">32</xref>
        ]2. This suggests that
agreement could be computed by considering transitive edges and path
similarity in the two graphs. However, it is worth nothing that this approach involving
transitive closure might result in considering as PR some relations that are too
far in a path. This is an open issue, as well as the selection of proper metrics
to compare PR graph similarities. In our current work we are testing metrics
that work at di erent levels, among them Graph Edit Distance (GED), Vertex
Edge Overlap (VEO), PageRank, inter-agreement in learning pahts based on
the transitive characteristic of the PR (for details see [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ]). We believe this
research direction is a relevant contribution wrt the current approaches in order
to compute not just agreement between annotators, but also between automatic
methods for knowledge graph creation, highly useful in intelligent textbooks.
Conclusions In this paper we investigated di erent forms of disagreement on
PR annotation that a ect PR processing and management, and consequently
textbook modelling. Our aim is thus to contribute to the modelling of PR
structure in textbooks by developing a subjectivity-aware PR coding protocol. The
analysis also opens the study of future research on using fuzzy PRs for
structuring knowledge behind text instead of yes/no (binary) PRs.
2 &lt; indicates both the temporal relation before and the prerequisite relation
      </p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Adorni</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Alzetta</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Koceva</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Passalacqua</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Torre</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          :
          <article-title>Towards the identi cation of propaedeutic relations in textbooks</article-title>
          .
          <source>In: International Conference on Arti cial Intelligence in Education</source>
          . pp.
          <volume>1</volume>
          {
          <fpage>13</fpage>
          . Springer (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Alpizar-Chacon</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sosnovsky</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          : Interlingua:
          <article-title>Linking textbooks across di erent languages (</article-title>
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Alzetta</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Koceva</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Passalacqua</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Torre</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Adorni</surname>
          </string-name>
          , G.:
          <article-title>Pret: Prerequisiteenriched terminology. a case study on educational texts</article-title>
          .
          <source>In: Proceedings of the Fifth Italian Conference on Computational Linguistics</source>
          CLiC-it
          <year>2018</year>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Alzetta</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Miaschi</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Adorni</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dell'Orletta</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Koceva</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Passalacqua</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Torre</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          :
          <article-title>Prerequisite or not prerequisite? that's the problem! an nlp-based approach for concept prerequisites learning</article-title>
          .
          <source>In: 6th Italian Conference on Computational Linguistics</source>
          , CLiC-it
          <year>2019</year>
          . vol.
          <volume>2481</volume>
          .
          <string-name>
            <surname>CEUR-WS</surname>
          </string-name>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Amidei</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Piwek</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Willis</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Rethinking the agreement in human evaluation tasks (</article-title>
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Artstein</surname>
          </string-name>
          , R.:
          <article-title>Inter-annotator agreement</article-title>
          .
          <source>In: Handbook of linguistic annotation</source>
          , pp.
          <volume>297</volume>
          {
          <fpage>313</fpage>
          . Springer (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Artstein</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Poesio</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Inter-coder agreement for computational linguistics</article-title>
          .
          <source>Computational Linguistics</source>
          <volume>34</volume>
          (
          <issue>4</issue>
          ),
          <volume>555</volume>
          {
          <fpage>596</fpage>
          (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Bayerl</surname>
            ,
            <given-names>P.S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Paul</surname>
            ,
            <given-names>K.I.</given-names>
          </string-name>
          :
          <article-title>What determines inter-coder agreement in manual annotations? a meta-analytic investigation</article-title>
          .
          <source>Computational Linguistics</source>
          <volume>37</volume>
          (
          <issue>4</issue>
          ),
          <volume>699</volume>
          {
          <fpage>725</fpage>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Boulanger</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kumar</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          :
          <article-title>An overview of recent developments in intelligent etextbooks and reading analytics (</article-title>
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Brookshear</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Brylow</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          : Computer Science:
          <article-title>An Overview, Global Edition, chap. 4 Networking and the Internet</article-title>
          .
          <source>Pearson Education Limited</source>
          . (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Carletta</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          :
          <article-title>Assessing agreement on classi cation tasks: the kappa statistic</article-title>
          .
          <source>Computational linguistics 22(2)</source>
          ,
          <volume>249</volume>
          {
          <fpage>254</fpage>
          (
          <year>1996</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Feinstein</surname>
            ,
            <given-names>A.R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cicchetti</surname>
            ,
            <given-names>D.V.</given-names>
          </string-name>
          :
          <article-title>High agreement but low kappa: I. the problems of two paradoxes</article-title>
          .
          <source>Journal of clinical epidemiology 43(6)</source>
          ,
          <volume>543</volume>
          {
          <fpage>549</fpage>
          (
          <year>1990</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Fort</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nazarenko</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rosset</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Modeling the complexity of manual annotation tasks: a grid of analysis</article-title>
          .
          <source>In: International Conference on Computational Linguistics</source>
          . pp.
          <volume>895</volume>
          {
          <issue>910</issue>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Gagne</surname>
            ,
            <given-names>R.M.</given-names>
          </string-name>
          :
          <article-title>Learning hierarchies</article-title>
          .
          <source>Educational psychologist 6(1)</source>
          , 1{
          <issue>9</issue>
          (
          <year>1968</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Gasparetti</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>De Medio</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Limongelli</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sciarrone</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Temperini</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Prerequisites between learning objects: Automatic extraction based on a machine learning approach</article-title>
          .
          <source>Telematics and Informatics</source>
          <volume>35</volume>
          (
          <issue>3</issue>
          ),
          <volume>595</volume>
          {
          <fpage>610</fpage>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Koceva</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Alzetta</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Galluccio</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Passalacqua</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Torre</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          :
          <article-title>Prerequisite similarity metrics</article-title>
          , http://teldh.dibris.unige.it/pr-similarity-metrics/
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Labutov</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Huang</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Brusilovsky</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>He</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Semi-supervised techniques for mining learning outcomes and prerequisites</article-title>
          .
          <source>In: Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining</source>
          . pp.
          <volume>907</volume>
          {
          <fpage>915</fpage>
          .
          <string-name>
            <surname>ACM</surname>
          </string-name>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fabbri</surname>
            ,
            <given-names>A.R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tung</surname>
            ,
            <given-names>R.R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Radev</surname>
            ,
            <given-names>D.R.</given-names>
          </string-name>
          :
          <article-title>What should i learn rst: Introducing lecturebank for nlp education and prerequisite chain learning</article-title>
          .
          <source>Proceedings of AAAI</source>
          <year>2019</year>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Liang</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ye</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pursel</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Giles</surname>
            ,
            <given-names>C.L.</given-names>
          </string-name>
          :
          <article-title>Investigating active learning for concept prerequisite learning</article-title>
          .
          <source>Proc. EAAI</source>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>Manrique</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sosa</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Marino</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nunes</surname>
            ,
            <given-names>B.P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cardozo</surname>
          </string-name>
          , N.:
          <article-title>Investigating learning resources precedence relations via concept prerequisite learning</article-title>
          .
          <source>In: 2018 IEEE/WIC/ACM International Conference on Web Intelligence (WI)</source>
          . pp.
          <volume>198</volume>
          {
          <fpage>205</fpage>
          .
          <string-name>
            <surname>IEEE</surname>
          </string-name>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <surname>Matsuda</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shimmei</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          : Pastel:
          <article-title>Evidence-based learning engineering method to create intelligent online textbook at scale (</article-title>
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          22.
          <string-name>
            <surname>Miaschi</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Alzetta</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cardillo</surname>
            ,
            <given-names>F.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dell'Orletta</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          :
          <article-title>Linguistically-driven strategy for concept prerequisites learning on italian</article-title>
          .
          <source>In: Proceedings of 14th Workshop on Innovative Use of NLP for Building Educational Applications (BEA</source>
          <year>2019</year>
          )
          <article-title>(</article-title>
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          23.
          <string-name>
            <surname>Miller</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ranum</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Runestone interactive: tools for creating interactive course materials</article-title>
          .
          <source>In: Proceedings of the rst ACM conference on Learning@ scale conference</source>
          . pp.
          <volume>213</volume>
          {
          <fpage>214</fpage>
          .
          <string-name>
            <surname>ACM</surname>
          </string-name>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          24.
          <string-name>
            <surname>Plank</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hovy</surname>
          </string-name>
          , D., S gaard, A.:
          <article-title>Linguistically debatable or just plain wrong? In: Proceedings of the 52nd Annual Meeting of the Association for Computational Linguistics (volume 2: Short Papers)</article-title>
          . pp.
          <volume>507</volume>
          {
          <issue>511</issue>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          25.
          <string-name>
            <surname>Poesio</surname>
            ,
            <given-names>M.:</given-names>
          </string-name>
          <article-title>The mate/gnome proposals for anaphoric annotation, revisited</article-title>
          .
          <source>In: Proceedings of the 5th SIGdial Workshop on Discourse and Dialogue at HLTNAACL 2004</source>
          . pp.
          <volume>154</volume>
          {
          <issue>162</issue>
          (
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          26.
          <string-name>
            <surname>Pustejovsky</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stubbs</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Natural Language Annotation for Machine Learning: A guide to corpus-building for applications. "</article-title>
          <string-name>
            <surname>O'Reilly Media</surname>
          </string-name>
          ,
          <source>Inc."</source>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          27.
          <string-name>
            <surname>Ries</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          :
          <article-title>Segmenting conversations by topic, initiative, and style</article-title>
          .
          <source>In: Workshop on Information Retrieval Techniques for Speech Applications</source>
          . pp.
          <volume>51</volume>
          {
          <fpage>66</fpage>
          . Springer (
          <year>2001</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          28. Saldan~a, J.:
          <article-title>The coding manual for qualitative researchers</article-title>
          .
          <source>Sage</source>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          29.
          <string-name>
            <surname>Talukdar</surname>
            ,
            <given-names>P.P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cohen</surname>
            ,
            <given-names>W.W.</given-names>
          </string-name>
          :
          <article-title>Crowdsourced comprehension: predicting prerequisite structure in wikipedia</article-title>
          .
          <source>In: Proceedings of the Seventh Workshop on Building Educational Applications Using NLP</source>
          . pp.
          <volume>307</volume>
          {
          <fpage>315</fpage>
          .
          <article-title>Association for Computational Linguistics (</article-title>
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          30.
          <string-name>
            <surname>Tannier</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Muller</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Evaluating temporal graphs built from texts via transitive reduction</article-title>
          .
          <source>Journal of Arti cial Intelligence Research</source>
          <volume>40</volume>
          ,
          <volume>375</volume>
          {
          <fpage>413</fpage>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          31.
          <string-name>
            <surname>Thaker</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Brusilovsky</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>He</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Student modeling with automatic knowledge component extraction for adaptive textbooks (</article-title>
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          32.
          <string-name>
            <surname>UzZaman</surname>
          </string-name>
          , N.,
          <string-name>
            <surname>Allen</surname>
          </string-name>
          , J.:
          <article-title>Temporal evaluation</article-title>
          .
          <source>In: Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies</source>
          . pp.
          <volume>351</volume>
          {
          <issue>356</issue>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref33">
        <mixed-citation>
          33.
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chau</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Thaker</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Brusilovsky</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>He</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Concept annotation for intelligent textbooks</article-title>
          . arXiv preprint arXiv:
          <year>2005</year>
          .
          <volume>11422</volume>
          (
          <year>2020</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref34">
        <mixed-citation>
          34.
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ororbia</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wu</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Williams</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Liang</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pursel</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Giles</surname>
            ,
            <given-names>C.L.</given-names>
          </string-name>
          :
          <article-title>Using prerequisites to extract concept maps from textbooks</article-title>
          .
          <source>In: Proceedings of the 25th acm international on conference on information and knowledge management</source>
          . pp.
          <volume>317</volume>
          {
          <fpage>326</fpage>
          .
          <string-name>
            <surname>ACM</surname>
          </string-name>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref35">
        <mixed-citation>
          35.
          <string-name>
            <surname>Yin</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Uosaki</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chu</surname>
            ,
            <given-names>H.C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hwang</surname>
            ,
            <given-names>G.J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hwang</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hatono</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tabata</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          :
          <article-title>Learning behavioral pattern analysis based on students' logs in reading digital books</article-title>
          .
          <source>In: Proceedings of the 25th international conference on computers in education</source>
          . pp.
          <volume>549</volume>
          {
          <issue>557</issue>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref36">
        <mixed-citation>
          36.
          <string-name>
            <surname>Zhou</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Xiao</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          :
          <article-title>Extracting prerequisite relations among concepts in wikipedia</article-title>
          .
          <source>In: 2019 International Joint Conference on Neural Networks (IJCNN)</source>
          . pp.
          <volume>1</volume>
          {
          <issue>8</issue>
          .
          <string-name>
            <surname>IEEE</surname>
          </string-name>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>