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

Found Poetry and Erasure

College Depth 108 in the knowledge graph ☐ I know this ☆ Set as goal
834prerequisites beneath it
See this on the map →
Compression and Economy in PoetryIntertextuality and Allusion→
construction existing-text erasure transformation

Core Idea

Found poetry constructs poems from existing texts—newspaper articles, advertisements, overheard speech—by selecting, arranging, or erasing passages to create new meaning. Erasure poetry deliberately obscures parts of existing text, transforming it through strategic absence.

Explainer

From your work on poetic compression and economy, you know that poetry generates meaning through selection and pressure — every word earns its place, and what is omitted is as significant as what is kept. Found poetry and erasure poetry make this principle literal: the raw material is already language, and the poet's task is to cut and arrange until meaning emerges from what remains.

Found poetry begins with a source text that was not written as poetry — a news report, a legal document, a cereal box, a field guide, overheard conversation. The poet reads this text as potential material and extracts lines, phrases, or sequences that, when lifted from their original context and arranged on the page with poetic lineation and spacing, become something new. The transformation is not about individual words being poetic; it's about the act of framing and isolation. "He was found at 6 a.m. in a field / his shoes still tied" reads differently as a coroner's report than when broken across two lines with white space forcing the reader to pause. The lineation is doing the work your study of poetic line has prepared you to recognize.

Erasure poetry (also called blackout poetry) is more radical. The poet takes a page of existing text — Ronald Johnson famously used *Paradise Lost*, Austin Kleon uses newspaper pages — and obscures most of it, leaving only selected words or phrases visible. The result is a poem that exists inside the original text, revealed by the act of hiding. What makes erasure conceptually interesting is its relationship to intertextuality: the ghosted original text is still present, still partly legible, and the tension between the source and what remains is part of the poem's meaning. An erasure of a government report on war that surfaces words like "dust" and "daughters" and "silence" is commenting on the original by what it finds within it.

Both forms ask a philosophical question about authorship: who made this poem? The poet did not write the words, but chose them. This is a version of the curation-as-creation problem, and it connects to your understanding of intertextuality — all texts exist in dialogue with other texts, but found poetry makes that dialogue visible as structure. The found poet argues, implicitly, that meaning does not live in original composition alone; it can be excavated, redistributed, reframed.

Practically, working with found poetry trains your attention to what makes language behave poetically. When you read a source text looking for potential poem-lines, you are running the test of poetic compression on every phrase: does this earn isolation? Does white space around it change how it sounds? The answer sharpens your sensitivity to rhythm, image, and resonance — skills that transfer directly to writing original poems and reading existing ones more carefully.

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 → Free Verse → The Poetic Line and Lineation → Enjambment → Compression and Economy in Poetry → Found Poetry and Erasure

Longest path: 109 steps · 834 total prerequisite topics

Prerequisites (2)

Leads To (0)

No topics depend on this one yet.