Autogram: Difference between revisions
imported>Citation bot Added date. | Use this bot. Report bugs. | Suggested by Abductive | Category:Self-reference | #UCB_Category 18/26 |
imported>JJMC89 bot III |
||
| Line 11: | Line 11: | ||
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 !}} | 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 | The task of constructing an autogram is perplexing because the object to be described cannot be known until its description is first complete.<ref>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}}</ref><ref>Letaw J.R. Pangrams: A Nondeterministic Approach, ''Abacus'', Vol 2, No 3, Spring 1985, pp 42–47</ref> | ||
==Self-enumerating pangrams== | ==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.<ref>[ | 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.<ref>[https://www.daviddarling.info/encyclopedia/S/self-enumerating_sentence.html Encyclopedia of Science: self-enumerating sentence]</ref> 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]].<ref>Kousbroek, R., "Welke Vraag Heeft Vierendertig Letters?" NRC Handelsblad, Cultureel Supplement 640, 11 Feb. 1983, p.3.</ref><ref>Kousbroek, R. "Instructies Voor Het Demonteren Van Een Bom," NRC Handelsblad, Cultereel Supplement 644, 11 March 1983, p.9.</ref><ref>Kousbroek, R. "De Logologische Ruimte" Amsterdam: Meulenhoff, 1984, pp 135–53.</ref> 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.<ref name=quest>[https://www.leesallows.com/files/In%20Quest%20of%20a%20Pangram1.pdf Sallows, L., In Quest of a Pangram, Abacus, Vol 2, No 3, Spring 1985, pp 22–40]</ref> Eventually the machine succeeded, producing the example below which was published in Scientific American in October 1984:<ref>Dewdney, A.K. "Computer Recreations" Scientific American, October 1984, pp 18–22</ref> | ||
{{quotation| | {{quotation| | ||
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.}} | 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:<ref>[ | 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:<ref>[https://www.futilitycloset.com/2015/11/16/a-new-pangram/ A New Pangram] [[Futility Closet]], November 16, 2015</ref><ref>[https://whyarecomputers.com/4 Chris Patuzzo on self-enumerating pangrams] Podcast interview by Tom Stuart</ref> | ||
{{quotation| | {{quotation| | ||
| Line 108: | Line 108: | ||
==External links== | ==External links== | ||
* [ | * [https://autograms.net Autograms in various languages] | ||
[[Category:Self-reference]] | [[Category:Self-reference]] | ||
[[Category: | [[Category:Wordplay]] | ||
[[Category:Constrained writing]] | [[Category:Constrained writing]] | ||
Latest revision as of 05:48, 28 December 2025
Template:Short description Script error: No such module "For". An autogram (Template:Langx = self, Script error: No such module "Lang". = 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:
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]
The task of constructing 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]
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]
Later in 2017, Matthias Belz decided to push the boundaries further by making a pangrammatic autogram with a precision of five decimal places:[12]
However, no matter the precision of the rounding, the percentage of the letters used are still not exact. Therefore, in that same year Matthias Belz went on to create an pangrammatic autogram that uses exact percentages instead of rounded values:[12]
A shorter exact percentage autogram can be formed if the pangrammatic property is elided:[12]
Generalizations
Autograms exist that exhibit extra self-descriptive features. Besides counting each letter, here the total number of letters appearing is also named:[13][14]
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:[13][14]
|
|
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.[14]
<templatestyles src="Template:Quote_box/styles.css" />
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.
Script error: No such module "Check for unknown parameters". <templatestyles src="Template:Quote_box/styles.css" />
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.
Script error: No such module "Check for unknown parameters". <templatestyles src="Template:Quote_box/styles.css" />
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.
Script error: No such module "Check for unknown parameters".
Other variants
There are many different variants to autograms. One such variant is by representing the letter frequencies using Roman numerals:[15]
The frequency count can also be replaced with the decimal form rather than its corresponding English numeral form:[16]
See also
References
<templatestyles src="Reflist/styles.css" />
- ↑ a b Sallows, L., In Quest of a Pangram, Abacus, Vol 2, No 3, Spring 1985, pp 22–40
- ↑ Hofstadter, D.R. "Metamagical Themas" Scientific American, January 1982, pp 12–17
- ↑ Hofstadter, D.R., Metamagical Themas: Questing for the Essence of Mind and Pattern, 1996, p. 390–92, Basic Books, Template:ISBN
- ↑ Letaw J.R. Pangrams: A Nondeterministic Approach, Abacus, Vol 2, No 3, Spring 1985, pp 42–47
- ↑ Encyclopedia of Science: self-enumerating sentence
- ↑ Kousbroek, R., "Welke Vraag Heeft Vierendertig Letters?" NRC Handelsblad, Cultureel Supplement 640, 11 Feb. 1983, p.3.
- ↑ Kousbroek, R. "Instructies Voor Het Demonteren Van Een Bom," NRC Handelsblad, Cultereel Supplement 644, 11 March 1983, p.9.
- ↑ Kousbroek, R. "De Logologische Ruimte" Amsterdam: Meulenhoff, 1984, pp 135–53.
- ↑ Dewdney, A.K. "Computer Recreations" Scientific American, October 1984, pp 18–22
- ↑ A New Pangram Futility Closet, November 16, 2015
- ↑ Chris Patuzzo on self-enumerating pangrams Podcast interview by Tom Stuart
- ↑ a b c Script error: No such module "citation/CS1".
- ↑ a b Self-enumerating pangrams: A logological history by Eric Wassenaar, April 17, 1999 Template:Webarchive
- ↑ a b c Script error: No such module "citation/CS1".
- ↑ Script error: No such module "citation/CS1".
- ↑ Script error: No such module "citation/CS1".
Script error: No such module "Check for unknown parameters".