# Difference between revisions of "User:Lauro"

Let $\Sigma$ be a finite set of letters and let $W = \{w_1, w_2, ... w_n\}$ be a set of words $w_i = \sigma_1 \sigma_2 ... \sigma_{k_i}.$
Given a bag of letters from $\Sigma$, 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 $W$.