Skip to main content

A Logical Model of Computation

  • Chapter
Computational Psycholinguistics

Part of the book series: Studies in Theoretical Psycholinguistics ((SITP,volume 20))

  • 94 Accesses

Abstract

In chapters III and IV, we have presented a model of sentence processing and its grammatical basis. We have argued generally that the human syntactic processor has a distributed, modular architecture, and more specifically that these modules are determined by representational and informational sub-domains of our syntactic knowledge. We have proposed four modules, each concerned with recovering different aspects of a coherent interpretation. Modules are responsible for recovering their own representation with respect to their current input. We have further outlined some aspects of the model’s computational behaviour: at a relatively high level, we propose that the modules operate concurrently and incrementally, with each constructing a maximal output representation for the current partial input, as input is encountered. In addition to each module satisfying the requirement of incrementality, we have also hypothesised several strategies, located primarily within the phrase structure module (since this is where the greatest amount of ambiguity occurs).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Notes

  1. Fong uses a similar organisation to the systems discussed above; i.e. an X̄ structure builder in tandem with the application of constraints. His approach is not unlike the use of ‘constraint requests’ used by (Crocker 1988), to determine what constraints ‘remained to be satisfied’/‘are relevant’ in a particular unit of structure.

    Google Scholar 

  2. For a thorough exposition see (Pereira & Shieber 1987). Note, in some cases it is possible to determine the relevant properties of a phrase structure grammar so that an inadequate strategy is not employed.

    Google Scholar 

  3. See (Stabler 1987) for a discussion relating the proof procedure assumed in (155) with an equivalent one which records the proof tree, as in (157).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Kluwer Academic Publishers

About this chapter

Cite this chapter

Crocker, M.W. (1996). A Logical Model of Computation. In: Computational Psycholinguistics. Studies in Theoretical Psycholinguistics, vol 20. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-1600-5_5

Download citation

  • DOI: https://doi.org/10.1007/978-94-009-1600-5_5

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-0-7923-3806-2

  • Online ISBN: 978-94-009-1600-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics