Pith. sign in

REVIEW 1 cited by

Introducing a framework to assess newly created questions with Natural Language Processing

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2004.13530 v2 pith:X4WAFFAT submitted 2020-04-28 cs.CL cs.LG

classification cs.CLcs.LG
keywords questionsdifficultydiscriminationframeworkmodelsnewlycharacteristicschoice
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Statistical models such as those derived from Item Response Theory (IRT) enable the assessment of students on a specific subject, which can be useful for several purposes (e.g., learning path customization, drop-out prediction). However, the questions have to be assessed as well and, although it is possible to estimate with IRT the characteristics of questions that have already been answered by several students, this technique cannot be used on newly generated questions. In this paper, we propose a framework to train and evaluate models for estimating the difficulty and discrimination of newly created Multiple Choice Questions by extracting meaningful features from the text of the question and of the possible choices. We implement one model using this framework and test it on a real-world dataset provided by CloudAcademy, showing that it outperforms previously proposed models, reducing by 6.7% the RMSE for difficulty estimation and by 10.8% the RMSE for discrimination estimation. We also present the results of an ablation study performed to support our features choice and to show the effects of different characteristics of the questions' text on difficulty and discrimination.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Not eXactly Byzantine: Efficient and Resilient TEE-Based State Machine Replication

    cs.DC 2025-01 conditional novelty 6.0 of 10

    NxBFT is a TEE-based, asynchronous, leaderless DAG consensus protocol that achieves the highest throughput in the authors' comparison against MinBFT and Chained-Damysus for up to 40 replicas, at the cost of higher lat...

Pith tools