The algorithm 
The algorithm starts by printing any N consecutive words (or letters) in the text. Then at every step it searches for any random occurrence in the original text of the last N words (or letters) already printed and then prints the next word or letter.[clarification needed]
- wart: n. A small, crocky feature that sticks out of an array (C has no checks for this). This is relatively benign and easy to spot if the phrase is bent so as to be not worth paying attention to the medium in question.
Here is a short example of letter-based Dissociated Press applied to the same source:
- window sysIWYG: n. A bit was named aften /bee´t@/ prefer to use the other guy's re, especially in every cast a chuckle on neithout getting into useful informash speech makes removing a featuring a move or usage actual abstractionsidered interj. Indeed spectace logic or problem!
The dissociated press algorithm is described in HAKMEM (1972) Item #176. The name "dissociated press" is first known to have been associated with the Emacs implementation.
When he got on the table, he come in. He never come out of my own pocket as a measure of protecting the company against riot and bloodshed. And when he said. "You tell me a bus ticket, let alone write out no case histories. Then the law come back with a knife!"
See also 
- Burke, Sean M. and Avi Finkel. Games::Dissociate distribution in CPAN. Retrieved 2012-11-13. Most recent release: 2010, "v1.0".
- Raymond, Eric S. (2003-12-29). "Dissociated Press". Jargon File 4.4.7. Retrieved 2007-04-10.
- Emacs documentation on Dissociated Press
- Dissociated Press in the Jargon File
- Dissociated Press on celebrity Twitter feeds
This article is based in part on the Jargon File, which is in the public domain.