G'day.

Quoting Andrew Coppin <[EMAIL PROTECTED]>:

Right. So a "Markov chain" is actually a technical way of describing
something that's intuitively pretty obvious? (E.g., PPM compression
works by assuming that the input data is some sort of Markov chain with
as-yet unknown transition probabilities.)

Yes.  In fact, DMC compression (which has been proven to be the same thing
as PPM up to isomorphism) explicitly uses a Markov model.

If you're curious, I recently put some code for building dynamic Markov
models here.  It's not pretty, but you might find it useful:

    http://andrew.bromage.org/darcs/dynamicmarkov/

Cheers,
Andrew Bromage
_______________________________________________
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe

Reply via email to