Talk:Sukhotin's algorithm
| This is the talk page for discussing improvements to the Sukhotin's algorithm redirect. This is not a forum for general discussion of the article's subject. |
Article policies
|
| Find sources: Google (books · news · scholar · free images · WP refs) · FENS · JSTOR · TWL |
 | This redirect does not require a rating on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | |||||||||||||||||||||||
| ||||||||||||||||||||||||
.jpg){kind=small}
Attention needed edit
- Expand - the article does not explain what it is, merely whaere it may be used and what category it falls into. Expand to explain what the algorithm is
- References needed
- Chaosdruid (talk) 23:47, 9 January 2011 (UTC)
The algorithm itself edit
Hi I just read the sukhotin paper, the idea behind the algorithm is:
Hi I just read the sukhotin paper, the idea behind the algorithm is:
it is hard to pronounce a prolonged string of consonants CCCCCC... but few variation seems possible with vowels VVVVV... so most languages alternate vowels and consonants. Consider some function of co-occurence, i.e. being adjacent in a word.
Call D a possible division of letters into disjoint sets of vowels V and consonants C.
Call f(l_i,l_j) the frequency of co-occurence in some corpus.
Then we expect Q(D)=sum over all vowels according to D of (sum over all consonants according to D of (frequency of co-occurence)) should be a maximum.
He alludes to some optimizations but does not give them in the paper... — Preceding unsigned comment added by 83.134.178.100 (talk) 16:26, 26 February 2012 (UTC)