Autogram

An autogram (Greek: αὐτός = self, γράμμα = letter) is a sentence that describes itself in the sense of providing an inventory of its own characters. They were invented by Lee Sallows, who also coined the word autogram.[1] An essential feature is the use of full cardinal number names such as "one", "two", etc., in recording character counts. Autograms are also called 'self-enumerating' or 'self-documenting' sentences. Often, letter counts only are recorded while punctuation signs are ignored, as in this example:

This sentence employs two a's, two c's, two d's, twenty-eight e's, five f's, three g's, eight h's, eleven i's, three l's, two m's, thirteen n's, nine o's, two p's, five r's, twenty-five s's, twenty-three t's, six v's, ten w's, two x's, five y's, and one z.

The first autogram to be published was composed by Sallows in 1982 and appeared in Douglas Hofstadter's "Metamagical Themas" column in Scientific American.[2]

Only the fool would take trouble to verify that his sentence was composed of ten a's, three b's, four c's, four d's, forty-six e's, sixteen f's, four g's, thirteen h's, fifteen i's, two k's, nine l's, four m's, twenty-five n's, twenty-four o's, five p's, sixteen r's, forty-one s's, thirty-seven t's, ten u's, eight v's, eight w's, four x's, eleven y's, twenty-seven commas, twenty-three apostrophes, seven hyphens and, last but not least, a single !

The task of producing an autogram is perplexing because the object to be described cannot be known until its description is first complete.[3][4]

Self-enumerating pangrams

A type of autogram that has attracted special interest is the autogramic pangram, a self-enumerating sentence in which every letter of the alphabet occurs at least once.[5] Certain letters do not appear in either of the two autograms above, which are therefore not pangrams. The first ever self-enumerating pangram appeared in a Dutch newspaper and was composed by Rudy Kousbroek.[6][7][8] Sallows, who lives in the Netherlands, was challenged by Kousbroek to produce a self-enumerating 'translation' of this pangram into English—an impossible-seeming task. This prompted Sallows to construct an electronic Pangram Machine.[1] Eventually the machine succeeded, producing the example below which was published in Scientific American in October 1984:[9]

This pangram contains four as, one b, two cs, one d, thirty es, six fs, five gs, seven hs, eleven is, one j, one k, two ls, two ms, eighteen ns, fifteen os, two ps, one q, five rs, twenty-seven ss, eighteen ts, two us, seven vs, eight ws, two xs, three ys, & one z.

Sallows wondered if one could produce a pangram that counts its letters as percentages of the whole sentence–a particularly difficult task since such percentages usually won't be exact integers. He mentioned the problem to Chris Patuzzo and in late 2015 Patuzzo produced the following solution:[10][11]

This sentence is dedicated to Lee Sallows and to within one decimal place
four point five percent of the letters in this sentence are a's, zero point one percent are b's,
four point three percent are c's, zero point nine percent are d's, twenty point one percent are e's,
one point five percent are f's, zero point four percent are g's, one point five percent are h's,
six point eight percent are i's, zero point one percent are j's, zero point one percent are k's,
one point one percent are l's, zero point three percent are m's, twelve point one percent are n's,
eight point one percent are o's, seven point three percent are p's, zero point one percent are q's,
nine point nine percent are r's, five point six percent are s's, nine point nine percent are t's,
zero point seven percent are u's, one point four percent are v's, zero point seven percent are w's,
zero point five percent are x's, zero point three percent are y's and one point six percent are z's.

Generalizations

Autograms exist that exhibit extra self-descriptive features. Besides counting each letter, here the total number of letters appearing is also named:[12][13]

This sentence contains one hundred and ninety-seven letters: four a's, one b, three c's, five d's, thirty-four e's, seven f's, one g, six h's, twelve i's, three l's, twenty-six n's, ten o's, ten r's, twenty-nine s's, nineteen t's, six u's, seven v's, four w's, four x's, five y's, and one z.

Just as an autogram is a sentence that describes itself, so there exist closed chains of sentences each of which describes its predecessor in the chain. Viewed thus, an autogram is such a chain of length 1. Here follows a chain of length 2:[12][13]

The right-hand sentence contains four a's, one b, three c's, three d's, thirty-nine e's, ten f's, one g, eight h's, eight i's, one j, one k, four l's, one m, twenty-three n's, fifteen o's, one p, one q, nine r's, twenty-three s's, twenty-one t's, four u's, seven v's, six w's, two x's, five y's, and one z.
The left-hand sentence contains four a's, one b, three c's, three d's, thirty-five e's, seven f's, four g's, eleven h's, eleven i's, one j, one k, one l, one m, twenty-six n's, fifteen o's, one p, one q, ten r's, twenty-three s's, twenty-two t's, four u's, three v's, five w's, two x's, five y's, and one z.

Reflexicons

A special kind of autogram is the 'reflexicon' (short for "reflexive lexicon"), which is a self-descriptive word list that describes its own letter frequencies. The constraints on reflexicons are much tighter than on autograms because the freedom to choose alternative words such as "contains", "comprises", "employs", and so on, is lost. However, a degree of freedom still exists through appending entries to the list that are strictly superfluous.

For example, "Sixteen e's, six f's, one g, three h's, nine i's, nine n's, five o's, five r's, sixteen s's, five t's, three u's, four v's, one w, four x's" is a reflexicon, but it includes what Sallows calls "dummy text", which is only having one of some letter. Dummy text are in the form "one #", where "#" can be any typographical sign not already listed. Sallows has made an extensive computer search and conjectures that there exist only three pure (i.e., no dummy text) English reflexicons.[13]

thirteen e's, five f's, two g's, five h's, eight i's, two l's, three n's, six o's, six r's, twenty s's, twelve t's, three u's, four v's, six w's, four x's, two y's.
fifteen e's, seven f's, four g's, six h's, eight i's, four n's, five o's, six r's, eighteen s's, eight t's, four u's, three v's, two w's, three x's.
sixteen e's, five f's, three g's, six h's, nine i's, five n's, four o's, six r's, eighteen s's, eight t's, three u's, three v's, two w's, four x's.

References
  1. Sallows, L., In Quest of a Pangram, Abacus, Vol 2, No 3, Spring 1985, pp 22–40
  2. Hofstadter, D.R. "Metamagical Themas" Scientific American, January 1982, pp 12–17
  3. Hofstadter, D.R., Metamagical Themas: Questing for the Essence of Mind and Pattern, 1996, p. 390–92, Basic Books, ISBN 978-0-465-04566-2
  4. Letaw J.R. Pangrams: A Nondeterministic Approach, Abacus, Vol 2, No 3, Spring 1985, pp 42–47
  5. Encyclopedia of Science: self-enumerating sentence
  6. Kousbroek, R., "Welke Vraag Heeft Vierendertig Letters?" NRC Handelsblad, Cultureel Supplement 640, 11 Feb. 1983, p.3.
  7. Kousbroek, R. "Instructies Voor Het Demonteren Van Een Bom," NRC Handelsblad, Cultereel Supplement 644, 11 March 1983, p.9.
  8. Kousbroek, R. "De Logologische Ruimte" Amsterdam: Meulenhoff, 1984, pp 135–53.
  9. Dewdney, A.K. "Computer Recreations" Scientific American, October 1984, pp 18–22
  10. A New Pangram Futility Closet, November 16, 2015
  11. Chris Patuzzo on self-enumerating pangrams Podcast interview by Tom Stuart
  12. Self-enumerating pangrams: A logological history by Eric Wassenaar, April 17, 1999 Archived May 24, 2013, at the Wayback Machine
  13. Sallows, L., Reflexicons, Word Ways, August 1992, 25; 3: 131–41
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.