Inflectional learning as local optimization

Inflectional learning as local optimization Formal descriptions of inflectional systems face three interrelated problems: (1) the Meaning Assignment Problem: Which morphosyntactic feature specification should be assigned to a given affix? (2) the Imperfect Distribution Problem: To what degree can the paradigmatic distribution of an affix deviate from its morphosyntactic specification? and (3) the Subsegmentation Problem: Does a given string of segments consist of one or more affixes? What makes the analysis of complex inflectional systems potentially intractable is the accumulative effect of all three problems, which results in an unwieldy amount of analytic options. Existing approaches to these problems are either incompatible with standard analyses in theoretical morphology (e.g. Harris 1955; Goldsmith 2010) or address only a subset of these problems (e.g. Pertsova 2011). In this paper, we propose a unified approach to all three problems by outlining a learning algorithm that uses optimal patterns of paradigmatic distribution of potential affixes as the main criterion for computing morpheme meaning and subsegmentation of affix strings. The central idea is that learners apply local optimization in the sense of the Harmonic Serialism version of Optimality Theory (McCarthy 2010): Every optimization step identifies the affix with the optimal distribution in a paradigm, assigning a morpheme entry to it, and ‘freezes’ the substrings corresponding to the newly learned affix in the paradigm for further learning. Different constraint rankings result naturally in affix lexica optimized for specific theoretical approaches to morphology. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Morphology Springer Journals

Inflectional learning as local optimization

Loading next page...
 
/lp/springer_journal/inflectional-learning-as-local-optimization-PyWDZchgRx
Publisher
Springer Netherlands
Copyright
Copyright © 2017 by Springer Science+Business Media B.V.
Subject
Linguistics; Linguistics, general; Comparative Linguistics; Phonology; Sign Language
ISSN
1871-5621
eISSN
1871-5656
D.O.I.
10.1007/s11525-017-9304-0
Publisher site
See Article on Publisher Site

Abstract

Formal descriptions of inflectional systems face three interrelated problems: (1) the Meaning Assignment Problem: Which morphosyntactic feature specification should be assigned to a given affix? (2) the Imperfect Distribution Problem: To what degree can the paradigmatic distribution of an affix deviate from its morphosyntactic specification? and (3) the Subsegmentation Problem: Does a given string of segments consist of one or more affixes? What makes the analysis of complex inflectional systems potentially intractable is the accumulative effect of all three problems, which results in an unwieldy amount of analytic options. Existing approaches to these problems are either incompatible with standard analyses in theoretical morphology (e.g. Harris 1955; Goldsmith 2010) or address only a subset of these problems (e.g. Pertsova 2011). In this paper, we propose a unified approach to all three problems by outlining a learning algorithm that uses optimal patterns of paradigmatic distribution of potential affixes as the main criterion for computing morpheme meaning and subsegmentation of affix strings. The central idea is that learners apply local optimization in the sense of the Harmonic Serialism version of Optimality Theory (McCarthy 2010): Every optimization step identifies the affix with the optimal distribution in a paradigm, assigning a morpheme entry to it, and ‘freezes’ the substrings corresponding to the newly learned affix in the paradigm for further learning. Different constraint rankings result naturally in affix lexica optimized for specific theoretical approaches to morphology.

Journal

MorphologySpringer Journals

Published: Jul 19, 2017

References

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create lists to
organize your research

Export lists, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off