# Shuffled substrings

We want to investigate the relationship between entropy, regularity and memorability of a string.
To do so, we sample a set of tokens, and then create a string from it by appending different perturbations of the set to each other.
Each perturbed substring has the same tokens, hence the entire string has the same overall entropy, but by sampling more or less unique perturbations and by repeating them more or less often to create strings with the same length we can create strings with the same entropy, but different degrees of regularity.
Then we can investigate whether memorization speed is primarily a function of entropy or of string regularity.
