• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

DMCA

Understanding Normal and Impaired Word Reading: Computational Principles in Quasi-Regular Domains (1996)

Cached

  • Download as a PDF

Download Links

  • [www.cnbc.cmu.edu]
  • [www.cnbc.cmu.edu]
  • [psych.stanford.edu]
  • [www.cnbc.cmu.edu]
  • [cnbc.cmu.edu]
  • [www-psych.stanford.edu]
  • [www.cnbc.cmu.edu]
  • [www.cnbc.cmu.edu]
  • [www.cnbc.cmu.edu]
  • [psiexp.ss.uci.edu]
  • [psychology.stanford.edu]
  • [psych.stanford.edu]
  • [www.cnbc.cmu.edu]
  • [psych.stanford.edu]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by David C. Plaut , James L. McClelland , Mark S. Seidenberg , Karalyn Patterson
Venue:PSYCHOLOGICAL REVIEW
Citations:613 - 94 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@ARTICLE{Plaut96understandingnormal,
    author = {David C. Plaut and James L. McClelland and Mark S. Seidenberg and Karalyn Patterson},
    title = {Understanding Normal and Impaired Word Reading: Computational Principles in Quasi-Regular Domains},
    journal = {PSYCHOLOGICAL REVIEW},
    year = {1996},
    volume = {103},
    pages = {56--115}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

We develop a connectionist approach to processing in quasi-regular domains, as exemplified by English word reading. A consideration of the shortcomings of a previous implementation (Seidenberg & McClelland, 1989, Psych. Rev.) in reading nonwords leads to the development of orthographic and phonological representations that capture better the relevant structure among the written and spoken forms of words. In a number of simulation experiments, networks using the new representations learn to read both regular and exception words, including low-frequency exception words, and yet are still able to read pronounceable nonwords as well as skilled readers. A mathematical analysis of the effects of word frequency and spelling-sound consistency in a related but simpler system serves to clarify the close relationship of these factors in influencing naming latencies. These insights are verified in subsequent simulations, including an attractor network that reproduces the naming latency data directly in its time to settle on a response. Further analyses of the network's ability to reproduce data on impaired reading in surface dyslexia support a view of the reading system that incorporates a graded division-of-labor between semantic and phonological processes. Such a view is consistent with the more general Seidenberg and McClelland framework and has some similarities with---but also important differences from---the standard dual-route account.

Keyphrases

quasi-regular domain    impaired word reading    computational principle    standard dual-route account    close relationship    exception word    subsequent simulation    phonological representation    word frequency    english word reading    simulation experiment    simpler system    mcclelland framework    reading system    pronounceable nonwords    previous implementation    impaired reading    phonological process    skilled reader    new representation    connectionist approach    mathematical analysis    low-frequency exception word    spelling-sound consistency    naming latency    general seidenberg    important difference    seidenberg mcclelland    relevant structure    attractor network    graded division-of-labor    surface dyslexia support    naming latency data   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University