Multi-Faceted Question Complexity Estimation Targeting Topic Domain-Specificity
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 7 of its 28 references that are in the map. First posted on arXiv 23 Aug 2024.
Builds on
7 of 28 references.
References · 7
- 2022BERTopic: Neural topic modeling with a class-based TF-IDF procedurecited by 779
- 2023Knowledge Graphs: Opportunities and Challengescited by 70
- 2023Contextualized Topic Coherence Metricscited by 19
- 2016Knowledge Questions from Knowledge Graphscited by 15
- 2024Towards Personalized Evaluation of Large Language Models with An Anonymous Crowd-Sourcing Platformcited by 10
- 2023Automatic Generation of Multiple-Choice Questionscited by 2
- 2023Prompt-Engineering and Transformer-based Question Generation and Evaluationcited by 1
Built on by
Citing papers per year: 2025: 1.
1 paper.