Additional Info: I designed a Python workflow to perform OCR on every xkcd comic, feed that text into a large language model, and ask the model whether this comic was about the category named in the title.
Report an error
xkcd comics published about childhood correlates with...
Variable | Correlation | Years | Has img? |
Jet fuel used in Kyrgyzstan | r=0.92 | 15yrs | No |
The number of air traffic controllers in Minnesota | r=0.9 | 15yrs | Yes! |
Number of registered Yamaha motorcycles in the UK | r=0.87 | 15yrs | Yes! |
Ice cream consumption | r=0.86 | 15yrs | No |
Season wins for the New York Giants | r=0.82 | 17yrs | Yes! |
Arson in United States | r=0.8 | 16yrs | No |
Number of games won by Detroit Red Wings in NHL season | r=0.71 | 16yrs | No |
The number of movies Viggo Mortensen appeared in | r=0.64 | 17yrs | No |
xkcd comics published about childhood also correlates with...
<< Back to discover a correlation
You caught me! While it would be intuitive to sort only by "correlation," I have a big, weird database. If I sort only by correlation, often all the top results are from some one or two very large datasets (like the weather or labor statistics), and it overwhelms the page.
I can't show you *all* the correlations, because my database would get too large and this page would take a very long time to load. Instead I opt to show you a subset, and I sort them by a magic system score. It starts with the correlation, but penalizes variables that repeat from the same dataset. (It also gives a bonus to variables I happen to find interesting.)