Beta-version of R Shiny implementation of the computer-adaptive Philadelphia naming test (Roach et al., 1996) following item response theory.
GNU General Public License v3.0
0
stars
6
forks
source link
Reduce app complexity #34
Closed
rbcavanaugh closed 2 years ago
[ ] 30 item CAT, 175 full PNT, and 175 CAT PNT with option to stop whenever
[ ] for repeat admins only, can allow another 30 item CAT or a variable length where we set the credible interval based on the first app.
Get rid of other administrations to reduce complexity
keep 10 item code but comment it out.
cap the variable length at 100 items or something like that.
can we show how much additional information each item adds for the full length PNT