Literaturnachweis - Detailanzeige
Autor/inn/en | Roid, Gale; Haladyna, Tom |
---|---|
Titel | A Comparison of Several Multiple-Choice, Linguistic-Based Item Writing Algorithms. |
Quelle | (1978), (35 Seiten) |
Beigaben | Tabellen |
Sprache | englisch |
Dokumenttyp | gedruckt; Monographie |
Schlagwörter | Tagungsbericht; Algorithms; Cloze Procedure; Comparative Analysis; Criterion Referenced Tests; Difficulty Level; Error of Measurement; Higher Education; Item Analysis; Multiple Choice Tests; Reading Comprehension; Secondary Education; Structural Analysis; Test Construction; Test Items; Test Validity Algorithm; Algorithmus; Lückentext; Schwierigkeitsgrad; Messfehler; Hochschulbildung; Hochschulsystem; Hochschulwesen; Itemanalyse; Multiple choice examinations; Multiple-choice tests, Multiple-choice examinations; Multiple-Choice-Verfahren; Leseverstehen; Sekundarbereich; Strukturanalyse; Testaufbau; Test content; Testaufgabe; Testvalidität |
Abstract | The technology of transforming sentences from prose instruction into test questions was examined by comparing two methods of selecting sentences (keyword vs. rare singleton), two types of question words (nouns vs. adjectives), and two foil construction methods (writer's choice vs. algorithmic). Four item writers created items using each combination of the methods listed above, for a 1,000 word passage. A sample of 273 college and high school subjects were randomly assigned to pretests and posttests containing a balanced mixture of items of each type written by each item writer. Dependent measures were (1) the pattern of pretest and Posttest item difficulties; (2) the variability of item difficulties across item writers; (3) the standard error of measurement of scales composed of items of each type; and (4) the concurrent validity of these scales. No significant differences between item writers were found in the analysis of item difficulties. Keyword nouns, which are relatively rare words in American textbooks but occur very frequently in a prose passage, were found to be unacceptable as question words. Algorithmic methods of foil writing were found to be feasible. (Author/CTM) |
Erfasst von | ERIC (Education Resources Information Center), Washington, DC |
Update | 2004/1/01 |