Claims

Shallow complexity measures for word problems correlate only weakly with difficulty

Claim · All claims
Evidence · 1 study · associational r2 · q2
Currency · newest study 2022 · not yet checked against its sources · not reviewed by a person

Subclaims

Reading the evidence codes

q is the design tier, i the impact, n the sample, and the kind with its r the rigour judged within that kind: what each code means.

This claim: no standardized effect is recorded in observations/ for it yet, so no benchmark reading is possible.

q2 i? For a diverse set of 1000 word problems, shallow, easily computable complexity measures correlate only very weakly with difficulty; the only larger correlation is between the length of the text and the response time. → Pelánek 2022

Evidence

Pelánek 2022

Pelánek, R., Effenberger, T., & Čechák, J. (2022). Complexity and Difficulty of Items in Learning Systems. International Journal of Artificial Intelligence in Education. https://doi.org/10.1007/s40593-021-00252-4

q2 · i? · associational · r2

The article reports an analysis of "a diverse set of 1000 word problems" showing that "the shallow, easily computable comp lexity measures correlate only very weak- ly with difficulty".

"The analysis showed that the shallow, easily computable comp lexity measures correlate only very weak- ly with difficulty. The only larger correla tion is between the length of the text and the response time"

Discussion

Page metadata
Field Value
type claim
id shallow-complexity-weakly-correlate-difficulty
title Shallow complexity measures for word problems correlate only weakly with difficulty
description Shallow complexity measures for word problems correlate only weakly with difficulty
status review
evidence_strength moderate
newest_evidence 2022
generated by process:wiki-ingest on 2026-10-28
trust unverified — no one has confirmed this page's content
sources 1 — pelánek-2022

Frontmatter is the page's machine-readable record — see the Schema & Guide.