False as stated. Markov introduced the chains in a 1906 paper on the law of large numbers for dependent variables. His 1913 study of vowel and consonant sequences in the first 20,000 letters of Pushkin's Eugene Onegin was their first application to real data, not their origin.
Card 1 of 259. Answer: False as stated. Markov introduced the chains in a 1906 paper on the law of large numbers for dependent variables. His 1913 study of vowel and consonant sequences in the first 20,000 letters of Pushkin's Eugene Onegin was their first application to real data, not their origin.
About · Quizzes · History of AI · To suggest new questions or report an error send me a dm.
False as stated, though it is a popular telling. Markov introduced his chains in a purely mathematical paper in 1906. In 1913 he applied them to Alexander Pushkin's verse novel Eugene Onegin, the first use of a Markov chain on real data. A Markov chain is a sequence of random states in which the next depends only on the current one.
He presented the study to the Imperial Academy of Sciences in St. Petersburg on 23 January 1913 (Julian calendar). He labeled the first 20,000 letters as vowels or consonants and counted which followed which. Vowels were 43.2% of the letters, yet after a vowel the chance of another vowel was only about 0.128, while after a consonant the chance of a vowel was about 0.663. The letters were not independent, and a two-state chain captured the alternation.
The 1906 paper answered Pavel Nekrasov, who claimed the law of large numbers requires independence. The idea later fed Claude Shannon's 1948 models of English, n-gram language models and hidden Markov models.
