Jump to ContentJump to Main Navigation
Analogy in GrammarForm and Acquisition$
Users without a subscription are not able to see the full content.

James P. Blevins and Juliette Blevins

Print publication date: 2009

Print ISBN-13: 9780199547548

Published to Oxford Scholarship Online: September 2009

DOI: 10.1093/acprof:oso/9780199547548.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (www.oxfordscholarship.com). (c) Copyright 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 monograph in OSO for personal use (for details see http://www.oxfordscholarship.com/page/privacy-policy).date: 22 June 2018

Expanding Analogical Modeling into a general theory of language prediction

Expanding Analogical Modeling into a general theory of language prediction

Chapter:
8 Expanding Analogical Modeling into a general theory of language prediction
Source:
Analogy in Grammar
Author(s):

Royal Skousen

Publisher:
Oxford University Press
DOI:10.1093/acprof:oso/9780199547548.003.0008

In Analogical Modeling, language prediction is closely determined by the specific variables used. The kinds of structures that must be dealt with in a full theory of analogical prediction include strings of characters, scalar variables, syntactic trees, and semantic variables. These structures as well as a number of procedural issues are discussed in this chapter.

Keywords:   analogy, Analogical Modeling, exemplars, types of structure, specifying variables, weighting variables

Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .