Total video to watch in this module: 51 minutes
Once the text is entirely converted to words, we need to decide on their pronunciations.
We need a set of labelled training data, because this is supervised machine learning.
We start by placing all the training data at the root node, and calculating its entropy.
Next, we try splitting the data at the root node using one of the available questions...
...and repeat for all other available questions. The best one is placed in the tree. Then we recurse.
This is typically predicted in several stages: placement of events, classification of their types, then realisation.