A Markov Chain is a stochastic model describing a sequence of possible events, in which the probability of each event depends only on the state attained in the previous event. There are many examples of Markov processes including Google's PageRank algorithm, thermodynamic models and automated speech-recognition systems.
We'll go through a sample implementation of a predictive text system like the one you can find on your phone. Then we will look at how to generate superficially real-looking words.
YOU MAY ALSO LIKE:
- A Simple Bid Recommendation Engine Using FParsec and CodeDom (SkillsCast recorded in January 2019)
- Functional Concurrency in .NET with C# and F# with Riccardo Terrell (Online Course on 1st - 4th December 2020)
- F# eXchange 2020 (Online Conference on 21st October 2020)
- Applied Domain-Driven Design — Full-Stack Event Sourcing (SkillsCast recorded in July 2020)
- Pragmatic Memory Management (SkillsCast recorded in October 2019)
Introduction to Markov Chains in F#
Mariusz is an experienced developer on the Microsoft stack since before the dawn of the .NET Framework with a passion for programming patterns, distributed computing, machine learning algorithms and recently, functional programming and F# especially. Aspiring presenter. Book lover.