Anagrams, but where you can break apart letters: "Anagraphs"

suckerpinch · 255K views · 2017 · 12:04

Open on YouTube

Recreational & visual mathLanguage & linguisticsCreative coding & generative artexplainer

Why Hacker News recommends it

HN recommends it as a typical example of Tom7's technically astounding and playful videos.

What it is

Tom Scott-style exploration by suckerpinch (Tom7) of generalized anagrams where letters can be broken into pieces, called anagraphs, with a whimsical computational approach.

Recommended by 3 HN commenters across 3 different months, 2020 to 2023.

What Hacker News said

Strong rec ryanfox · 2020-10 · on “When Fonts Fall”

> I want fonts to be made out of just a handful (at a minimum) of primitives -- e.g. here's a vertical stroke, a horizontal stroke, diagonal strokes, what various serif endings look like, here are what the bowls of letters look like, etc. Tom7, who makes excellent videos about computers, has one about splitting letters up to create anagrams in this way.[0] All of his videos are technically astounding, like the one where he frankensteined a raspberry pi into a game cartridge to play SNES games on a NES, or the one where he designed and built a computer using IEEE 754 NaN and infinity instead of 0 and 1. [0] [this video]

Strong rec _jholland · 2023-05 · on “I found the best anagram in English (2017)”

This is great! It reminds me of a Tom7 video of a similar ilk: Anagrams, but where you can break apart letters: "Anagraphs" - [this video] . Similar to this, he produces a standard form for each word, but breaks each letter into letter pieces or 'atoms' which gives much more freedom for moving between words. Definitely give it a watch. If you are not familiar with Tom7's videos, he has a hilarious whimsical style while also bringing to life completely out there ideas with some brilliant technical skill.

Recommends xmprt · 2021-04 · on “Uppestcase and Lowestcase Letters”

His video on anagraphs is interesting ( [this video] ) especially if watched alongside his followup video proving that generalized kerning is an undecidable problem ( [LINK] )