Prediction by Partial Matching

Tags

text-processing

A finite context model for symbolwise text compression.

The model works by determining the probabilities of symbols in a given (finite) context. This context can be arbitrarily long depending on previously inspected contexts.

Note: PPM with a (semi-)static model can support random access.