Difference between revisions of "User:Lauro"

From VistrailsWiki
Jump to navigation Jump to search
m (New page: == Problems == === Most probable permutation=== Let <math>\Sigma</math> text( be a finite set of ''letters'' and let ) <math>W = \{w_1, w_2, ... w_n\}</math> be a set of ''words'' <math>w...)
 
m
 
(One intermediate revision by the same user not shown)
Line 2: Line 2:
=== Most probable permutation===
=== Most probable permutation===


Let <math>\Sigma</math> text( be a finite set of ''letters''
Let <math>\Sigma</math> be a finite set of ''letters''
and let ) <math>W = \{w_1, w_2, ... w_n\}</math> be a set of
and let <math>W = \{w_1, w_2, ... w_n\}</math> be a set of
''words'' <math>w_i = \sigma_1 \sigma_2 ... \sigma_{k_i}.</math>
''words'' <math>w_i = \sigma_1 \sigma_2 ... \sigma_{k_i}.</math>



Latest revision as of 09:09, 30 August 2008

Problems

Most probable permutation

Let <math>\Sigma</math> be a finite set of letters and let <math>W = \{w_1, w_2, ... w_n\}</math> be a set of words <math>w_i = \sigma_1 \sigma_2 ... \sigma_{k_i}.</math>

The proposed question is:

Given a bag of letters from <math>\Sigma</math>, output a permutation of these letters or simply a word with these letters that is most probable of having been generated by the same rules that generated the words in <math>W</math>.