MétaCan
Menu
Back to cohort

Question Generation for Reading Comprehension Assessment by Modeling How and What to Ask

2022· article· en· W4285155190 on OpenAlexaff
Bilal Ghanem, Lauren Lutz Coleman, Julia Rivard Dexter, Spencer von der Ohe, Alona Fyshe

Bibliographic record

VenueFindings of the Association for Computational Linguistics: ACL 2022 · 2022
Typearticle
Languageen
FieldComputer Science
TopicTopic Modeling
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsReading comprehensionComputer scienceComprehensionReading (process)Focus (optics)Artificial intelligenceNatural language processingMathematics educationLinguisticsPsychology

Abstract

fetched live from OpenAlex

Reading is integral to everyday life, and yet learning to read is a struggle for many young learners.During lessons, teachers can use comprehension questions to increase engagement, test reading skills, and improve retention.Historically such questions were written by skilled teachers, but recently language models have been used to generate comprehension questions.However, many existing Question Generation (QG) systems focus on generating literal questions from the text, and have no way to control the type of the generated question.In this paper, we study QG for reading comprehension where inferential questions are critical and extractive techniques cannot be used.We propose a two-step model (HTA-WTA) that takes advantage of previous datasets, and can generate questions for a specific targeted comprehension skill.We propose a new reading comprehension dataset that contains questions annotated with story-based reading comprehension skills (SBRCS), allowing for a more complete reader assessment.Across several experiments, our results show that HTA-WTA outperforms multiple strong baselines on this new dataset.We show that the HTA-WTA model tests for strong SCRS by asking deep inferential questions.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.003
metaresearch head score (Gemma)0.022
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.006
Threshold uncertainty score0.018

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0030.022
Meta-epidemiology (narrow)0.0020.000
Meta-epidemiology (broad)0.0010.002
Bibliometrics0.0030.002
Science and technology studies0.0010.001
Scholarly communication0.0020.004
Open science0.0030.002
Research integrity0.0030.003
Insufficient payload (model declined to judge)0.0050.005

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.022
GPT teacher head0.283
Teacher spread0.261 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations21
Published2022
Admission routes1
Has abstractyes

Explore more

Same venueFindings of the Association for Computational Linguistics: ACL 2022Same topicTopic ModelingFrench-language works237,207