Markov Chaining (to generate Fake Alex Jones)
4This Markov Chain algorithm is about learning patterns in words. You start by feeding it a corpus (a body of work from an artist you want to emulate) and it learns what words follow what words with what probability. Also, which words begin sentences and end sentences. This creates a graph connecting all the words, with also a vertex for the start and the end.
The second half of the algorithm is to randomly generate new sentences using those probabilities. Starting at the start node, you randomly roll which word should begin the sentence, and then move there on the graph. You then keep randomly rolling dice and moving to vertex after vertex until you end up on the end node, at which you stop.
In today's class, a student suggested we make fake Alex Jones words, and the results we got were hilarious.
Other Videos By Bill Kerney
| 2021-10-16 | Fallacies: Appeal to Ignorance, Correlation is Causation |
| 2021-10-15 | The Society of Creative Anachronism |
| 2021-10-15 | C++ Member Functions |
| 2021-10-14 | Recursion Part I |
| 2021-10-14 | Linear Algebra for Games |
| 2021-10-14 | Level Design Flow |
| 2021-10-13 | Constructors and Destructors Part II |
| 2021-10-13 | Constructors and Destructors, Physics Simulation (Part 1) |
| 2021-10-13 | Red Herring, Non-Sequitur, Strawman, Ad Hominem, Tu Quoque |
| 2021-10-12 | Max Flow |
| 2021-10-12 | Markov Chaining (to generate Fake Alex Jones) |
| 2021-10-12 | Color, Story, Level Design |
| 2021-10-12 | Debugging; Pitch Documents; Time; Timelines to Make a Door |
| 2021-10-11 | Week 10 Day 1 - Classes Part I |
| 2021-10-11 | Fallacies Part III |
| 2021-10-08 | New/Delete, Stack vs. Heap, Old C++ vs. Modern C++ |
| 2021-10-08 | Fallacies of Composition/Division/Circular Logic |
| 2021-10-07 | Adding Skeletal Animations to UE4 |
| 2021-10-07 | Dijkstra Part II + Minimal Spanning Trees |
| 2021-10-07 | Making a 3D Engine in a Terminal |
| 2021-10-06 | Fallacies |