<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="pado-2017-question">
    <titleInfo>
        <title>Question Difficulty – How to Estimate Without Norming, How to Use for Automated Grading</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Ulrike</namePart>
        <namePart type="family">Padó</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>2017-09</dateIssued>
    </originInfo>
    <typeOfResource>text</typeOfResource>
    <relatedItem type="host">
        <titleInfo>
            <title>Proceedings of the 12th Workshop on Innovative Use of NLP for Building Educational Applications</title>
        </titleInfo>
        <name type="personal">
            <namePart type="given">Joel</namePart>
            <namePart type="family">Tetreault</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <name type="personal">
            <namePart type="given">Jill</namePart>
            <namePart type="family">Burstein</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <name type="personal">
            <namePart type="given">Claudia</namePart>
            <namePart type="family">Leacock</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <name type="personal">
            <namePart type="given">Helen</namePart>
            <namePart type="family">Yannakoudakis</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <originInfo>
            <publisher>Association for Computational Linguistics</publisher>
            <place>
                <placeTerm type="text">Copenhagen, Denmark</placeTerm>
            </place>
        </originInfo>
        <genre authority="marcgt">conference publication</genre>
    </relatedItem>
    <abstract>Question difficulty estimates guide test creation, but are too costly for small-scale testing. We empirically verify that Bloom’s Taxonomy, a standard tool for difficulty estimation during question creation, reliably predicts question difficulty observed after testing in a short-answer corpus. We also find that difficulty is mirrored in the amount of variation in student answers, which can be computed before grading. We show that question difficulty and its approximations are useful for automated grading, allowing us to identify the optimal feature set for grading each question even in an unseen-question setting.</abstract>
    <identifier type="citekey">pado-2017-question</identifier>
    <identifier type="doi">10.18653/v1/W17-5001</identifier>
    <location>
        <url>https://aclanthology.org/W17-5001</url>
    </location>
    <part>
        <date>2017-09</date>
        <extent unit="page">
            <start>1</start>
            <end>10</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Conference Proceedings
%T Question Difficulty – How to Estimate Without Norming, How to Use for Automated Grading
%A Padó, Ulrike
%Y Tetreault, Joel
%Y Burstein, Jill
%Y Leacock, Claudia
%Y Yannakoudakis, Helen
%S Proceedings of the 12th Workshop on Innovative Use of NLP for Building Educational Applications
%D 2017
%8 September
%I Association for Computational Linguistics
%C Copenhagen, Denmark
%F pado-2017-question
%X Question difficulty estimates guide test creation, but are too costly for small-scale testing. We empirically verify that Bloom’s Taxonomy, a standard tool for difficulty estimation during question creation, reliably predicts question difficulty observed after testing in a short-answer corpus. We also find that difficulty is mirrored in the amount of variation in student answers, which can be computed before grading. We show that question difficulty and its approximations are useful for automated grading, allowing us to identify the optimal feature set for grading each question even in an unseen-question setting.
%R 10.18653/v1/W17-5001
%U https://aclanthology.org/W17-5001
%U https://doi.org/10.18653/v1/W17-5001
%P 1-10

Markdown (Informal)

[Question Difficulty – How to Estimate Without Norming, How to Use for Automated Grading](https://aclanthology.org/W17-5001) (Padó, BEA 2017)

• Question Difficulty – How to Estimate Without Norming, How to Use for Automated Grading (Padó, BEA 2017)

ACL

• Ulrike Padó. 2017. Question Difficulty – How to Estimate Without Norming, How to Use for Automated Grading. In Proceedings of the 12th Workshop on Innovative Use of NLP for Building Educational Applications, pages 1–10, Copenhagen, Denmark. Association for Computational Linguistics.