Mining a database of reading mistakes: For what should an automated Reading Tutor listen?
Conference Paper, Proceedings of International Conference on Artificial Intelligence in Education (AIED '01), May, 2001
Abstract
Using a machine learning approach to mine a database of over 70,000 oral reading mistakes transcribed by University of Colorado researchers, we generated 225 rules based on graphophonemic context to predict the frequency of the 71 most common decoding errors in mapping graphemes to phonemes. To evaluate their generality, we tested how well they predicted the frequency of the same decoding errors for different readers on different text. We achieved .473 correlation between predicted and actual frequencies, compared to .350 correlation for context-independent versions of the same rules. These rules may help an automated reading tutor listen better to children reading aloud.
Notes
to appear
to appear
BibTeX
@conference{Fogarty-2001-8212,author = {James Fogarty and Laura Dabbish and David M. Steck and Jack Mostow},
title = {Mining a database of reading mistakes: For what should an automated Reading Tutor listen?},
booktitle = {Proceedings of International Conference on Artificial Intelligence in Education (AIED '01)},
year = {2001},
month = {May},
}
Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.