Currently the syllable class contains an accumulator for various letters. If these letters exist it corresponds to a special syllable. I however think that this is fairly limited because “fish” and “shift” will be interpreted as the same word. Yet, µSpeech should be capable of better: we are able to tell when an individual letter has been said. For instance the occurrence of “f” in fish should occur more at the beginning, where as the occurrence of “f” in “shift” should occur at the end.

For solving this problem I have been considering two methods: The skewness and a method based on pure calculus. Today I will explore Skewness.

**Skewness – The theory**

Skewness is a measure of how something leans to one side. Its statistical definition is:

Where is the 3rd moment of the mean i.e .

Now going back to High school mathematics:

Given that :

Since :

This results in the necessity for the algorithm to compute 3 variables:

**Making the algorithm online**

Now given that µSpeech has stringent memory requirements it seems imperative that we devise the algorithm so that the following can be done:

- Data is not kept in an array.
- Computation is minimal.

Thus keeping these in mind it seems necessary to look at ways of computing the three variables online. To start with lets tackle the simplest algorithm, the one for µ.

Given that , one can write an algorithm as such:

This can be extended to :

The third value which we need to compute .

So we need to find :

Part 2 coming soon.