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 more→→Constraint 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 Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Dividing Integers → Unit Rates → Proportions → Percent Concept → Converting Between Fractions, Decimals, and Percents → Operations with Rational Numbers → Two-Step Equations → Solving Multi-Step Equations → Equations with Variables on Both Sides → Literal Equations → Slope-Intercept Form → Point-Slope Form → Writing Linear Equations → Parallel and Perpendicular Line Slopes → Graphing Linear Equations → Piecewise Functions → Step Functions → Composition of Functions → Inverse Functions → Radical Functions and Graphs → Rational Exponents → Exponential Functions and Graphs → Logarithms Introduction → Big-O Notation and Asymptotic Analysis → Breadth-First Search (BFS) → Shortest Paths in Unweighted Graphs → Dijkstra's Shortest Path Algorithm → Algorithm Analysis and Big-O Notation → Turing Machines → Deterministic Finite Automata → Nondeterministic Finite Automata → Pushdown Automata → Context-Free Grammars → Neural Language Models and Transformers → Syntactic Parsing Algorithms and Models → Parsing, Reanalysis, and Garden-Path Recovery → Reanalysis and Language Change → Grammaticalization: Mechanisms and Pathways → Grammaticalization Pathways and Mechanisms → Grammaticalization and Semantic Bleaching → Sound Change Mechanisms and Diachronic Phonology → Autosegmental Phonology → Feature Geometry in Phonology → Markedness Constraints in Phonology

Longest path: 96 steps · 577 total prerequisite topics

Prerequisites (4)

Leads To (1)