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

Flarf and Conceptual Poetry: Search Engine Poetics

Graduate Depth 105 in the knowledge graph ☐ I know this ☆ Set as goal
853prerequisites beneath it
See this on the map →
Electronic Poetry: Digital Forms and Affordances→
flarf conceptual-poetry search-engine found-text

Core Idea

Flarf poetry uses internet search results as raw material for poetic composition, treating the internet as a vast accessible text. This practice demonstrates how contemporary poetry emerges from digital information saturation while emphasizing procedure and conceptual framing over conventional poetic sensibility or craft.

Explainer

Flarf poetry emerged in the early 2000s as poets began treating internet search results as literary material. The procedure is simple: formulate a search query (often absurdist, experimental, or provocative), retrieve results, and assemble the retrieved text into poetic composition. A poet might search for phrases like "I am bored of everything" or "the night is soft," collecting the awkward, earnest, trivial, and unexpected sentences that appear in search results. These are then arranged into poems that derive their charge from the collision of internet banality, accidental poetry, and curatorial selection.

This practice represents a radical departure from conventional understandings of poetic authorship. Romantic poetry posits the poet as generator: drawing from internal resources, imagination, and sensibility, the poet creates original language. Flarf inverts this: the poet becomes editor and curator. The language already exists on the internet; the poetic act consists of searching for it and selecting how to arrange it.

This shift reflects contemporary conditions of information saturation. Poets in the early 2000s were confronting an explosion of digital text—billions of web pages, constant content generation, overwhelming linguistic abundance. Flarf's strategy is to acknowledge this saturation rather than pretend to write from romantic isolation. The internet becomes the primary poetic material, already available, already-generated language waiting to be found and curated.

The procedure becomes central to what makes something a flarf poem. Different search queries generate different material; different selection and arrangement strategies create different effects. A poet working with "sad corporate jargon" phrases generates different poetry than one searching for "accidental beautiful phrases." The conceptual framing—the choice of what to search for and how to curate—becomes the primary creative act. This is why flarf is often discussed alongside conceptual art: the idea and procedure matter more than the execution or beauty of result.

Flarf also intervenes in authorship debates. If a flarf poem is assembled from internet language, who is the author? The original writers whose phrases were retrieved? The poet-curator who selected and arranged them? The search engine that identified matches? Flarf embraces this ambiguity, suggesting that contemporary authorship is increasingly collaborative, mediated by algorithms and infrastructure, and dependent on vast repositories of existing language. Rather than a failure of authorship, flarf treats this as the condition of contemporary writing itself.

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 → Electronic Poetry: Digital Forms and Affordances → Flarf and Conceptual Poetry: Search Engine Poetics

Longest path: 106 steps · 853 total prerequisite topics

Prerequisites (1)

Leads To (0)

No topics depend on this one yet.