Catogorising strings into random versus non-random

[Ian Kelly]

On Mon, Dec 21, 2015 at 9:40 AM, duncan smith <duncan at invalid.invalid> wrote:
> Finite state machine / transition matrix. Learn from some English text
> source. Then process your strings by lower casing, replacing underscores
> with spaces, removing trailing numeric characters etc. Base your score
> on something like the mean transition probability. I'd expect to see two
> pretty well separated groups of scores.

Sounds like a case for a Hidden Markov Model.