Skip to content

Graph-theory-based passage equating for WCPM scores

Research Method · All research methods
Evidence · 5 claims (5 for) · 1 study (1 design), q2 · 0 of 1 report an effect size · 5 claims rest on one study

Description

The report introduces a method that models passages as nodes and same-student passage pairs as edges, then uses graph theory to choose a reference passage with the most edges, adequate sample sizes, and medium difficulty, and to define the "shortest path" from each passage to the reference passage so that "the least amount of equating error" is incurred. Cross-term scales are aligned through chain passage pairs administered in earlier terms. Equipercentile equating with loglinear pre-smoothing, using the equate R package, builds the equating relationships.

Accounts

  • Graph-theory-based method for selecting reference passages and passage pairs to equate WCPM scores at scale: The report introduces a method that models passages as nodes and same-student passage pairs as edges, then uses graph theory to choose a reference passage with the most edges, adequate sample sizes, and medium difficulty, and to define the "shortest path" from each passage to the reference passage so that "the least amount of equating error" is incurred. Cross-term scales are aligned through chain passage pairs administered in earlier terms. Equipercentile equating with loglinear pre-smoothing, using the equate R package, builds the equating relationships. (Chen et al. (2020))

Claims

-

Key Sources

  • Chen, J., & Simpson, M. A. (2020). Equating words-correct-per-minute (WCPM) scores across passages of MAP Reading Fluency. Portland, OR: NWEA. https://www.nwea.org/research/publication/equating-words-correct-per-minute-wcpm-scores-across-passages-of-map-reading-fluency/
Page metadata
Field Value
type research-method
id graph-theory-based-passage-equating-for-wcpm-scores
title Graph-theory-based passage equating for WCPM scores
description The report introduces a method that models passages as nodes and same-student passage pairs as edges, then uses graph theory to choose a reference passage with the most edges, adequate sample sizes, and medium difficulty, and to define the "shortest path" from each passage to the reference passage s
status review
moved_from theory/graph-theory-passage-equating-method
generated by process:sweep-kinds on 2026-10-10
trust unverified — no one has confirmed this page's content
sources 1 — chen-2020

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