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.

Put new text under old text. Click here to start a new topic.
New to Wikipedia? Welcome! Learn to edit; get help.

Article policies

Find sources: Google (books · news · scholar · free images · WP refs) · FENS · JSTOR · TWL

Robotics Redirect‑class Low‑importance

	This redirect is within the scope of WikiProject Robotics, a collaborative effort to improve the coverage of Robotics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.RoboticsWikipedia:WikiProject RoboticsTemplate:WikiProject RoboticsRobotics
Redirect	This redirect does not require a rating on Wikipedia's content assessment scale.
Low	This redirect has been rated as Low-importance on the project's importance scale.
	This redirect has been marked as needing immediate attention.

Linguistics: Applied Linguistics Redirect‑class

	Linguistics portal This redirect is within the scope of WikiProject Linguistics, a collaborative effort to improve the coverage of linguistics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.LinguisticsWikipedia:WikiProject LinguisticsTemplate:WikiProject LinguisticsLinguistics
Redirect	This redirect does not require a rating on Wikipedia's content assessment scale.
	This redirect is supported by Applied Linguistics Task Force.
	This redirect has been automatically rated by a bot or other tool because one or more other projects use this class. Please ensure the assessment is correct before removing the `\|auto=` parameter.

Attention needed

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)[reply]

The algorithm itself

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...