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

Applicative Voice Operations

Research Depth 91 in the knowledge graph ☐ I know this ☆ Set as goal
5topics build on this
579prerequisites beneath it
See this on the map →
Argument Structure and Thematic RolesValency-Changing Operations+1 more→→Causative Voice ConstructionsMiddle Voice Constructions
syntax voice valency morphology

Core Idea

Applicative voice is a valency-increasing operation that promotes a peripheral thematic role (benefactive, locative, instrumental, malefactive) to object status. Applicative morphemes, frequent in Bantu languages, allow constructions like 'build-APPL a house for him' (benefactive applicative) to function as syntactically transitive or ditransitive structures.

Explainer

You've studied valency-changing operations — processes that add or remove arguments from a verb's argument structure. You've also worked with thematic roles: the semantic labels (Agent, Patient, Beneficiary, Goal, Instrument, Location) that describe how participants relate to an event. Applicative voice is where those two frameworks intersect: it is a valency-increasing operation that takes a role that is normally expressed as an adjunct (a peripheral, optional phrase) and pulls it into the core argument position of the verb.

To see the contrast, start with a simple transitive clause: "She built a house." The verb *build* has two core arguments — an Agent (she) and a Patient (a house). If you want to add a Beneficiary, you do so with a prepositional phrase: "She built a house for him." That for-phrase is an adjunct — syntactically optional, not required by the verb's valency. In a language with a productive applicative morpheme, the verb itself can be marked to incorporate that Beneficiary directly: "She build-APPL him a house," where *him* is now a direct object, a core argument. The preposition disappears; the morpheme on the verb absorbs it. The result is a ditransitive structure with three core arguments: Agent, Applied Object (the new one), and Patient.

Different thematic roles produce different applicative types. A benefactive applicative promotes a Beneficiary ("she cooked-APPL him food" = she cooked food for him). A locative applicative promotes a Location ("she slept-APPL the mat" = she slept on the mat). An instrumental applicative promotes an Instrument ("she hit-APPL the stick him" = she hit him with the stick). A malefactive applicative promotes someone adversely affected ("she cooked-APPL him food" in a context meaning she cooked his food without permission). Bantu languages like Swahili and Chichewa are the canonical examples because their applicative morphemes are highly productive and their argument-structure effects have been extensively documented.

Why does this matter for typology and syntactic theory? The applied object behaves like a core argument in several ways: it can become the subject of a passive, it controls agreement morphology on the verb, and it has the word-order properties of a direct object. This is evidence that grammatical relations like "object" are not just semantic notions but syntactic positions that can be assigned to different thematic roles by morphological means. Applicatives thus reveal a crucial design feature of clause structure: the number of semantic roles present in an event can exceed the verb's default valency, and morphological operations exist to restructure which roles occupy which grammatical slots. From your earlier work on case systems, you can also see that languages with rich case morphology often don't need applicative morphemes — they can simply case-mark a Beneficiary differently — which is one reason applicatives are more developed in languages with less robust case systems.

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 → Case Systems and Their Typological Variation → Applicative Voice Operations

Longest path: 92 steps · 579 total prerequisite topics

Prerequisites (3)

Leads To (2)