 |
When I compare readability analyses run with the Spache and
Dale-Chall methods on the same text sample, the results are significantly discrepant from each other. Why? The Spache and Dale-Chal readability formulas differ
in significant ways, which explains why each returns different results when used to analyze a text sample. Here
are just two noteworthy differences between the Spache and Dale-Chall: (1) While both formulas use a word list
to determine whether a specific word in a text sample is easy or difficult, the Spache formula's
wordlist contains fewer than 1000 words--while the Dale-Chall formula employs a list of 3000 words. As a result,
the Spache will identify many more words in a sample
as 'difficult' than will the Dale-Chall. (2) The Spache formula requires that a word be counted as 'difficult'
only once, no matter how often it appears in the text
sample. In contrast, the Dale-Chall counts a word as 'difficult' each time that it
appears in a text sample. Differences in the size
of the wordlists used and in the convention followed for counting
up the total number of difficult words go a long way to explain why the two formulas
return discrepant results when used on a single text sample.
Although these formulas can appear to return conflicting results, in fact the Spache and Dale-Chall were designed
to complement each other (Spache, 1953). The Spache was constructed to be a reasonably accurate indicator of reading
difficulty for texts up through the end of third grade. The Dale-Chall was explicitly designed to estimate readability
for texts beyond the third grade level. (Read through
About Readability Formulas for a more complete discussion
of how each of the readability formulas works and for formula-selection guidelines.)
OKAPI! takes
a long time to display CBA pages or readability analyses.
OKAPI! requires a lot of computer processing power to format text samples into CBA probes and to
run readability analyses. It is not unusual for OKAPI! to take up to 90 seconds from the the time that you click
the Create CBA Probes button to have those finished probes downloaded and displayed. When Internet traffic
to the OKAPI! web site is heavy, you may find that it takes even longer for the program to process text
samples. One solution is to visit OKAPI! during times when traffic is less heavy (e.g., early mornings or
late evenings).
OKAPI! overlooks
common names of people or places when computing readability levels. Because it contains an internal dictionary of only limited length, OKAPI!
cannot identify most common names and places, even though such words should be counted as 'easy' under the Spache
or Dale-Chall guidelines. (The OKAPI! dictionary does include a list of the 200 most common male and female
first names, though, based on data collected during the 1990 U.S. Census.) You can 'fine-tune' readabiilty results
by hand, though. Consult Magic Characters and Tips to Improve the Accuracy
of Readability Calculations to find out how you can improve the accuracy of readability scores.
When I try to submit a text sample, OKAPI! returns an 'error'
message. OKAPI! is a flexible program and usually is able successfully to read and
analyze most text that you submit. However, once in a great while, a user will submit a text sample with 'strange'
individual characters or combinations of characters that OKAPI! cannot understand. When the application
cannot figure out how to analyze a non-standard text sample, it will respond with an error message. If this happens
to you:
- take a close look at the text sample that you are trying to submit;
- edit or delete any non-standard text characters or combinations of text characters that you believe might be
causing the error(s), and
- resubmit the text sample to OKAPI!.
I am having other problems in using OKAPI!
If you are having significant problems of any kind with OKAPI!, please email me, Jim
Wright, at jwright@lefthandlogic.com to share details
about the problem. I will get back to you as soon as I can with an update about possible fixes or workarounds to
the problem!
|