A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Markedness Constraints in Phonology

Research Depth 95 in the knowledge graph I know this Set as goal
154topics build on this
577prerequisites beneath it
See this on the map →
Optimality TheoryPhonological Features+2 moreConstraint Interaction and Ranking in Optimality Theory
markedness optimality-theory phonology

Core Idea

Markedness constraints penalize marked structures—those that are rare, complex, or violate universal phonological preferences. ONSET requires syllables to have onsets; NO-CODA disfavors codas. Markedness constraints interact with faithfulness: when markedness constraints are ranked high, languages exhibit processes (deletion, epenthesis) that create unmarked structures. Ranking of markedness constraints determines the phonotactic inventory and phonological processes of a language.

How It's Best Learned

Identify which phonological processes in a language are driven by markedness (e.g., vowel epenthesis to satisfy ONSET), and construct constraint rankings that derive them. Compare across languages with different markedness priorities.

Common Misconceptions

Explainer

You already know, from phonological features and Optimality Theory, that sounds are not atoms — they have internal structure, and some structures are preferred over others cross-linguistically. Markedness is the theoretical framework that formalizes this observation: some phonological structures are marked (complex, rare, or avoided) and others are unmarked (simple, common, preferred). Markedness constraints are OT constraints that penalize marked structures — they push grammars toward simpler, more universally common phonological patterns.

The most intuitive markedness constraints are phonotactic: ONSET requires every syllable to begin with a consonant; NO-CODA disfavors syllables that end in a consonant. These constraints capture genuine cross-linguistic tendencies — CV (consonant-vowel) syllables are the most universally preferred syllable type, found in every language, while CVC syllables and especially complex codas are restricted in many. But markedness isn't limited to syllable structure. There are markedness constraints against voiced obstruents in coda position (many languages devoice final consonants), against nasal vowels, against particular consonant clusters, against tones in certain positions. Each constraint represents a preference that human phonological grammars lean toward when not overridden by competing constraints.

The crucial interaction is with faithfulness constraints like MAX and DEP. Markedness constraints want to eliminate complex structures; faithfulness constraints want to preserve the input. When markedness dominates faithfulness, the language uses phonological processes to repair marked structures: vowel epenthesis to satisfy ONSET (inserting a vowel so that a word-initial vowel acquires a preceding consonant), final consonant deletion to satisfy NO-CODA, cluster simplification to satisfy onset complexity constraints. When faithfulness dominates markedness, marked structures surface intact — the input is preserved even though it violates phonological preferences. This is why marked structures exist in languages at all: they are licensed by high-ranked faithfulness.

What markedness theory explains that earlier rule-based accounts could not is the cross-linguistic asymmetry in phonological processes. Languages systematically simplify toward unmarked structures — they rarely introduce more complex structures through phonological processes. When a language undergoes sound change, the change almost always moves toward less marked structures when faithfulness constraints weaken, almost never toward more marked ones. This directionality of phonological change and variation is predicted by the architecture of OT with markedness constraints: the grammar is always pushing toward unmarked structures, and faithfulness is the only counterweight holding marked structures in place.

Practice Questions 5 questions

Prerequisite Chain

Understanding ZeroThe Number ZeroCounting to FiveCounting to 10Counting to 20Counting a Set of Objects Up to 20Cardinality: The Last Number CountedMatching Numerals to QuantitiesSubitizing Small QuantitiesAddition Within 10Number Bonds to 10Addition Within 20Doubles and Near DoublesDoubles Facts Within 10Near Doubles Facts Within 20Mental Math Strategies for AdditionMental Math: Adding and Subtracting TensAddition Within 100Repeated Addition as MultiplicationMultiplication as Equal GroupsMultiplication: ArraysBasic Multiplication Facts (0s, 1s, 2s, 5s, 10s)Multiplication Facts Within 100Division as Equal SharingDivision as Grouping (Measurement Division)Division: Grouping (Repeated Subtraction) ModelDivision: Fair Sharing ModelDivision as Equal SharingDivision as GroupingBasic Division FactsDivision Facts Within 100Multiplication and Division Fact FamiliesRelationship Between Multiplication and DivisionDivision Facts as Inverse of MultiplicationRemainders and Quotients in DivisionDivision Word ProblemsMulti-Step Word ProblemsSolving Multi-Step Word ProblemsMultiplication Word ProblemsDivision Word ProblemsIntroduction to Long DivisionFactors and MultiplesPrime and Composite NumbersEquivalent FractionsRelating Fractions and DecimalsDecimal Place ValueIntegers and the Number LineComparing and Ordering IntegersAbsolute ValueAdding IntegersSubtracting IntegersMultiplying IntegersDividing IntegersUnit RatesProportionsPercent ConceptConverting Between Fractions, Decimals, and PercentsOperations with Rational NumbersTwo-Step EquationsSolving Multi-Step EquationsEquations with Variables on Both SidesLiteral EquationsSlope-Intercept FormPoint-Slope FormWriting Linear EquationsParallel and Perpendicular Line SlopesGraphing Linear EquationsPiecewise FunctionsStep FunctionsComposition of FunctionsInverse FunctionsRadical Functions and GraphsRational ExponentsExponential Functions and GraphsLogarithms IntroductionBig-O Notation and Asymptotic AnalysisBreadth-First Search (BFS)Shortest Paths in Unweighted GraphsDijkstra's Shortest Path AlgorithmAlgorithm Analysis and Big-O NotationTuring MachinesDeterministic Finite AutomataNondeterministic Finite AutomataPushdown AutomataContext-Free GrammarsNeural Language Models and TransformersSyntactic Parsing Algorithms and ModelsParsing, Reanalysis, and Garden-Path RecoveryReanalysis and Language ChangeGrammaticalization: Mechanisms and PathwaysGrammaticalization Pathways and MechanismsGrammaticalization and Semantic BleachingSound Change Mechanisms and Diachronic PhonologyAutosegmental PhonologyFeature Geometry in PhonologyMarkedness Constraints in Phonology

Longest path: 96 steps · 577 total prerequisite topics

Prerequisites (4)

Leads To (1)