What metric best captures the anagram potential of a given set of letters in a given language? One way to solve this problem I can think of is to enumerate, at least partially, the anagrams that can be formed. Then you can come up with a density : nb_of_valid_anagrams / nb_explored_permutations. Why not. But I bet there are more insightful techniques.