Velar palatalization in Russian and artificial grammar: Constraints on models of morphophonology

Author(s):  
Vsevolod Kapatsinski

AbstractRussian velar palatalization changes velars into alveopalatals before certain suffixes, including the stem extension -i and the diminutive suffixes -ok and -ek/ik. While velar palatalization always applies before the relevant suffixes in the established lexicon, it often fails with nonce loanwords before -i and -ik but not before -ok or -ek. This is shown to be predicted by the Minimal Generalization Learner (MGL), a model of rule induction and weighting developed by Albright and Hayes (Cognition 90: 119–161, 2003), by a novel version of Network Theory (Bybee, Morphology: A study of the relation between meaning and form, John Benjamins, 1985, Phonology and language use, Cambridge University Press, 2001), which uses competing unconditional product-oriented schemas weighted by type frequency and paradigm uniformity constraints, and by stochastic Optimality Theory with language-specific constraints learned using the Gradual Learning Algorithm (GLA, Boersma, Proceedings of the Institute of Phonetic Sciences of the University of Amsterdam 21: 43–58, 1997). The successful models are shown to predict that a morphophonological rule will fail if the triggering suffix comes to attach to inputs that are not eligible to undergo the rule. This prediction is confirmed in an artificial grammar learning experiment. Under either model, the choice between generalizations or output forms is shown to be stochastic, which requires retrieving known word-forms from the lexicon as wholes, rather than generating them through the grammar. Furthermore, MGL and GLA are shown to succeed only if the suffix and the stem shape are chosen simultaneously, as opposed to the suffix being chosen first and then triggering (or failing to trigger) a stem change. In addition, the GLA is shown to require output-output faithfulness to be ranked above markedness at the beginning of learning (Hayes, Phonological acquisition in Optimality Theory: the early stages, Cambridge University Press, 2004) to account for the present data.

2020 ◽  
Vol 51 (1) ◽  
pp. 97-123
Author(s):  
Giorgio Magri ◽  
Benjamin Storme

The Calibrated Error-Driven Ranking Algorithm (CEDRA; Magri 2012 ) is shown to fail on two test cases of phonologically conditioned variation from Boersma and Hayes 2001 . The failure of the CEDRA raises a serious unsolved challenge for learnability research in stochastic Optimality Theory, because the CEDRA itself was proposed to repair a learnability problem ( Pater 2008 ) encountered by the original Gradual Learning Algorithm. This result is supported by both simulation results and a detailed analysis whereby a few constraints and a few candidates at a time are recursively “peeled off” until we are left with a “core” small enough that the behavior of the learner is easy to interpret.


Mediaevistik ◽  
2020 ◽  
Vol 32 (1) ◽  
pp. 315-318
Author(s):  
Jane Beal

Matthew Cheung Salisbury, a Lecturer in Music at University and Worcester College, Oxford, and a member of the Faculty of Music at the University of Oxford, wrote this book for ARC Humanities Press’s Past Imperfect series (a series comparable to Oxford’s Very Short Introductions). Two of his recent, significant contributions to the field of medieval liturgical studies include The Secular Office in Late-Medieval England (Turnhout: Brepols, 2015) and, as editor and translator, Medieval Latin Liturgy in English Translation (Kalamazoo: Medieval Institute Publications, 2017). In keeping with the work of editors Thomas Heffernan and E. Ann Matter in The Liturgy of the Medieval Church, 2nd ed. (Kalamazoo: Medieval Institute Publications, 2005) and Richard W. Pfaff in The Liturgy of Medieval England: A History (Cambridge University Press, 2009), this most recent book provides a fascinating overview of the liturgy of the medieval church, specifically in England. Salisbury’s expertise is evident on every page.


Phonology ◽  
2020 ◽  
Vol 37 (3) ◽  
pp. 383-418
Author(s):  
Shigeto Kawahara

An experiment showed that Japanese speakers’ judgement of Pokémons’ evolution status on the basis of nonce names is affected both by mora count and by the presence of a voiced obstruent. The effects of mora count are a case of counting cumulativity, and the interaction between the two factors a case of ganging-up cumulativity. Together, the patterns result in what Hayes (2020) calls ‘wug-shaped curves’, a quantitative signature predicted by MaxEnt. I show in this paper that the experimental results can indeed be successfully modelled with MaxEnt, and also that Stochastic Optimality Theory faces an interesting set of challenges. The study was inspired by a proposal made within formal phonology, and reveals important previously understudied aspects of sound symbolism. In addition, it demonstrates how cumulativity is manifested in linguistic patterns. The work here shows that formal phonology and research on sound symbolism can be mutually beneficial.


Language ◽  
2010 ◽  
Vol 86 (3) ◽  
pp. 716-720
Author(s):  
Anne-Michelle Tessier

2021 ◽  
Author(s):  
ADRIANA W. (AGNES) BLOM-SCHIEBER ◽  
WEI GUO ◽  
EKTA SAMANI ◽  
ASHIS BANERJEE

A machine learning approach to improve the detection of tow ends for automated inspection of fiber-placed composites is presented. Automated inspection systems for automated fiber placement processes have been introduced to reduce the time it takes to inspect plies after they are laid down. The existing system uses image data from ply boundaries and a contrast-based algorithm to locate the tow ends in these images. This system fails to recognize approximately 10% of the tow ends, which are then presented to the operator for manual review, taking up precious time in the production process. An improved tow end detection algorithm based on machine learning is developed through a research project with the Boeing Advanced Research Center (BARC) at the University of Washington. This presentation shows the preprocessing, neural network and post‐processing steps implemented in the algorithm, and the results achieved with the machine learning algorithm. The machine learning algorithm resulted in a 90% reduction in the number of undetected tows compared to the existing system.


Sign in / Sign up

Export Citation Format

Share Document