Show Summary Details

Page of

PRINTED FROM OXFORD HANDBOOKS ONLINE ( © Oxford University Press, 2018. All Rights Reserved. Under the terms of the licence agreement, an individual user may print out a PDF of a single chapter of a title in Oxford Handbooks Online for personal use (for details see Privacy Policy and Legal Notice).

date: 22 June 2021

Abstract and Keywords

The chapter provides a computer-based, algorithmic view of issues of lexical processing, ranging from the encoding of input data to the structure of output representations, going through the basic operations of word splitting, storage, access, retrieval, and assembly of intermediate representations. By illustrating the contribution of different computational frameworks (such as finite state automata, hierarchical lexica, artificial neural networks, and statistical language models) to our understanding of aspects of lexical organization, the chapter discusses the implications of theoretical models of morphology for computational models of word processing, as well as the implications of computer models for theoretical issues. In this perspective, much of current work in computational morphology does not only provide a challenging test bed for box and arrow models of lexical knowledge, but it also promises to bridge the persisting gap between theoretical frameworks and behaviourally oriented research in lexical modelling.

Keywords: word processing, word storage, computational morphology, lexical modelling, machine language learning, finite state technology, artificial neural networks

Access to the complete content on Oxford Handbooks Online requires a subscription or purchase. Public users are able to search the site and view the abstracts and keywords for each book and chapter without a subscription.

Please subscribe or login to access full text content.

If you have purchased a print title that contains an access token, please see the token for information about how to register your code.

For questions on access or troubleshooting, please check our FAQs, and if you can''t find the answer there, please contact us.