From VistrailsWiki
Revision as of 09:09, 30 August 2008 by Llins (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search


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