<!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>Segmenting Student Answers to Textual Exercises Based on Topic Modeling</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Jan Philip Bernius</string-name>
          <email>janphilip.bernius@tum.de</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Anna Kovaleva</string-name>
          <email>anna.kovaleva@tum.de</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Bernd Bruegge</string-name>
          <email>bruegge@in.tum.de</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Informatics, Technical University of Munich</institution>
          ,
          <addr-line>Munich</addr-line>
          ,
          <country country="DE">Germany</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2020</year>
      </pub-date>
      <fpage>72</fpage>
      <lpage>73</lpage>
      <abstract>
        <p>-Giving feedback when grading textual exercises in very large courses is a challenge, especially when instructors want to provide consistent feedback to each student in real-time already during the lecture. This paper outlines a real-time assessment approach based on topic modeling and reuse. Segmenting student answers fosters a structured form of feedback, improving the feedbacks' reusability. We present the design of an answer segmentation system, to be integrated with an assessment system for textual exercises. The resulting system aims at quicker and more consistent feedback for textual exercises and an improved learning experience for students.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>I. INTRODUCTION</title>
      <p>
        With a growing number of students enrolled at
universities worldwide,1 large courses have thousands of students
participating. Large courses pose a problem for instructors
when grading textual exercises. The main problem is the
asynchronous assessment, which usually requires a week of
time, or even longer. To reduce this delay, we teach interactive
lectures where we combine theory and exercises live during the
lectures, grade them immediately and provide quick feedback
to students [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. This increases student comprehension and
deepens understanding.
      </p>
      <p>
        Technology to foster interaction and discussion within large
courses does exist [
        <xref ref-type="bibr" rid="ref2 ref3">2, 3</xref>
        ], as well as scalable exercise
systems for programming and modeling exercises with automatic
assessment [
        <xref ref-type="bibr" rid="ref4 ref5">4, 5</xref>
        ]. Textual exercises are commonly used in
examination, but no automatic assessment solution is available
on the market for this exercise type.
      </p>
      <p>
        Conducting open answer questions requires time-consuming
activities from instructors, including designing exercises and
manual assessment, due to the high variability in student
answers. To reduce efforts, instructors tend to reuse
exercises from previous years. Grading is a repeatable process,
instructors look for common mistakes or predefined solution
patterns. The students’ learning success benefits from detailed
and personalized feedback [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. To enable large scale courses,
the need to reuse feedback comments arises. Individual
feedback can still rely on the domain expertise of the teacher.
      </p>
      <p>Multiple graders require means to create consistent feedback
for learners.</p>
      <p>
        This paper outlines a segmentation algorithm to be applied
to student answers to textual exercises. It is intended to be
used as part of an assessment system for textual exercises,
fostering reuse of feedback between students and increasing
consistency between assessments [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ].
      </p>
    </sec>
    <sec id="sec-2">
      <title>II. SEGMENTING STUDENT ANSWER</title>
      <p>
        We abstracted the topic modeling approach and preserve
the idea that every answer is a collection of topics, and
many topics are distributed among different answers [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. We
compensate for the scarcity of the words in the answers by
reducing topics to keywords. Another strategy adapted from
other works is ”vocabulary introduction” [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]. As soon as new
keywords are introduced, a new segment begins. The presented
approach differs from thesaurus or ontology in a way that we
do not know what the keywords are going to be, and they are
calculated for every problem separately.
      </p>
      <p>
        The algorithm can be separated into three phases: Text
Preprocessing, Keyword Extraction and Segmentation. Figure 1
depicts the algorithm’s flow of events, which is described in
detail in the following sections. Segments can be used as a
baseline for providing manual structured instructor feedback,
or as a unit for assessment systems to generate feedback
automatically [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ].
      </p>
      <sec id="sec-2-1">
        <title>A. Text Preprocessing</title>
        <p>Student answers are of inconsistent quality in regards to
spelling, formatting and use of punctuation. Poor data
quality impacts the segmentation quality negatively. Due to the
nature of the system, manual preprocessing is not practical.
Student submissions must not be modified, as feedback should
be based on the original answer only. We correct common
irregularities to an intermediate format suitable for further
calculations.</p>
        <p>
          Removing stop words from text is a very common way
to clean textual data for Natural Language Processing (NLP)
tasks [
          <xref ref-type="bibr" rid="ref10 ref9">9, 10</xref>
          ]. Words like ”I”, ”the”, ”what” and ”did” do not
contain much lexical content and can be removed.
        </p>
        <p>Lemmatization is the process of reducing a word to its
meaningful root. Naturally, students use different forms of a</p>
        <sec id="sec-2-1-1">
          <title>TTeTexextxBtBtlBololcockckk</title>
          <p>Remove
punctuation
Convert to
lower-case
Remove stop
words
Lemmatize all
words
Extract
keywords</p>
        </sec>
        <sec id="sec-2-1-2">
          <title>KKKeeeyywywwooorrdrdd</title>
          <p>Stem keywords</p>
          <p>Merge text
blocks between
topic shifts
[ same keywords found ]
TopicShift
[ new keywords found ]
Search for
stemmed
keywords</p>
        </sec>
        <sec id="sec-2-1-3">
          <title>SSeSenentnetetnencncecee</title>
          <p>Atomic Text
Segment
word: either singular or plural, different tenses, degrees of
comparison, etc. The result of the text preprocessing is a set
of lemmatized lower-case words without any punctuation or
stop words.</p>
        </sec>
      </sec>
      <sec id="sec-2-2">
        <title>B. Keyword Extraction</title>
        <p>We generalize the idea of topic modeling that claims that
every student’s submission is a collection of topics that are
common among different answers. Compensating for data
scarcity, we reduce each topic to a single keyword.</p>
        <p>The resulting keywords are the ten most frequently used
words in the texts. The number was chosen empirically based
on our data.</p>
      </sec>
      <sec id="sec-2-3">
        <title>C. Segmentation</title>
        <p>The segmentation of the texts is split up into two steps:
First, the answers are split up into initial text blocks. Second,
adjacent text blocks are considered and merged if there are
no new keywords introduced. The result of this is a set of
segments for each answer.</p>
        <p>
          For identifying sentences we use a pre-trained model of
the ”punkt tokenizer” [
          <xref ref-type="bibr" rid="ref11 ref12">11, 12</xref>
          ] and a custom implementation
for bulleted lists. To identify clauses we rely on conjunctions.
This is an incomplete clause identification approach, however
sufficient for this use case. We consider that subordinating
conjunctions indicate a new clause, only considering sentences
that are longer than 20 words to reduce false positives.
        </p>
        <p>
          We use a stemmer to unify different forms of a word in the
text. Based on lexical cohesion and vocabulary introduction
[
          <xref ref-type="bibr" rid="ref13 ref9">9, 13</xref>
          ], we define segments. Within each student answer, the
extracted keywords are compared for adjacent segments. A
change in keywords signals a topic shift. For equal keywords,
segments are merged into a single text block.
        </p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>III. SUMMARY</title>
      <p>In this paper we have presented a high level overview of a
new algorithm based on topic modeling and text segmentation
to segment student answers into topically coherent text blocks.
Following a ”divide &amp; conquer” approach, we first divide
student answers into initial, small segments and then merge
them according to topic boundaries to larger text blocks.</p>
      <p>The algorithm produces topically coherent segments.
Segments allow for more structured assessment approaches,
similar to how modeling exercises can be assessed today. This
enables use of semi-automated assessment systems to be
used in the assessment process, reducing the delay between
exercise and feedback. Further, tools can help to keep feedback
consistent between students, as comparisons can be made
between segments.</p>
      <p>The result of the algorithm’s application can be improved in
two areas: (1) deriving keywords and text blocks using
statistical models, topic models, or decision trees. (2) Additionally, a
thesaurus could be used to recognize synonyms. Future work
is needed to evaluate this algorithm in a lecture setting.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>S.</given-names>
            <surname>Krusche</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Seitz</surname>
          </string-name>
          , J. Bo¨rstler, and
          <string-name>
            <given-names>B.</given-names>
            <surname>Bruegge</surname>
          </string-name>
          , “
          <article-title>Interactive learning: Increasing student participation through shorter exercise cycles,” in 19th Australasian Computing Education Conference</article-title>
          . ACM,
          <year>2017</year>
          , pp.
          <fpage>17</fpage>
          -
          <lpage>26</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>J.</given-names>
            <surname>Knobloch</surname>
          </string-name>
          and E. Gigantiello, “AMATI:
          <article-title>Another massive audience teaching instrument</article-title>
          ,” in 15. Workshop fu¨r Software Engineering im Unterricht der Hochschulen,
          <year>2017</year>
          , pp.
          <fpage>63</fpage>
          -
          <lpage>68</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>R.</given-names>
            <surname>Mayer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Stull</surname>
          </string-name>
          , K. DeLeeuw,
          <string-name>
            <given-names>K.</given-names>
            <surname>Almeroth</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Bimber</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Chun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Bulger</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Campbell</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Knight</surname>
          </string-name>
          , and
          <string-name>
            <given-names>H.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , “
          <article-title>Clickers in college classrooms: Fostering learning with questioning methods in large lecture classes,” Contemporary Educational Psychology</article-title>
          , vol.
          <volume>34</volume>
          , pp.
          <fpage>51</fpage>
          -
          <lpage>57</lpage>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>S.</given-names>
            <surname>Krusche</surname>
          </string-name>
          and
          <string-name>
            <given-names>A.</given-names>
            <surname>Seitz</surname>
          </string-name>
          , “
          <article-title>Artemis: An automatic assessment management system for interactive learning</article-title>
          ,
          <source>” in 49th ACM Technical Symposium on Computer Science Education. ACM</source>
          ,
          <year>2018</year>
          , pp.
          <fpage>284</fpage>
          -
          <lpage>289</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>S.</given-names>
            <surname>Krusche</surname>
          </string-name>
          and
          <string-name>
            <given-names>A.</given-names>
            <surname>Seitz</surname>
          </string-name>
          , “
          <article-title>Increasing the Interactivity in Software Engineering MOOCs -</article-title>
          A
          <source>Case Study,” in 52nd Hawaii International Conference on System Sciences</source>
          ,
          <year>2019</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>10</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>A.</given-names>
            <surname>Poulos and M. J. Mahony</surname>
          </string-name>
          , “
          <article-title>Effectiveness of feedback: the students' perspective,” Assessment &amp; Evaluation in Higher Education</article-title>
          , vol.
          <volume>33</volume>
          , no.
          <issue>2</issue>
          , pp.
          <fpage>143</fpage>
          -
          <lpage>154</lpage>
          ,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>J. P.</given-names>
            <surname>Bernius</surname>
          </string-name>
          and
          <string-name>
            <given-names>B.</given-names>
            <surname>Bruegge</surname>
          </string-name>
          , “
          <article-title>Towards the Automatic Assessment of Text Exercises,”</article-title>
          <source>in 2nd Workshop on Innovative Software Engineering Education</source>
          ,
          <year>2019</year>
          , pp.
          <fpage>19</fpage>
          -
          <lpage>22</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>D. M.</given-names>
            <surname>Blei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. Y.</given-names>
            <surname>Ng</surname>
          </string-name>
          , and
          <string-name>
            <surname>M. I. Jordan</surname>
          </string-name>
          , “Latent dirichlet allocation,
          <source>” J. Mach. Learn. Res.</source>
          , vol.
          <volume>3</volume>
          , pp.
          <fpage>993</fpage>
          -
          <lpage>1022</lpage>
          ,
          <year>2003</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>M. A.</given-names>
            <surname>Hearst</surname>
          </string-name>
          , “Texttiling:
          <article-title>Segmenting text into multi-paragraph subtopic passages</article-title>
          ,
          <source>” Computational Linguistics</source>
          , vol.
          <volume>23</volume>
          , pp.
          <fpage>33</fpage>
          -
          <lpage>64</lpage>
          ,
          <year>1997</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>A.</given-names>
            <surname>Hulth</surname>
          </string-name>
          , “
          <article-title>Improved automatic keyword extraction given more linguistic knowledge,” in Conference on Empirical Methods in Natural Language Processing</article-title>
          . ACL,
          <year>2003</year>
          , pp.
          <fpage>216</fpage>
          -
          <lpage>223</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>S.</given-names>
            <surname>Bird</surname>
          </string-name>
          , E. Klein, and
          <string-name>
            <given-names>E.</given-names>
            <surname>Loper</surname>
          </string-name>
          ,
          <source>Natural Language Processing with Python, 1st ed. O'Reilly Media</source>
          , Inc.,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>T.</given-names>
            <surname>Kiss</surname>
          </string-name>
          and
          <string-name>
            <given-names>J.</given-names>
            <surname>Strunk</surname>
          </string-name>
          , “
          <article-title>Unsupervised multilingual sentence boundary detection,” Comput</article-title>
          . Linguist., vol.
          <volume>32</volume>
          , no.
          <issue>4</issue>
          , pp.
          <fpage>485</fpage>
          -
          <lpage>525</lpage>
          ,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>M. A. K.</given-names>
            <surname>Halliday</surname>
          </string-name>
          and
          <string-name>
            <given-names>R.</given-names>
            <surname>Hasan</surname>
          </string-name>
          ., Cohesion in English, ser.
          <source>English Language Series. London: Longman</source>
          ,
          <year>1976</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>