1 Introduction
This paper describes, contrasts and analyses two kinds of developmental paths in the phonological acquisition of Trevor, a child learning North American English (Compton & Streeter Reference Compton and Streeter1977, Pater Reference Pater1997b). Using longitudinal data (ages 0;10·11 to 3;1·8), we demonstrate that Trevor acquired onset consonant clusters and words with multiple consonantal places of articulation along two different trajectories: faithfulness to onset clusters developed along an S-shaped path, increasing steadily over time, while faithfulness to some combinations of multiple places of articulation showed a U-shaped pattern. We start by establishing the statistical significance of the U-shaped pattern, and then offer a computationally implemented analysis of both developmental paths that expands on the optimality-theoretic learning models in Hayes (Reference Hayes2004), Prince & Tesar (Reference Prince and Tesar2004) and Tessier (Reference Tessier2007, Reference Tessier2009). Both S-shaped and U-shaped learning will be shown to emerge from the interaction of an OT grammar, a constraint-demotion algorithm that favours ranking markedness constraints above faithfulness, a stored Cache of previously produced forms and a ‘dual route’ mechanism for producing variable outputs over the course of acquisition.
One broad issue that this paper addresses is the sources of gradual, incremental change and associated variation in child phonological acquisition. It is an uncontested fact that children's successive stages of temporarily stable phonological production are often overlapping, moving from one to the other with intermediate periods of variability. Particularly clear examples come from longitudinal studies such as Smith (Reference Smith1973), Menn (Reference Menn1976) and Fikkert (Reference Fikkert1994).
The literature on phonological acquisition, however, is in much less agreement as to the import of these intermediate periods. Many recent constraint-based learning procedures propose that variability be captured by grammatical mechanisms. In this case, a grammar may produce multiple outputs for a single input at any one stage, and the frequency with which each output occurs at a particular stage varies as a function of grammatical properties, such as the relative proximity of constraints along a number line or a more direct, grammatically assigned probability. Such works include Boersma (Reference Boersma1997, Reference Boersma1998), Boersma & Levelt (Reference Boersma, Levelt and Clark2000), Boersma & Hayes (Reference Boersma and Hayes2001), Curtin & Zuraw (Reference Curtin, Zuraw, Skarabela, Fish and Do2002), Goldwater & Johnson (Reference Goldwater, Johnson, Spenador, Eriksson and Dahl2003), Jarosz (Reference Jarosz2006), Jesney (Reference Jesney2007) and Hayes & Wilson (Reference Hayes and Wilson2008).
On the other hand, some earlier views of child phonology understand children's variability, and equally their development through successive stages of non-target phonologies, as the result of multiple representations for a given word – or perhaps entire multiple lexicons, which store both the observed adult forms and the child's current productions (see especially Menn Reference Menn and Butterworth1983 and Menn & Matthei Reference Menn, Matthei, Ferguson, Menn and Stoel-Gammon1992; for related proposals see also Ingram Reference Ingram1974 and Dinnsen & Elbert Reference Dinnsen, Elbert, Elbert, Dinnsen and Weismer1984, as well as Ferguson & Farwell Reference Ferguson and Farwell1975, Macken & Ferguson Reference Macken and Ferguson1981 and Bernhardt & Stemberger Reference Bernhardt and Stemberger1998: 43–55).Footnote 1
In a way, this paper's proposals form a hybrid of these two types of accounts.Footnote 2 At its heart is a ‘classic’ OT grammar (Prince & Smolensky Reference Prince and Smolensky1993, Tesar & Smolensky Reference Tesar and Smolensky2000, Moreton Reference Moreton and McCarthy2004), meaning that at every point in time the learning procedure entertains a single constraint ranking, which in the simplest case will always choose a single optimal output candidate. Nevertheless, our learning procedure (henceforth the learner)Footnote 3 produces gradual change, relying both on stored child-specific forms as well as online grammar use, and its incremental changes come from its multiple methods of production rather than a variable grammar. This paper therefore offers a way to learn using re-ranking algorithms that operate on classic OT grammars (Hayes Reference Hayes2004, Prince & Tesar Reference Prince and Tesar2004), and thus retain their benefits, while also capturing some dimensions of realism in natural language learning.
Before continuing, we note that there is obviously variation in target grammars too, in which multiple optimal outputs are necessary. Given the known empirical differences between the developmental variability that we study here and the variability observed in adult grammars, we take this to be a strength of our approach. We decouple the variation associated with the development of a learner's grammar from variation created by a mature adult grammar – a point we revisit in §5.
This paper also deals with larger questions about the nature of OT's constraint set, con, because it crucially assumes that some markedness constraints appear in the learners' grammar during the course of learning, while other constraints are present at the earliest production stages. While the standard hypothesis in the OT literature is that all of con is pre-made – and that languages differ solely in the ranking of constraints, not their number or content – we note that several studies on child phonology have argued that children induce some of their own markedness constraints in the learning process: see for example Pater (Reference Pater1997a), Goad (Reference Goad, Do, Domínguez and Johansen2001), Levelt & van Oostendorp (Reference Levelt, van Oostendorp, Los and van Koppen2007), Fikkert & Levelt (Reference Fikkert, Levelt, Avery, Dresher and Rice2008) and Inkelas & Rose (Reference Inkelas and Rose2008). We do not propose an explicit mechanism for how learners induce markedness constraints, for which the reader is referred to Hayes (Reference Hayes, Darnell, Moravcsik, Newmeyer, Noonan and Wheatley1999), Boersma & Pater (Reference Boersma and Pater2007), Flack (Reference Flack2007), Hayes & Wilson (Reference Hayes and Wilson2008) and Moreton (Reference Moreton2010) – what we propose here is a way to diagnose the effect of induction, if induction occurs late enough in the learning process. At Trevor's earliest stages, onset clusters are consistently simplified because *Complex.nset is present in the top stratum at the initial stage,
0; at the same time, the earliest words remain faithful to consonantal place (i.e. resisting consonant harmony) because Agree(KVT) is not yet present at
0. In this system, U-shaped development can only arise when a new markedness constraint is added to con.
The rest of this paper is organised as follows. §2 presents Trevor's complex onset simplification and consonant harmony data, and then the statistical models which support two different paths towards their respective acquisition. §3 presents our learner, which builds on Tessier's (Reference Tessier2009) Error-selective learning model, and demonstrates how this learner's dual route component continually puts the current grammar in competition with stored productions and so helps create variability of both S-shaped and U-shaped varieties. §4 shows how this learner produces both of Trevor's patterns of faithfulness, using a computational implementation. §5 discusses our results, and returns to the broad issues raised above.
2 The data
The first two subsections below present the longitudinal facts of Trevor's onset cluster simplification (§2.1) and consonant harmony (§2.2), drawn from the corpus of Compton & Streeter (Reference Compton and Streeter1977) and Pater (Reference Pater1997b). We then highlight the novelty of these results (§2.3) and present our statistical support for treating some consonant harmony patterns as significantly U-shaped (§2.4).
The Trevor corpus includes productions from ages 0;10·11 to 3;1·8, recorded on 187 different days. Thus, the corpus offers regular and representative samples of Trevor's development, but does not include every single word he said.
2.1 Faithfulness to complex onsets
English has a fairly large range of onset clusters, mostly obstruent–liquid and sC clusters. Like most children learning English, Trevor's early stages of production were consistently unfaithful to such clusters, most often by deleting all but one of the segments. This pattern is exemplified in (1). For similar patterns in other L1 child phonologies, see e.g. Smith (Reference Smith1973), Fikkert (Reference Fikkert1994), Rose (Reference Rose2000), Pater & Barlow (Reference Pater and Barlow2003) and Gnanadesikan (Reference Gnanadesikan2004).
In its intolerance to complex onsets, Trevor's early phonology resembles those of many adult target languages. For example, Egyptian Arabic repairs complex onsets by epenthesis (/t-rama/→[?it.ra.ma], *[tra.ma] ‘pass-to throw’; Kiparsky Reference Kiparsky, Féry and de Vijver2003 and references therein), while many varieties of Finnish repair complex onsets by deletion (e.g. /stressi/→[ressi] ‘stress’; Suomi et al. Reference Suomi, Toivanen and Ylitalo2008: 56).Footnote 4
(1)
Trevor's repair of choice is deletion, which occurs in 52% of all tokens and 92% of unfaithful tokens (see Table I).
Trevor's repairs for complex onsets.

Other repairs include epenthesis (e.g. /fɹɑg/→[hʌwɑg] frog), vocalisation (e.g. /sniz/→[əniz] sneeze) and metathesis (e.g. /tɹɛvəɹ/→[tɛɹvɛɹ] Trevor).
The four panels in Fig. 1 show the development of Trevor's onsets, divided by cluster type. We see essentially the same picture in all four: an initial period of uniformly simplified clusters, i.e. 0% faithfulness, slowly gives way to a period of variation, followed by an adult-like period of close to 100% faithfulness.Footnote 5 These panels all show a classic developmental path, going from an initial period of unmarked productions to a period of adult-like productions, with an intermediate period of variation. We stress that the variation is observed at every level of analysis, down to single types. For example, Trevor simplified the word play 19 times when he was 1;9·19–2;1·5. Then he pronounced five faithful tokens and 36 simplified tokens when he was 2;1·14–2;4·24. From 2;5·4 and onwards, he was recorded saying play faithfully 54 times. The point is that a gradual and variable transition from simplified complex onsets to faithful complex onsets is a necessary part of the analysis, not an artefact of lumping different clusters together, as we have done in Fig. 1.
Monotonically increasing faithfulness to targets with complex onsets. In these panels, each bubble represents the proportion of faithful tokens on a given day of recording, with the size of the bubble proportional to the number of tokens (ranging from 1 to 30); the solid lines represent the predictions of a regression model, as explained in §2.4 below.
2.2 Faithfulness to consonantal disharmony
Trevor's early phonology is again similar to many other L1 children's in that it often imposes harmony among consonantal place of articulation – for example, replacing a coronal consonant with a velar one when another velar follows, e.g. producing duck as [gʌk]. Unlike the complex onset simplification of the previous section, it has been frequently noted that long-distance consonant place harmony of this sort is never attested in adult languages (Vihman Reference Vihman, Greenberg, Ferguson and Moravcsik1978, Pater Reference Pater1997b, Hansson Reference Hansson2001, Pater & Werle Reference Pater, Werle, Féry, Green and de Vijver2001); this will be crucial to our analysis in §3.
Representative examples of Trevor's consonant harmony are given in (2), including various combinations of place features with varying dominant consonants. For some samples of consonant harmony in other child phonologies, see e.g. Smith (Reference Smith1973), Vihman (Reference Vihman, Greenberg, Ferguson and Moravcsik1978), Menn (Reference Menn and Butterworth1983), Levelt (Reference Levelt1994), Goad (Reference Goad, Hannahs and Young-Scholten1997), Rose (Reference Rose2000) and Bat-El (Reference Bat-El2010); for discussion of Trevor's consonant harmony in particular, see Pater (Reference Pater1997b) and Pater & Werle (Reference Pater, Werle, Féry, Green and de Vijver2001, Reference Pater and Werle2003).
For reasons that will become clear below, we refer to harmonic productions by the place of articulation that surfaces: thus a production of duck as [gʌk] is K-dominant, and a production of duck as [dʌtə] is T-dominant.
(2)
While our main focus in this section is on consonant harmony, we must also address other relevant patterns of unfaithfulness in Trevor's speech. Table II reports Trevor's faithful and unfaithful tokens of disharmonic inputs, by place of articulation. The category ‘other’ includes those rare examples in which the surface place appears to be unpredictable from the input (e.g. four tokens of [kʌtə] for cup, 1;2–1;3).
In Table II and below, we use the term unfaithful to describe only changes in major place of articulation; other changes are labelled faithful, including devoicing (e.g. [bɛːt] for bed, 1;10), stopping of fricatives (e.g. [giːb] for give, 2;1), spirantisation of affricates (e.g. [kiːʃin] for kitchen, 2;7) and minor place changes (e.g. [fis] for fish, 2;3). Trevor does use coda deletion, which mostly affects [p] and [t]. We know that this deletion is not driven by consonant harmony, because (a) we get deletion in words with only one stop, such as up, and (b) deletion interacts opaquely with consonant harmony, giving rise to productions such as [gʊ] book (1;5) and [dæː itə] get it (2;0). Deletion mostly affects Trevor's earliest words, such as cup and dog, which raises the possibility that his input didn't contain these final stops. Thus the unfaithful forms reported in Table II and thereafter are limited to those tokens where Trevor gives evidence that his input contained two consonants, either because he pronounced both, or because the surfacing single consonant harmonised with the other.
Trevor's treatment of disharmonic words.

We note that Trevor's unfaithfulness to velar place of articulation as in [dæː itə] for get it (2;0), driven by harmony, contrasts with that of some children who replace velar consonants with coronal ones regardless of featural context (velar fronting; e.g. Chiat Reference Chiat1983, Inkelas & Rose Reference Inkelas and Rose2008). Trevor is generally faithful to initial velars, as seen in words like cow, cows, go and goes. Even in the one word that seems to display fronting ([ki]→[ti] key), we see T-dominant productions significantly more often in the presence of the coronal plural suffix: only two out of 34 tokens of [ki] front to [ti], while six out of 18 tokens of [kiz] front to [tiz] (Fisher's exact test; p<0·05).
Our central claim in this section is that Trevor's treatment of some potentially harmonic words – in particular, KVT inputs – does not follow an S-shaped path towards faithfulness. Instead, KVT words show a U-shaped trajectory: first highly faithful, then decreasingly so and then eventually increasingly faithful until target-like. This U-shaped progression in accuracy has been noted in numerous areas of linguistic development, perhaps most often in morphophonological development, but in many other places as well; see e.g. Leopold (Reference Leopold1939, Reference Leopold1947), MacWhinney (Reference MacWhinney1978), Bowerman (Reference Bowerman and Strauss1982), Bernhardt & Stemberger (Reference Bernhardt and Stemberger1998), Clahsen (Reference Clahsen1999) and other references below. We start here by characterising the trajectory of consonant harmony in Trevor's lexicon as a whole, and then hone in on KVT words in particular.
The claim that Trevor applies different harmonies rather differently across time is illustrated by Fig. 2. The three panels on the left show a familiar S-shape for faithfulness to TVK, PVK and PVT words, beginning with a period of uniformly unfaithful productions (~1;0–1;4 for TVK, ~1;0–1;7 for PVK and ~1;1–1;4 for PVT) and then gradually moving towards largely faithful productions.
Development of resistance to consonant harmony by place of articulation.
In contrast, the three panels on the right for KVT, KVP and TVP words show no sign of an S-shape; instead, these words appear relatively faithful throughout. In fact, the KVP and TVP panels hardly show any unfaithful productions at all (9 and 24 unfaithful tokens, i.e. 2% and 5% of the tokens on those panels respectively). We therefore set them aside.
As compared to the three S-shaped panels and the two consistently faithful panels, it is the KVT panel which is of most interest here. These targets follow two different trajectories: after an initial period of largely faithful productions from ~1;0–1;5 (27 faithful tokens vs. 5 unfaithful ones), there is a long period of decline in faithfulness, and a rise into adult-like speech. Following the standard practice in the literature, we use the term U-shaped development for this down-and-up change.
We take a closer look at the KVT panel in Fig. 3, where it is shown with its mirror image, the TVK panel. The U-shape is now seen to have further internal structure: KVT's initial faithful period gives way to a period of K-dominant harmony (e.g. /kis/→[kik] kiss, /kiɾi/→[kiki] kitty), which gradually transitions into a period of T-dominant harmony (e.g. /kis/→[tis], /kiɾi/→[tidi]). The faithful productions return at ~2;7.
Direction of consonant harmony in KVT and TVK words. In these panels, each K or T represents harmonic tokens in a day of Trevor's productions, with the size of the letter proportional to the number of harmonic tokens recorded.
Interestingly, the TVK panel shows the same transition from K-dominance to T-dominance, and at around the same time – circa 1;8 in both panels. The central difference between the two panels is that K-dominant harmonic outputs are strongly attested in the TVK panel from the very beginning, whereas there are very few harmonic tokens in the beginning of the KVT panel. We also note that the K-dominant period persists into the T-dominant period in the TVK panel, whereas the two periods show more separation in the KVT panel.
2.3 The U-shape in phonological development
This paper is the first, to our knowledge, to substantiate claims about phonological U-shaped development quantitatively. While there are numerous reports about U-shaped development (see e.g. Bernhardt & Stemberger Reference Bernhardt and Stemberger1998: 263–268 and references therein), most have not been able to draw on sufficiently rich longitudinal records or a sufficiently wide lexicon to allow a statistical analysis. In fact, most phonological U-shapes discussed in the literature document the development of an exceptional set of words, rather than an entire phonological process itself. For example, Leopold (Reference Leopold1939, Reference Leopold1947) reports the famous trajectory of the word pretty in the speech of H, with approximately correct productions at roughly 0;10–1;9, and then decrease in faithfulness to [piti] and later [biɾi]. Leopold noted that nine other words followed a similar trajectory during the first two years of H's speech, but this study was not designed to determine what proportion of H's outputs these nine or ten words represented, compared either to the entire lexicon or the relevant subsets. Similar examples of lexically restricted U-shapes are found in Moskowitz (Reference Moskowitz, Hintikka, Moravcsik and Suppes1973), Macken & Ferguson (Reference Macken and Ferguson1981), Menn (Reference Menn and Butterworth1983) and Bleile & Tomblim (Reference Bleile and Tomblim1991).Footnote 6 Cases of phonological U-shapes that are not necessarily lexically restricted, and which show considerable variation and multiple regressions, are also reported in Stemberger & Bernhardt (Reference Stemberger and Bernhardt2001), Stemberger et al. (Reference Stemberger, Bernhardt and Johnson2001) and Ullrich et al. (Reference Ullrich, Stemberger and Bernhardt2008). We also note that in the context of morphophonological development, much work has reported U-shaped patterns in the application of regular vs. irregular morphology (e.g. feet→foots→feet), including longitudinal corpus studies (see e.g. Marcus et al. Reference Marcus, Pinker, Ullman, Hollander, Rosen and Xu1992, Maratsos Reference Maratsos2000); see also the interesting U-shaped morphophonology reported in Kazazis (Reference Kazazis1969).
2.4 Statistical analysis
Figures 1–3 above showed developmental trajectories using smooth continuous lines that were drawn through rather noisy data. In this section, we explain and justify the statistical analysis that generated these smooth lines. Specifically, we set out to demonstrate two main technical points, given in (3).
(3)
We start with a logistic regression analysis, using the glm() function in R (R Development Core Team 2007).Footnote 7 In all of our models, the dependent variable is a binary factor: faithful or unfaithful production. The predictor is Trevor's age in days. A base model that only contains this predictor is limited to describing a linear correlation between age and faithfulness: faithfulness can go up with age (as is observed in the TVK panel, for example), or, in principle, faithfulness could go down with age, describing a child who starts well but then becomes less adult-like in their speech.Footnote 8
Crucially, the base linear model is unable to describe faithfulness that goes down with age and then up again, or vice versa. To allow down-and-up development, we add a change point (or break point), which allows faithfulness to change its trajectory at one point in time (see e.g. Jaynes Reference Jaynes2003: §15.8.1, Baayen Reference Baayen2008: §6.4, Mudelsee Reference Mudelsee2010: §4.2.2). The location of this change point is determined by considering each value on the x-axis (representing a day in Trevor's corpus) as a potential change point, and choosing that point which most closely fits the data (as measured by ANOVA model comparison). Adding a change point is one of several different approaches to non-linearity in statistics, and has the advantage of being a simple one. Other approaches include the use of restrictive cubic splines, and polynomials; for a Bayesian approach to a similar problem, see Steyvers & Brown (Reference Steyvers, Brown, Weiss, Scholkopf and Platt2006). The effect of the added change point is shown in Fig. 4, where the TVK and KVT panels are repeated from Fig. 2. The dashed lines show the predictions of the base linear models, while the solid lines show the predictions of the models that are augmented with change points. In the TVK panel, both models follow a trajectory of increasing faithfulness, and offer qualitatively similar descriptions. In the KVT panel, the base model is limited to showing gradual increase in faithfulness, and thus offers a poor fit to the data; the change-point model describes the observed trend more closely.Footnote 9
Base linear model (dashed) vs. linear model with change point (solid).
The same pattern holds when the KVT productions are separated according to the place of articulation of the output. Figure 5 shows only tokens of KVT words that were produced either faithfully or with K-dominant harmony. Again, the change-point model (solid line) fits the data much better than the strictly linear model (dashed line).
K-dominant harmony for KVT targets: base linear model (dashed) vs. linear model with change point (solid).
The change-point models provide a significantly better fit to the data than the strictly linear ones, as shown in an ANOVA model comparison.Footnote 10 In the two models shown in Fig. 5, the improvement is highly significant (χ2(1)=38·54, p<0·0001). AIC (Akaike's Information Criterion, another method of model comparison) is similarly improved from 137·26 to 100·72.
The presentation so far relies solely on tokens, yet there is every reason to believe that types should also be considered by the model. Trevor's words differ widely in their token frequency and their faithfulness, and the overall pattern that we attribute to the grammar is generalised from the behaviour of these individual words. To inform the statistical model about the classification of tokens into types, we switch from classical regressions to hierarchical regressions (also known as mixed-effects regressions), which we model using the lmer() function of the lme4 package (Bates & Maechler Reference Bates and Maechler2009) in R. By using hierarchical regressions, we can group together all tokens according to their types, and the model can estimate levels of faithfulness taking types into account.
Figure 6 illustrates the same progression of K-dominant harmony as in Fig. 5, but this time shows the separation of types in its predictions: some types are predicted to have a very low dip in faithfulness, others much less so. The average prediction, i.e. a prediction for a new word if Trevor had an additional one, is shown with the solid line. While the predicted dip in faithfulness is not dramatic (83% faithfulness at 1;6·29), the improvement of the change-point model over the base linear model is nevertheless highly significant (ANOVA model comparison; χ2(1)=25·26, p<0·0001). AIC is improved from 131·79 to 108·54; BIC (Bayesian Information Criterion) is improved from 146·34 to 127·94.
Hierarchical model predictions for K-dominant harmony for KVT targets. The solid line indicates the average prediction for novel words.
Similar results obtain when we examine the trajectory of T-dominant harmony, as shown in Fig. 7. The solid line again shows the prediction for an average type, or a new word, if Trevor had one. The dip in faithfulness is not very pronounced (90% faithfulness at 2;2·7), but again the improvement of the change-point model over the base linear model is highly significant (ANOVA model comparison; χ2(1)=91·45, p<0·0001). AIC is improved from 406·95 to 317·49, and BIC from 421·66 to 337·11.
Hierarchical model predictions for T-dominant harmony for KVT targets. The solid line indicates the average prediction for novel words.
Pater & Werle (Reference Pater, Werle, Féry, Green and de Vijver2001) report that Trevor is more likely to harmonise dorsal and coronal consonants across a back vowel than across a front vowel, and that in general harmony is as or more likely when crossing a homorganic vowel. (For similar patterns see also Levelt Reference Levelt1994 on Dutch, and Stoel-Gammon Reference Stoel-Gammon, Bernhardt, Gilbert and Ingram1996 on a different English example.) Our statistical evaluation of Trevor's corpus indeed reveals a front/back connection between harmonising consonants and vowels: T-dominant harmony is significantly more likely with an intervening front vowel, and K-dominant harmony is significantly more likely with an intervening back vowel. Since these vowel effects offer only modest improvements to the models (T-dominant: χ2(1)=6·3, p<0·05; K-dominant: χ2(1)=4·51, p<0·05) we leave aside vowel quality for the remainder of this study, but see Pater & Werle's (Reference Pater, Werle, Féry, Green and de Vijver2001) treatment of vowel influences in Trevor's harmony (cf. also Fikkert & Levelt Reference Fikkert, Levelt, Avery, Dresher and Rice2008).
3 An analysis of gradual, variable learning
The goal of our analysis is to equip a learner whose constraint ranking is inherently categorical with the mechanisms to learn gradually and variably over time. The class of grammars being learned here are ordinal (‘classic’) OT rankings, i.e. where every constraint is ranked above or below every other, rather than stochastically (cf. Boersma Reference Boersma1997, Boersma & Hayes Reference Boersma and Hayes2001) and where winners are determined via strict domination (Prince & Smolensky Reference Prince and Smolensky1993) rather than a harmony score (cf. Smolensky & Legendre Reference Smolensky and Legendre2006). We start with a very brief introduction to constraint-demotion algorithms, and present our basic view of how the learner uses them in §3.1. We apply our learner to a simple case of S-shaped development using Trevor's complex onsets in §3.2. Then, we show how the introduction of a new markedness constraint causes U-shaped development by analysing Trevor's KVT words in §3.3. Finally, for a fuller analysis of Trevor's consonant harmony we integrate the S-shaped development of TVK words, in §3.4.
Our approach begins with the algorithms for ordinal OT learning proposed by Hayes (Reference Hayes2004) and Prince & Tesar (Reference Prince and Tesar2004), which both aim to ensure that learners map from stored errors to new grammars as restrictively as possible – that is, by building rankings that can faithfully reproduce the surface forms they observe, but otherwise produce as few unheard surface forms as possible. When building new grammars from sets of errors, the learner proceeds by ‘resolving’ errors – that is, by installing constraints in an order that ensures the next grammar will prefer the target observed form (the ‘winner’) to the error created by the last grammar (the ‘loser’).
At the earliest stage, the ranking algorithm places all markedness constraints above all faithfulness constraints, as in the grammar fragment in (4).
(4)
This initial ranking can make an error like (5), where /fɹɑg/ comes out as [fɑg].
(5)
The error format in (5) compares the winner and loser forms on the merits of each constraint (Prince Reference Prince, Carpenter, Coetzee and de Lacy2002), assigning an L to *Complex.nset, which prefers the loser's singleton onset, while assigning a W to Max, which prefers the winner's preservation of the cluster. From this error, the learner can build the improved ranking in (6), which no longer simplifies complex onsets (because Max ranks above *Complex.nset), but otherwise retains its ban on other marked structure (because in the absence of positive evidence, other markedness constraints like *Complex.oda remain above Max).
(6)
The move from error (5) to new ranking (6) is done by a ranking algorithm, which for our current purposes could either be Biased Constraint Demotion (BCD; Prince & Tesar Reference Prince and Tesar2004) or Low-Faithfulness Constraint Demotion (Hayes Reference Hayes2004), or some amalgam of the two (see also Tessier Reference Tessier2007 and other references therein). As already stated, these algorithms are designed to keep all markedness constraints above faithfulness constraints to the extent possible given the observed data. In what follows, we gloss over the details of how these algorithms impose the persistent M≫F bias, but the works cited above all provide such detail.
Our use of error-driven learning to understand how humans (rather than just simulated learners) acquire their phonology requires access to these errors, at one cognitive level or another. As encoded in (5), the algorithm needs to know the phonological content in both the observed winner form and the current grammar's loser form, as well as the violation profiles of each, which in turn derives its Ws and Ls. We do not believe, however, that the learning algorithm implies any child's conscious awareness of the difference between [fɹɑg] and [fɑg]: in other words, the learning procedure must know this much about errors, but, as in many other linguistic domains, this knowledge may be completely unconscious. The evidence in the acquisition literature on this matter is mixed. Some work provides explicit evidence that children can acknowledge their pronunciations as non-adult-like (e.g. Smith Reference Smith2010: §7.3), which suggests they are at least aware of a difference between winners and losers in our technical sense, whereas other children show clear resistance to such a distinction (e.g. the famous discussion of fish vs. fiss in Berko & Brown Reference Berko, Brown and Mussen1960). In the rest of this paper, we continue to use the learner to describe a learning procedure to approximate the relevant behaviour of a particular child, Trevor, but we do not claim to know anything about whether Trevor knew what this learner was doing as he learned. We leave these very interesting questions as open ones for future research.Footnote 11
To capture the data from §2, a BCD learner must be augmented with two additional properties. First, it must progress slowly and incrementally from one stage to the next, based on small re-rankings: when exposed to e.g. frog, toast and string, it must not immediately acquire the variety of complex onsets and codas exemplified in those three words. Second, its individual stages must allow for the production of multiple outputs for the same input, mimicking the curves graphed in §2 – recalling our broad goal of producing this variation not in the grammar but in the learning mechanism, or rather in the way the learner uses the grammar. Our proposal to meet both of these goals is a version of Error-selective learning (ESL; Tessier Reference Tessier2007, Reference Tessier2009) which uses an intermediate buffer called the Cache. The Cache creates incremental learning by restricting the speed and scope of the errors that are allowed to trigger the re-ranking algorithm. Below, we demonstrate how an Error-selective learner that uses its stored errors for grammar building can also change its outputs gradually, even when the grammars change categorically between
n and
n+1.
3.1 How Error-selective learning works
Every time the Error-selective learner produces a new form with the current grammar (regardless of whether the form is target-appropriate or an error), the new form is stored in the Cache. Errors pile up until learning is triggered, which happens when some markedness constraint has assigned Ls to some predetermined number of different cached forms.
(7)
If, in this sample Cache in (7), the predetermined threshold is set at 3, then the Cache will trigger learning via *Complex.nset. Once triggered, the learner examines its Cache and selects an error (or small set of errors) to learn from. For this paper's purposes, this selection mechanism must simply choose an error that violates *Complex.nset and as few other markedness constraints as possible. See Tessier (Reference Tessier2009) for a more complete proposal about choosing errors to learn from.
Once chosen, this error or set of errors is added to the Support, which is the permanent repository of learning data.
(8)
The newly updated Support in turn triggers the re-ranking algorithm to create a new ranking that will not make this particular error again.
An anonymous reviewer rightly wonders about the similarities and possible overlap between the Cache and Support on the one hand and the learner's lexicon on the other. We note that these stored errors do contain substantial amounts of lexical information, but neither can take over the lexicon's job. On the one hand, while the Cache will contain every surface form attempted by the learner, these errors must decay over time. On the other hand, while the Support's errors are permanently stored at least until learning is complete, they will only include a fraction of encountered words (e.g. it cannot include any lexical item which never prompted an error).
Returning to the example in (8): whatever the precise re-ranking effect, the Support is now slightly larger and the resulting grammar slightly more target-like – and with this new grammar
n+1, the learner begins to make new errors. At the same time as the Cache stores these novel forms, all of its stored forms made with the previous grammar
n begin to decay. Each of these stored forms is associated with a relative probability, and these probabilities decrease as a function of how many grammars ago each was produced (one may think of these probabilities as quantifying the strength or weight of each error). We propose that all forms enter the Cache at probability 1, and every time the learner produces an output it depresses the probabilities of all cached forms made with previous grammars by a consistent proportion. Note crucially that only old errors decay: errors made with the current grammar remain at probability (or weight) 1 until the next ranking is adopted.Footnote 12 As time passes, the probability of a cached form will be reduced to next to nothing, and it will be effectively forgotten. These properties of the Cache will be the key to our explanation of variability across stages.Footnote 13
3.2 Gradual increase in faithfulness with ESL
Trevor's trajectory of faithfulness to obstruent–sonorant onset clusters was characterised in §2.1 as falling into three ‘stages’: (a) an unfaithful stage, in which complex onsets are nearly completely banned, usually repaired by deletion, (b) a variably increasing stage, across which faithful productions gradually appear, and (c) a faithful stage, at which (eventually) licit English complex onsets became uniformly preserved.
The unfaithful stage is a result of
0, which is determined by the M≫F bias of the ranking algorithm. Before any relevant errors have made it into the Support, this bias ranks *Complex.nset≫Max, meaning that all complex onsets are simplified, and errors like /fɹɑg/→[fɑg] begin to pile up in the Cache. As soon as an error like (5) has been added to the Support, the BCD algorithm will immediately build a grammar that produces complex onsets faithfully, as was shown in (4)–(6). Thus the question is how the variably increasing stage comes about in the interim.
We dub our approach Dual Route ESL, because it derives the variably increasing stage from the two ‘routes’ available to a learner for producing known words: run them through the current grammar to choose an output, or simply use a previously stored production from the Cache. At
0, the errors in the Cache all reflect the output of the unfaithful grammar, so both routes produce identical results. When
1 has been adopted, however, the Cache and the grammar are in conflict: the grammar protects complex onsets, but the majority of cached forms with complex onsets are previously made errors with clusters reduced. As time passes, however, these errors will decay, and the grammar's faithful protection of onsets will win out.
A time slice in this process is illustrated in (9) below. Suppose at a time shortly after the adoption of
1, the learner attempts saying frog. If /fɹɑg/ has never previously been attempted, it will not be cached in any way, so it will necessarily be parsed with
1, i.e. faithfully. If it does have a cached form, however, it will be an error created by
0, i.e. reduced to [fɑg].
(9)
If, for example, /fɹɑg/ has an entry in the Cache with p([fɑg])=0·6, then there is a 60% chance that this form will be recycled from the Cache and produced with a simplified cluster, and hence a 40% chance that its input will be run through the current grammar and produced with a faithful [fɹ] cluster.
This snapshot reflects a moment during the variably increasing stage, where the grammar has reached the competence of the faithful stage, but the stored echoes of the unfaithful stage remain influential. As this example illustrates, the role of the Cache in production is to provide alternatives to the grammar – shortcuts, perhaps, to avoid using the grammar's latest machinery every time a word is attempted. With this in mind, we assume that those forms (errors or not) that are cached by the current grammar are not included in the calculation done in (9) above. Competition is therefore between decaying errors from previous grammars (those with probabilities of less than one) and the grammar's current choice of optimal outputs. Since the weights of old errors decay every time an input is attempted, the likelihood over time that a word will be produced via the cached form route decreases, and so more often the current grammar's faithfulness will win out. Thus, the variably increasing stage eventually develops into the faithful stage, where cached forms with reduced onset clusters have faded into negligibility and no longer interfere with the grammar's target ranking.
The Cache's sensitivity to individual words means that if a word has never been previously attempted, it will be produced with the current grammar. As two anonymous reviewers note, this prediction differs from that of a model in which variation is due to multiple stored grammars: the latter view does not distinguish between new and existing words. Trevor's corpus does not allow us to test our prediction, because we cannot assume that the first appearance of a word in our corpus represents Trevor's first use of it.
Before moving on, a somewhat technical point should be spelled out as to calculating the probability of using any cached error. Suppose that before the unfaithful stage of complex onsets illustrated above, the learner had an even earlier grammar which deleted coda consonants as well, meaning that frog was optimally produced as [fɑ] and cached as such. This error might still remain in the Cache at the time when the Max≫*Complex.nset grammar is adopted to begin our variably increasing stage, as in (10) below. Since [fɑ] is an older error it will have been decaying longer than the [fɑg], so its probability will be considerably lower (say, p([fɑ])=0·3).
(10)
A Cache like (10) gives the learner two older alternatives for uttering frog, with associated probabilities that are determined by their recency. The remaining probability mass is given over to the current grammar, and since the most recent error on frog is at 0·6, we give the grammar the remaining 40% shot at producing it. We do so by distributing the Cache's 60% chance among multiple cached errors for frog according to their weights; in this case, [fɑg] has twice the probability of [fɑ] (0·6 vs. 0·3), so [fɑg] gets two-thirds of the Cache's 60% chance.
The upshot of Dual Route ESL is that changing the grammar will only gradually influence production, but over time the likelihood of using the current grammar steadily increases. Eventually, the next learning cycle is triggered, the grammar shifts to something slightly more target-like and a gradual S-shaped progression towards faithfulness continues.
3.3 U-shaped development with ESL
The Dual Route Error-selective learner, as we have presented it, can account for increasingly faithful development along a particular dimension, but it has no way for productions to become increasingly unfaithful. Recall, however, that our stage-based description of Trevor's development along the KVT consonant harmony dimension consists of: (a) a variably decreasing stage, at which harmony is initially resisted but then increases in frequency, (b) a variably increasing stage, at which harmony decreases, and then (c) a faithful stage, at which harmony is no longer found. Recall also that for Trevor, KVT's harmony in fact occurs in two parts: first the process of K-dominant harmony emerges, whereby kiss is produced as [kik], and then it is replaced by T-dominant harmony, which creates [tis].
It may not be an accident that this special U-shape describes this pattern's development, since child consonant harmony is already special in a typological sense. Trevor's velar harmony assimilates Major Place features (Labial vs. Coronal vs. Dorsal) at a distance, across all vowels and some other consonants. While this is typical of child harmony in several languages, this kind of harmony is not attested in natural adult languages (Vihman Reference Vihman, Greenberg, Ferguson and Moravcsik1978, Pater Reference Pater1997b, Hansson Reference Hansson2001, Pater & Werle Reference Pater, Werle, Féry, Green and de Vijver2001). U-shaped development has also been discussed in the context of other child-specific harmonies (Kiparsky & Menn Reference Kiparsky, Menn and Macnamara1977, Menn Reference Menn and Butterworth1983; see also Fikkert & Levelt Reference Fikkert, Levelt, Avery, Dresher and Rice2008), velar fronting (Bleile & Tomblim Reference Bleile and Tomblim1991, Inkelas & Rose Reference Inkelas and Rose2008) and other processes (Moskowitz Reference Moskowitz1970, Ferguson & Farwell Reference Ferguson and Farwell1975, Bernhardt & Stemberger Reference Bernhardt and Stemberger1998).
Our proposal for how child-specific processes are special is that they represent the effects of constraints induced by the learner, in response to the child's own productions and increased articulatory demands; see especially Inkelas & Rose's (Reference Inkelas and Rose2008) view of child-specific velar fronting; see also Goad (Reference Goad, Do, Domínguez and Johansen2001), Levelt & van Oostendorp (Reference Levelt, van Oostendorp, Los and van Koppen2007) and Fikkert & Levelt (Reference Fikkert, Levelt, Avery, Dresher and Rice2008). We are thus claiming that Trevor was driven by concerns of some articulatory nature to induce the constraint Agree(KVT) somewhere around 1;5. As for the formal mechanisms the learner might have used, see Hayes (Reference Hayes, Darnell, Moravcsik, Newmeyer, Noonan and Wheatley1999), Boersma & Pater (Reference Boersma and Pater2007), Flack (Reference Flack2007), Hayes & Wilson (Reference Hayes and Wilson2008) and Moreton (Reference Moreton2010).
The questions of why this particular constraint was induced, and why at this moment, are ripe for speculation, but we are not sure that the nature of our data is sufficient to address them. While many children acquiring English adopt some consonant-harmony pattern similar to Trevor's, it is by no means a given that they follow this trajectory – some show velar harmony earlier than other patterns rather than later, some show more labial harmony and so on (see for example the differing patterns reported in Pater Reference Pater1997a from Compton & Streeter Reference Compton and Streeter1977). Thus we suspect that the origins of Agree(KVT) and its chronology will have to lie with something truly child-specific – e.g. the statistics of Trevor's own unique lexical input, or the raw frequency with which he attempted particular sequences of coronal and dorsal consonants in the weeks preceding the constraint's induction, the numerical subtleties of which this corpus cannot fully document. Given that at this age a child's productive lexicon is still rather small, it seems possible that the order in which Trevor and other children induce one or more Agree constraints might come from individual idiosyncrasies, rather than any broader facts about English child-directed speech. We hope that future research will shed more light on this issue.
Regardless of its provenance, our account built from Trevor's observed data is that this constraint that drives consonant harmony is not present in the grammar at the beginning of the variably decreasing stage: at
0, shown in (11), there is no markedness pressure for [kis] to become [kik].
(11)
The learner generates faithful, disharmonic forms, and stores them in the Cache, as in (12). These faithfulness constraints are essentially the ones used by Pater & Werle (Reference Pater and Werle2003) in their analysis of Trevor's consonant harmony.
(12)
After a period of using the grammar and caching disharmonic forms, the learner decides that multiple consonantal places of articulation per word are too taxing or otherwise intolerable, and so induces harmony constraints. For the KVT inputs under discussion here, we will call the induced harmony constraint Agree(KVT), defined as in (13).Footnote 14
(13)
How does the learner know how to rank their newly induced constraint? We propose that adding a constraint to con triggers a new application of the re-ranking algorithm using the existing Support. Since Agree(KVT) has yet to be used by the grammar, there are no cached errors in which it has demonstrated its error-making capabilities, so the M≫F bias will ensure it is ranked at the top, with any other undominated markedness constraints.
(14)
The resulting
1 grammar will now drive harmony and start adding errors to the Cache.
(15)
We note that it is the initial K-dominance of the TVK words that prompts us to rank Max[dors] over Max[cor] here. With this grammar update, the learner has entered the variably decreasing stage in earnest. At first, old errors have not yet decayed very much, so most of the time the cached route is chosen and harmony hardly ever applies. With increasing decay of cached forms, however, the grammar is increasingly used for production, causing errors like (15) to enter the Cache. As described in the previous section, these multiple forms are now in competition: the old, adult-like [kis], whose probability is decaying as time passes, and the new, harmonic [kik], which the grammar will consistently produce on the increasingly frequent occasions when it is asked to.
An anonymous reviewer notes that at this variably decreasing stage, cached forms are more adult-like than the form produced by the grammar; one might wonder why the child would ever prefer them. In our system, recycling errors from the Cache saves the learner from using the grammar, and we conjecture that the ‘cost’ of retrieving a word from the Cache is the same regardless of the form's complexity. Thus an error may be retrieved and produced even if it violates a new and highly ranked markedness constraint.
Once the Cache has filled with harmonic forms, meaning enough errors with Ls assigned by Agree(KVT) have accumulated in the Cache, they will trigger learning. An error like /kis/→[kik] as in (15) above will be added to the Support.
(16)
The resulting new grammar will rank Agree(KVT) below Max[cor] but not below Max[dors], so that T-dominant harmony will now be chosen as optimal.
(17)
(18)
As the K-dominant harmonic forms in the Cache decay, new T-dominant harmonic forms will be added. Once enough of these new errors accumulate, learning is again triggered and the Support contains an error that prompts fully faithful [kis].
(19)
(20)
Once this grammar is adopted, the learner is now in its last variably increasing stage. Only the decaying cached errors prefer harmony, while the grammar has achieved adult-like competence, and thus faithfulness will increase steadily until harmonic forms disappear for good.
This section has augmented Dual Route ESL with a mechanism for producing regressions. However, an anonymous reviewer raises an important point: when an adult form violates multiple markedness constraints, demotion of one of them may cause what could be considered an increase in unfaithfulness; such cases do not require constraint induction, and are easily created by the basic Error-selective learner presented in §3.2. For instance, the adult cluster [fr] may first be simplified to [f], with a faithful fricative; subsequent demotion of *Complex.nset may cause the cluster to surface as [pr], with a stopped [p], as a result of a sonority-sequencing pressure. In other words, the learner may become less faithful in some ways, while becoming more faithful in others. Such examples are noted in Bernhardt & Stemberger (Reference Bernhardt and Stemberger1998), Stemberger & Bernhardt (Reference Stemberger and Bernhardt2001), Stemberger et al. (Reference Stemberger, Bernhardt and Johnson2001) and references therein. From our perspective, we stress that such cases do not require any active calculation by the learner of trade-offs between conflicting markedness or faithfulness, but rather fall out naturally from the workings of OT constraint conflict and the re-ranking algorithm.
3.4 KVT vs. TVK: simultaneous U-shapes and S-shapes
Our treatment of Trevor's consonant harmony in §2.2 focused on KVT harmony, because the trajectory of this class of words significantly differed from an S-shape. Now that we have seen how this learner can produce a U-shape in faithfulness, we return to the comparison between KVT and TVK words made at the end of §2.2. What does our analysis of the U-shape predict for TVK words in the same system?
Since our view has been that each class of harmony targets (such as KVT words or TVK words) are targeted by a separate Agree constraint, our account of the difference between U-shape and S-shape is rather straightforward. KVT words follow a U-shape, because Trevor had not yet added Agree(KVT) to con at the onset of his recorded speech. TVK words do not show an initial resistance to harmony, therefore Trevor must have added Agree(TVK) to con before the recorded period. Since the content of the markedness constraints involved is rather narrowly stated, we cannot claim broader applicability beyond these specific consonant combinations, yet the outline of the analysis is generally applicable to any case of U-shaped development. We hope that future research will offer more insight as to the substantive content of these constraints.
That said, our constraint set does indeed make predictions about Trevor's development across stages, because the same faithfulness constraints, Max[cor] and Max[dors], interact with both Agree constraints. Recall from the two panels compared in Fig. 3 that for both KVT and TVK words, the switch from K-dominant to T-dominant harmony occurred roughly around 1;8. We illustrate now that this fact accords nicely with the constraint set we have used.
We start by noting that the initial grammar should now also include Agree(TVK); this full
0 given in (21) produces the observed K-dominant harmony. Recall that it is the initial K-dominance of the TVK words that prompts us to rank Max[dors] over Max[cor] here.
(21)
When Agree(KVT) is later added to the grammar, the full grammar has both markedness constraints at the top.
(22)
The Cache in (23) shows two representative errors made by this K-dominant
1, which we see taking over Trevor's productions around 1;6.
(23)
If either of these errors is added to the Support on some learning cycle, the constraint-demotion algorithm will determine that Max[cor] must be ranked above one of the two Agree constraints – either KVT or TVK, depending on which error is selected. If the error [kik] from (23) is chosen, Agree(TVK) will remain undominated (as it is not violated by any version of kiss), and beneath it will be ranked Max[cor]. Since this ranking resolves the error [kik] in (23), the demotion algorithm is now free to install the remaining constraints according to its general M≫F bias, so that the new grammar will be as in (24).
(24)
What is of interest here is that this new grammar will now produce T-dominant harmony for both classes of words. This is shown in (25).
(25)
This grammar is thus the one that emerges around 1;8. From this point on, T-dominant harmony will eventually generate more errors to learn from, leading both Agree constraints to be dominated by faithfulness, as in (26).Footnote 15
(26)
To summarise, we have shown an ESL-based OT analysis of Trevor's acquisition path, leading from initially faithful KVT forms and K-dominant TVK forms into K-dominance throughout, followed by T-dominance throughout, and finally faithfulness. The U-shaped acquisition of the KVT forms was caused by the introduction of Agree(KVT) into the grammar, after an initial period with no markedness pressure to harmonise KVT words.
4 Simulation
Our analysis of Trevor's phonological development relies on two main theoretical tools: (a) the Cache, which stores previously uttered words, and creates smooth transitions in the child's production where there are discrete changes in the child's grammar, and (b) constraint induction, which introduces a markedness constraint into the grammar, and thus causes faithfulness to drop temporarily.
In this section, we offer a computational implementation of our analysis that takes Trevor's targets, and mimics his productions of these targets over time. The implementation demonstrates that our theory is sufficiently detailed to be executed by a computer; at the same time, subtle mismatches between Trevor's and the computer's behaviour underline the complexity of the patterns involved and suggest directions for future research.Footnote 16
To demonstrate the basic S-shaped development, we start with a simulation of Trevor's complex onsets. The learner is given a list of Trevor's targets, an empty Cache, and a list of grammars to go through. In this case, there are two grammars: the M≫F grammar and the F≫M grammar.
The learner then proceeds to process the targets as explained in §3, starting by simplifying complex onsets and storing the outputs in the Cache. When the number of stored forms exceeds a threshold, the grammar is switched, at which point new words are produced faithfully. Older words, which are stored simplified in the Cache, start to decay, gradually giving way to the grammar.
The learner generates an output file that lists the targets that were attempted and the way they were produced, faithful or unfaithful. The learning was repeated 100 times, each time randomising the order of the presentation of the tokens. Figure 8 shows the raw results of 100 simulations in grey. The black line traces the average rate of faithfulness for each day across all 100 simulations.
Simulation of faithfulness to complex onsets with ESL. Grey lines trace individual simulations; the average across simulations is traced in black.
The results in Fig. 8 show how a learner who switches sharply between grammars can still transition smoothly in production, replicating Trevor's behaviour quite closely. We now turn to the second part of our analysis, where the introduction of a markedness constraint causes a U-shaped dip in faithfulness.
To simulate the development of consonant harmony, the learner was given the list of Trevor's KVT and TVK target tokens, and four grammars to go through. The first grammar only contains one markedness constraint, Agree(TVK), and the ranking Max[dors]≫Max[cor], which causes K-dominant harmony on TVK words while allowing KVT words to surface faithfully. The second grammar introduces Agree(KVT), causing K-dominant harmony throughout. In the third grammar, Agree(KVT) and Agree(TVK) are installed below Max[cor], causing a shift to T-dominant harmony throughout. Finally, the Agree constraints are installed below Max[dors] as well, and the grammar produces faithful outputs.
The learner went through Trevor's targets, deciding how to output each one given the grammar and the contents of the Cache, as described in §3. This simulation was repeated 100 times. The raw results are plotted in grey in Fig. 9, with KVT targets separated from TVK targets. The black lines trace the average rate of faithfulness for each ‘day’ across all 100 simulations, and the letter symbols indicate the average number of harmonised tokens on a given ‘day’. We note that no particular statistical model is assumed here; the U-shape is a simple average of the simulations, and thus independent from the change-point analyses and the associated approach to non-linearity we took in §2.4.
Simulation of resistance to consonant harmony with ESL. Grey lines trace individual simulations; the average across simulations is traced in black.
The results offer a satisfyingly close match to Trevor's behaviour as seen in Fig. 3 above: a clear U-shape appears in the KVT panel, and a clear S-shape appears in the TVK panel. The KVT panel begins with a faithful period, then a period of K-dominant harmony, which smoothly transitions to a T-dominant harmony, and then into faithfulness again. The TVK panel begins with a K-dominant period, missing entirely any initial faithful productions. We note that the transition from K-dominance to T-dominance happens around the same time in both panels, also mimicking Trevor's behaviour (discussed in §3.3 above).
We note a small qualitative difference between Trevor's behaviour and the simulation: for Trevor, T-dominant harmony is rather weak among TVK words, and the T-dominant period is entirely subsumed by the K-dominant period, whereas in KVT words, T-dominant harmony is strong, and only overlaps briefly with the K-dominant period. The simulated learner, however, makes the same transition in both panels, giving about equal overlap between K-dominance and T-dominance. Our simulated learner could implement Trevor's asymmetry by stipulating that K-harmonised TVK forms decay more slowly than others, thus sustaining their appearance in the output longer than otherwise warranted. Since we have no theoretical insight to offer on this point, we leave the learner in its pristine, symmetric form.
5 Conclusions
This paper has offered an analysis of Trevor's phonological development, showing that it includes processes which show S-shaped and U-shaped trajectories of faithfulness. We attributed S-shaped trajectories to the presence of markedness constraints in the grammar at the onset of speech, whereas U-shaped trajectories are caused by the introduction of a markedness constraint into the grammar after faithful forms are already produced.
These two kinds of developments are linked, in our view, to the typological status of these two patterns in adult languages, viz. that complex onset simplification is attested in adult languages but major place consonant harmony is not. In other words, an attested adult process is uniformly S-shaped in Trevor's speech, while a set of his child-specific processes show a much wider variety of developmental trajectories: an S-shape for TVK, PVK and PVT words, a U-shape for KVT words and hardly any development in KVP and TVP words at all, appearing fully faithful almost from the very start. In our analysis, Agree(TVK), Agree(PVK) and Agree(PVT) already happen to be present in Trevor's grammar, and therefore we observe an S-shaped curve for those places. Agree(KVT) is introduced late in the game, and thus we see its depressing effect on faithfulness in KVT words. For KVP and TVP words, we hardly see any unfaithful productions at all, which may be due to the lack of Agree(KVP) and Agree(TVP), or else may represent only the tail end of their U-shaped effect. We wish to point out this variety of developmental trajectories, and emphasise that introducing child-specific markedness constraints into the grammar in the middle of phonological acquisition can give rise to a U-shaped path. We find the connection between Trevor's child-specific place harmony and its U-shape to be highly suggestive, and likely not accidental; yet this one child's corpus, as rich as it may be, does not necessarily generalise to English and beyond.
Another central theme of this paper is the discrete, categorical grammar that gives rise to productions that are variable and gradual. The Cache, which was proposed in Tessier (Reference Tessier2007, Reference Tessier2009) as a way to bring about realistic stages of acquisition into constraint demotion-based algorithms, finds here a new use as a buffer that smoothes over the categorical transitions between grammars (cf. the two-lexicon approach: Menn Reference Menn and Butterworth1983, Menn & Matthei Reference Menn, Matthei, Ferguson, Menn and Stoel-Gammon1992). This approach relegates variation to the learner's production mechanism; this is appropriate in the case of complex onsets and potentially harmonic words of English, since the target adult grammar is of course categorically faithful. The question of how learners might acquire target grammars which are themselves variable remains open for future investigation, but we reiterate that a variable target grammar is different in kind from a variable developing grammar. It has been noted at least since Labov (Reference Labov1963) that adult grammars use variation to signal various sophisticated aspects of e.g. register and personal identity to their listeners. This purposeful control of variation, though often unconscious, is qualitatively different from the variability seen in a child's gradual mastery of English complex onsets and place of articulation. This distinction is reflected in our proposal: whatever the mechanisms for creating and constraining adult variation in the grammar turn out to be, the Error-selective learner has an extragrammatical mechanism for creating variation along the way to mastery of their target.
Furthermore, since the Cache is designed to track the ranking arguments that come from individual lexical items, it creates variable behaviour that is specific to lexical items, as is observed in Trevor's speech and many other known cases of variation in child or adult languages. Lexical items differ in their behaviour, and yet the linguist can generalise meaningful patterns from these items using standard statistical methods, such as hierarchical regression models.
The computational simulation we offer shows that the grammatical apparatus we impute to Trevor generates the observed patterns, and allows rigorous testing of the theory. We add our results to a growing body of simulations of phonological development, noting that Trevor's corpus is particularly helpful in providing a single longitudinal record rather than cross-sectional experimental data (cf. Jarosz Reference Jarosz2009) and that its richness in both types and tokens allows for a more direct account of lexical items rather than abstractions over e.g. syllable types or word shapes (cf. Boersma & Levelt Reference Boersma, Levelt and Clark2000, Curtin & Zuraw Reference Curtin, Zuraw, Skarabela, Fish and Do2002, Albright et al. Reference Albright, Magri, Michaels, Chan, Jacob and Kapia2008). Finally, we hope to have shown that a combination of quantitative analysis and a model of grammar can inform each other, and build a richer understanding of phonological development.

