Editing Prediction by partial matching (section)

== Sources ==
* {{Cite journal| last1 = Cleary | first1 = J.| last2 = Witten | first2 = I.| doi = 10.1109/TCOM.1984.1096090| title = Data Compression Using Adaptive Coding and Partial String Matching| journal = [[IEEE Transactions on Communications|IEEE Trans. Commun.]]| volume = 32| issue = 4| pages = 396–402| date=April 1984 | citeseerx = 10.1.1.14.4305}}
* {{Cite journal| last1 = Moffat | first1 = A.| title = Implementing the PPM data compression scheme| doi = 10.1109/26.61469| journal = [[IEEE Transactions on Communications|IEEE Trans. Commun.]]| volume = 38| issue = 11| pages = 1917–1921| date=November 1990 | citeseerx = 10.1.1.120.8728}}
* {{Cite journal| last1 = Cleary | first1 = J. G.| last2 = Teahan | first2 = W. J.| last3 = Witten | first3 = I. H.| title = Unbounded length contexts for PPM | journal = The Computer Journal | year = 1997| volume = 40 | issue = 2_and_3 | pages = 67–75 | publisher =  Oxford University Press | location = Oxford, England | language = English | url = https://academic.oup.com/comjnl/article-abstract/40/2_and_3/67/360793 | issn = 0010-4620 | doi = 10.1093/comjnl/40.2_and_3.67| url-access = subscription }}
* C. Bloom, [http://www.cbloom.com/papers/ppmz.zip Solving the problems of context modeling].
* W.J. Teahan, [http://cotty.16x16.com/compress/peppm.htm Probability estimation for PPM], [https://web.archive.org/web/20010605194536/http://www.cs.waikato.ac.nz/~wjt/papers/NZCSRSC.ps.gz Original Source from archive.org].
* {{Cite journal| last1 = Schürmann | first1 = T.| last2 = Grassberger | first2 = P.| doi = 10.1063/1.166191| title = Entropy estimation of symbol sequences| journal = Chaos| volume = 6| pmid = 12780271| issue = 3| pages = 414–427| date=September 1996 | arxiv = cond-mat/0203436| bibcode = 1996Chaos...6..414S| s2cid = 10090433}}