Magdiel Marquez mmagdiel
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| # -*- coding: utf-8 -*- | |
| """ | |
| This is an example of a basic optical character recognition system. | |
| Some components, such as the featurizer, are missing, and have been replaced | |
| with data that I made up. | |
| This system recognizes words produced from an alphabet of 2 letters: 'l' and 'o'. | |
| Words that can be recognized include, 'lol', 'lolol', 'and loooooll'. | |
| We'll assume that this system is used to digitize hand-written notes by Redditors, | |
| or something. |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| """ | |
| Viterbi algorithm for finding the most likely state sequence of a simple | |
| hidden markov model. | |
| # https://en.wikipedia.org/wiki/Viterbi_algorithm | |
| The Model | |
| --------- | |
| The HMMs considered in this code are extremely simple. Every hidden state | |
| is uniquely associated with an output symbol, but the link is "fuzzy". That is, |
NewerOlder