A Simple Markov Model:
Consonants and Vowels
This page stochastically generates a Markov Chain by selecting the next letter type (consonant C or vowel V) at each step of the chain based only on the letter type at the previous step and the transition probabilities Andrey Markov calculated in his famous paper. Press the Start button below and watch the totals converge to the overall proportion of vowels that Markov hand-counted in the first 20,000 characters of Eugene Onegin (approximately 43%).
| Observed | V→V | V→C | C→V | C→C |
|---|---|---|---|---|
| Count | 0 | 0 | 0 | 0 |
| Share | – | – | – | – |
Share = fraction of moves out of each state
Vowels
0
–
Consonants
0
–
Steps: 0
Current: –
Last 12:
Running % vowels over time (dashed white line: long-run expectation, V / C):
Built with Claude Code