Constraint-based Phonology

Will Styler - LIGN 111


Today’s Plan


So far, we’ve been using SPE-style Generative Phonology


We define rules…


Then we apply them…

Underlying Form /kæt + z/ /dag + z/ /dɪʃ + z/
V Epenthesis
dɪʃɪz |

This approach has a lot of benefits


It’s the best way to start out in Phonology


… but it’s not the only approach


We’ve been seeing a lot of coda-hatred


It’s not just codas…


Over and over, a language will use multiple different rules to accomplish the same damned thing



“Why don’t we just talk about the things we’re trying to avoid, instead of creating crazy conspiracies of rules to deal with them?!”


Optimality Theory (OT)


Optimality Theory

A theory of phonology which relies on ranked constraints to solve phonological problems


Optimality Theory


We don’t need a conspiracy of rules to solve problems


Three basic steps


Let’s indulge in a fantasy


We use OT when buying a house


GEN in home-buying


CON in home-buying


Possible Constraints


* in OT means “Don’t allow this”


So, we have constraints

TwoBedrooms

HasTurret

NoCommute

NoLawn

*$350k+

GoodSchools


For us…


For somebody else…

TwoBedroom

GoodSchools

*$350k+

NoLawn

HasTurret

NoCommute


EVAL for Real Estate


*$350k+ TwoBedrooms NoCommute
NoLawn
HasTurret GoodSchools
House 1 * * *
House 2 *
House 3 * *
House 4 * *
House 5 *
House 6 * *

*$350k+ TwoBedrooms NoCommute
NoLawn
HasTurret GoodSchools
House 1 !* * *
House 2 !*
House 3 !* *
House 4 !* *
House 5 *
House 6 !* *

We have a house!


So, Optimality theory lets us pick the least-worst candidates from a massive set of possibilities


So, uh, Phonology?


GEN


CON


EVAL


(There’s more to it, but that’s the basics!)


How does this work in practice?


Back to Cats, Dogs, and Dishes


/kæt+z/


GEN - Let’s create a list of every possible surface form


CON - Generate and rank the constraints


EVAL - Evaluate the Candidates

/kæt+z/ *SS
AgreeVoice Max
Dep
Ident
[kætɪz] *
[kætɪs] * *
[kætz] *
[kæts] *
[kæt] *
[kæti] !*

EVAL - Evaluate the Candidates

/kæt+z/ *SS
AgreeVoice Max
Dep
Ident
[kætɪz] !*
[kætɪs] !* *
[kætz] !*
👉 [kæts] *
[kæt] !*
[kæti] !* *

Dogs


GEN - Come up with every possible form


CON - Generate and rank the constraints


EVAL - Evaluate the Candidates

/dag+z/ *SS
AgreeVoice Max
Dep
Ident
[dagɪz] !*
[dagɪs] !* *
👉 [dagz]
[dags] !* *
[dag] !*
[dagi] !* *

Dishes


GEN and CON work the same


EVAL

/dɪʃ+z/ *SS
AgreeVoice Max
Dep
Ident
👉 [dɪʃɪz] *
[dɪʃɪs] !* *
[dɪʃz] !* *
[dɪʃs] !* *
[dɪʃ] !*
[dɪʃi] !* *

OT’s Strengths and Weaknesses


Optimality Theory Strengths


Optimality Theory Weaknesses


Optimality Theory has been expanded and improved


… but constraint-based approaches are everywhere, and with good reason!


Wrapping up


For Next Time

We’ll work with an OT analysis!


Thanks!