Show Summary Details

Page of

PRINTED FROM OXFORD HANDBOOKS ONLINE (www.oxfordhandbooks.com). © 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: 28 January 2020

Abstract and Keywords

Word grammar is a theory of language which touches on almost all aspects of synchronic linguistics and unifies them all through a single very general claim. According to the Network Postulate, language is a conceptual network. This claim is hardly contentious in cognitive linguistics, where it is often taken for granted that language as a whole is a network in contrast with the more traditional view of language as a grammar plus a dictionary—a list of rules or principles and a list of lexical items. However, it is particularly central to word grammar, in which each of the main traditional areas of language is a subnetwork within the total network of language. Most obviously, “the lexicon” is a network of forms, meanings, and lexemes. This article also explores the so-called isa link, default inheritance, and prototypes, as well as the Best Fit Principle, classified relations, labels and uniqueness, lexicon and grammar, constructions, morphology, syntax, lexical semantics, compositional semantics, sociolinguistics, processing, and learning.

Keywords: Network Postulate, word grammar, cognitive linguistics, Best Fit Principle, classified relations, lexicon, morphology, syntax, semantics, sociolinguistics

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.