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

N+7: The Oulipo Substitution Method

Graduate Depth 106 in the knowledge graph ☐ I know this ☆ Set as goal
716prerequisites beneath it
See this on the map →
Oulipo: Mathematical Constraint and Literary PotentialConstrained Writing: Formal Systems and Limitation→
n-plus-seven oulipo substitution constraint

Core Idea

N+7 replaces each noun in a text with the noun appearing seven positions after it in a dictionary, producing systematic textual transformation through an algorithmic procedure. This method generates surprising meanings through mechanical rule-following and anticipates computational text processing, demonstrating how systematic constraint generates rather than constrains meaning-making.

Explainer

N+7 is deceptively simple: take any text, identify every noun, and replace it with the noun appearing seven positions after it in a chosen dictionary. Apply this rule mechanically to every noun, and you have transformed the text. The result is often surprising, sometimes nonsensical, frequently witty or profound.

The procedure is entirely mechanical. It requires no interpretation, no aesthetic judgment, no intentional meaning-making. Yet meaning emerges. A sentence like "the cat sat on the mat" might become "the caper sat on the mating" (depending on dictionary—'cat' replaced by seven positions later, 'mat' by another noun). The original meaning dissolves; new meaning crystallizes. The semantic collision between original context and replacement nouns generates unexpected resonance.

This demonstrates something crucial about constraint and creativity. Romanticism suggests that creativity requires freedom—the artist following their individual inspiration. N+7 inverts this: mechanical rules, far from constraining creativity, generate unexpected creative results. The procedure produces meanings no human author would intentionally choose, yet these meanings often possess wit, profundity, or aesthetic interest. Constraint becomes generative.

N+7 also reveals something about language itself. The procedure treats language as formal structure—nouns as positions in dictionary sequences—rather than as semantically significant units. This abstraction from meaning to form makes language manipulable. Once you treat nouns as formal positions rather than semantic carriers, you can systematically transform them. This approach anticipates computational text processing: treating language mechanically, as a structure to be processed algorithmically.

The method also challenges authorial authority. In conventional writing, the author controls meaning through intentional word choice. N+7 removes authorial choice: the procedure dictates replacements. Yet meaning still emerges, sometimes brilliantly. This suggests that meaning is not the exclusive property of authorial intention. Systematic procedure, accident, and mechanical transformation can generate meanings as profound as intentional composition.

Finally, N+7 demonstrates that aesthetic value and meaning can emerge from procedure. The procedure is not a means to an end (creating meaningful text) but contains its own logic and generates effects independent of authorial intention. This prefigures generative and procedural art more broadly—the idea that rules and systems can be sources of aesthetic and conceptual innovation.

What did you take from this?

Topics in reflective domains aren't scored by quiz answers. Read, reflect, and mark when you've thought it through.

Quiz me anyway →

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 → Constraint Interaction and Ranking in Optimality Theory → Constraint Ranking and Typology in Optimality Theory → Metrical Phonology and Stress Systems → Formal Models of Stress and Accent → Meter and Rhythm in Poetry → Iambic Pentameter → Scansion → Poetic Form Overview → Constrained Writing: Formal Systems and Limitation → Oulipo: Mathematical Constraint and Literary Potential → N+7: The Oulipo Substitution Method

Longest path: 107 steps · 716 total prerequisite topics

Prerequisites (2)

Leads To (0)

No topics depend on this one yet.