Multi-Faceted Question Complexity Estimation Targeting Topic Domain-Specificity

Sujay R, Suki Perumal, Yash Nagraj, Anushka Ghei, Srinivas K S
8/23/2024
cs.CLcs.LG

No confident code implementation found for this paper. 3 possible matches can be shown below.

Abstract

Question difficulty estimation remains a multifaceted challenge in educational and assessment settings. Traditional approaches often focus on surface-level linguistic features or learner comprehension levels, neglecting the intricate interplay of factors contributing to question complexity. This paper presents a novel framework for domain-specific question difficulty estimation, leveraging a suite of NLP techniques and knowledge graph analysis. We introduce four key parameters: Topic Retrieval Cost, Topic Salience, Topic Coherence, and Topic Superficiality, each capturing a distinct facet of question complexity within a given subject domain. These parameters are operationalized through topic modelling, knowledge graph analysis, and information retrieval techniques. A model trained on these features demonstrates the efficacy of our approach in predicting question difficulty. By operationalizing these parameters, our framework offers a novel approach to question complexity estimation, paving the way for more effective question generation, assessment design, and adaptive learning systems across diverse academic disciplines.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 3 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{r2024multifaceted,
  title  = {Multi-Faceted Question Complexity Estimation Targeting Topic Domain-Specificity},
  author = {Sujay R and Suki Perumal and Yash Nagraj and Anushka Ghei and Srinivas K S},
  year   = {2024},
  eprint = {2408.12850},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2408.12850v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2408.12850.svg)](https://codeofpaper.com/paper/2408.12850)

Discussion