| Viewing Single Post From: Vowel identification - Sukhotin's Algorithm | |
|---|---|
| jdege | Oct 30 2008, 12:31 AM |
|
Elite member
![]() ![]() ![]() ![]() ![]() ![]() ![]()
|
One of the articles in Cm suggests that instead of calculating the sum for each row, you calculate the sum and the variety of contact (VOC). Then choose as the vowel the largest product of sum and VOC. Then decrement the sum by 2x the count, as we had been doing, and decrement the VOC by 1x the count. If any sum goes below zero, set it to 0, otherwise you could see a negative sum and a negative VOC be the highest product. |
| When cryptography is outlawed, bayl bhgynjf jvyy unir cevinpl. | |
![]() |
|
| Vowel identification - Sukhotin's Algorithm · General | |




![]](http://209.85.122.85/static/1/pip_r.png)


12:37 PM Nov 25