Introduction to Markov Chains in F#
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)
- Introduction to Docker Fundamentals (in London on 30th September - 1st October 2019)
- CloudNative London 2019 (in London on 25th - 27th September 2019)
- Running Stateful Applications in Kubernetes (in London on 5th September 2019)
- Functional Concurrency in .NET with C# and F# (in London on 9th - 10th September 2019)
- Modern Application Development with C# and .NET Core (in London on 16th - 19th September 2019)
- ProgNET London 2019 (in London on 11th - 13th September 2019)
- F# eXchange 2020 (in London on 2nd - 3rd April 2020)
- Keynote by Iris Classon on .NET Core and More: 30 Things You Should Know (in London on 28th August 2019)
- London .NET September 2019 with James Bender (in London on 4th September 2019)
- GraphQL: May the Best API Win! (SkillsCast recorded in July 2019)
- Scala 2.13 and Beyond! (SkillsCast recorded in April 2019)
Thanks to our sponsors
Introduction to Markov Chains in F#
Mariusz Wojcik
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.
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)
- Introduction to Docker Fundamentals (in London on 30th September - 1st October 2019)
- CloudNative London 2019 (in London on 25th - 27th September 2019)
- Running Stateful Applications in Kubernetes (in London on 5th September 2019)
- Functional Concurrency in .NET with C# and F# (in London on 9th - 10th September 2019)
- Modern Application Development with C# and .NET Core (in London on 16th - 19th September 2019)
- ProgNET London 2019 (in London on 11th - 13th September 2019)
- F# eXchange 2020 (in London on 2nd - 3rd April 2020)
- Keynote by Iris Classon on .NET Core and More: 30 Things You Should Know (in London on 28th August 2019)
- London .NET September 2019 with James Bender (in London on 4th September 2019)
- GraphQL: May the Best API Win! (SkillsCast recorded in July 2019)
- Scala 2.13 and Beyond! (SkillsCast recorded in April 2019)
Thanks to our sponsors
Introduction to Markov Chains in F#
Mariusz Wojcik
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.