search the curve

Add a word to the count.

Try a word, see whether it is new or rediscovered, and add one anonymous signal to the shared ranking.

0 discoveries from this browserTry “café”, “fjord”, or “lake”.
how it works

Random searches become a ranked public signal.

Every valid search checks one dictionary boundary. A first match creates a public word record; later matches increment that word’s rediscovery count.

Nothing is weighted or predicted. The curve is made from the order people actually search: familiar words pile up, while rare rediscoveries stretch into the tail.

live rank curve

The experiment is the graph.

The left edge tracks the most rediscovered words. The long right side is where one-off searches wait to be found again.

Zipf trace

Rediscovery counts by rank

apple: rank 1, 4 searchesapplediscord: rank 2, 2 searchesdiscordhello: rank 3, 2 searcheshellowater: rank 4, 1 searchwatertree: rank 5, 1 searchtreeworld: rank 6, 1 searchworldJeffery: rank 7, 1 searchJefferyyou: rank 8, 1 searchyoulake: rank 9, 1 searchlaketest: rank 10, 1 searchtest
Each point is a word. A sharper left edge and a quieter right tail are the shape this public search experiment is watching for.
17discovered words
15rediscovery searches
10ranked words shown
rediscovery leaders

Most searched words

  1. apple4
  2. discord2
  3. hello2
  4. water1
  5. tree1
  6. world1
  7. Jeffery1
  8. you1
discovery archive

New first finds keep the archive growing.

2026-06-03: 13 discoveries2026-06-04: 4 discoveries
2 days of first discoveries
boundaries

Searches stay public, plain, and dictionary-bound.

Valid searches

Latin-script words with optional internal apostrophes or hyphens, present in the imported dictionary data.

Not counted

Numbers, emoji, punctuation-only input, overly long strings, spaces, and words absent from the current corpus.

Public notes

Anonymous notes are immediate, length-limited, plain text, and intended for word context rather than private messages.