Strachey love letter algorithm

Last updated

In 1952, Christopher Strachey wrote a combinatory algorithm for the Manchester Mark 1 computer which could create love letters. The poems it generated have been seen as the first work of electronic literature [1] and a queer critique of heteronormative expressions of love. [2] [3] [4]

Contents

History

Alan Turing's biographer Andrew Hodges dates the creation of the love letter generator, also known as M.U.C., to the summer of 1952, when Strachey was working with Turing, although Gaboury dates its creation to 1953. [2] Hodges writes that while many of their colleagues thought M.U.C. silly, “it greatly amused Alan and Christopher Strachey – whose love lives, as it happened, were rather similar too”. [5] Strachey was known to be gay. [2]

Although this appears to be the first work of computer-generated literature, the structure is similar to the nineteenth-century parlour game Consequences, and the early twentieth-century surrealist game exquisite corpse. The Mad Libs books were conceived around the same time as Strachey wrote the love letter generator. [3]

It was also preceded by John Clark's Latin Verse Machine (1830-1843), the first automated text generator.

Output

In a 1954 paper, Strachey gave one of just a few extant examples of the kinds of love letter the program would generate:

Darling Sweetheart,

You are my avid fellow feeling. My affection curiously clings to your passionate wish. My liking yearns for your heart. You are my wistful sympathy: my tender liking.

Yours beautifully

M. U. C.

The original program is lost, but was reimplemented by Nick Montfort in 2014. [6] In an article on the love letter generator in the New Yorker the structure of each letter is described thus: "you are my [adjective] [noun]. my [adjective] [noun] [adverb] [verbs] your [adjective] [noun]." [7]

The algorithm

Rather than modeling writing as a creative process, the love letter algorithm represents the writing of love letters as formulaic and without creativity. [8] The algorithm has the following structure:

  1. Print two words taken from a list of salutations
  2. Do the following 5 times:
    1. Choose one of two sentence structures depending on a random value Rand
    2. Fill the sentence structure from lists of adjectives, adverbs, substantives, and verbs.
  3. Print the letter's closing [9]

The lists of words were compiled by Strachey from a Roget's Thesaurus. [10] Although the list of words included several variations on the word love, none of these variations made it into any of the widely circulated letters generated by Strachey's procedure. [2]

Reception

Strachey wrote about his interest in how “a rather simple trick” can produce an illusion that the computer is thinking, and that “these tricks can lead to quite unexpected and interesting results”. [11]

Jacob Gaboury argues that the love letter generator exposes the impersonality of love, showing that "the false veneer lying at the heart of that most deeply human emotion is pure camp: an exultant love of the artificial". [4]

Related Research Articles

<span class="mw-page-title-main">Turing machine</span> Computation model defining an abstract machine

A Turing machine is a mathematical model of computation describing an abstract machine that manipulates symbols on a strip of tape according to a table of rules. Despite the model's simplicity, it is capable of implementing any computer algorithm.

In computability theory, a system of data-manipulation rules is said to be Turing-complete or computationally universal if it can be used to simulate any Turing machine. This means that this system is able to recognize or decide other data-manipulation rule sets. Turing completeness is used as a way to express the power of such a data-manipulation rule set. Virtually all programming languages today are Turing-complete.

English grammar is the set of structural rules of the English language. This includes the structure of words, phrases, clauses, sentences, and whole texts.

Hypercomputation or super-Turing computation is a set of hypothetical models of computation that can provide outputs that are not Turing-computable. For example, a machine that could solve the halting problem would be a hypercomputer; so too would one that could correctly evaluate every statement in Peano arithmetic.

Consequences is an old parlour game in a similar vein to the Surrealist game exquisite corpse and Mad Libs.

A randomized algorithm is an algorithm that employs a degree of randomness as part of its logic or procedure. The algorithm typically uses uniformly random bits as an auxiliary input to guide its behavior, in the hope of achieving good performance in the "average case" over all possible choices of random determined by the random bits; thus either the running time, or the output are random variables.

A word salad is a "confused or unintelligible mixture of seemingly random words and phrases", most often used to describe a symptom of a neurological or mental disorder. The name schizophasia is used in particular to describe the confused language that may be evident in schizophrenia. The words may or may not be grammatically correct, but they are semantically confused to the point that the listener cannot extract any meaning from them. The term is often used in psychiatry as well as in theoretical linguistics to describe a type of grammatical acceptability judgement by native speakers, and in computer programming to describe textual randomization.

In corpus linguistics, part-of-speech tagging, also called grammatical tagging is the process of marking up a word in a text (corpus) as corresponding to a particular part of speech, based on both its definition and its context. A simplified form of this is commonly taught to school-age children, in the identification of words as nouns, verbs, adjectives, adverbs, etc.

<span class="mw-page-title-main">Christopher Strachey</span> British computer scientist (1916–1975)

Christopher S. Strachey was a British computer scientist. He was one of the founders of denotational semantics, and a pioneer in programming language design and computer time-sharing. He has also been credited as possibly being the first developer of a video game. He was a member of the Strachey family, prominent in government, arts, administration, and academia.

Arcaicam Esperantom, is an auxiliary sociolect for translating literature into Esperanto created to act as a fictional 'Old Esperanto', in the vein of languages such as Middle English or the use of Latin citations in modern texts.

Dissociated press is a parody generator. The generated text is based on another text using the Markov chain technique. The name is a play on "Associated Press" and the psychological term dissociation.

Babm is an international auxiliary language created by the Japanese philosopher Rikichi [Fuishiki] Okamoto (1885–1963). Okamoto first published the language in his 1962 book, The Simplest Universal Auxiliary Language Babm, but the language has not caught on even within the constructed language community, and does not have any known current speakers. The language uses the Latin script as a syllabary, and possesses no articles or auxiliary verbs. Each letter marks an entire syllable rather than a single phoneme. Babm follows a sound-based rule set, which Okamoto outlines in his book. He states "Nouns are coined from three consonants and one vowel, verbs from one or two vowels between two consonants at the beginning and at the end. Adjectives, adverbs, pronouns, numerals, and propositions have respectively their own peculiar form."

Algorithmic information theory (AIT) is a branch of theoretical computer science that concerns itself with the relationship between computation and information of computably generated objects (as opposed to stochastically generated), such as strings or any other data structure. In other words, it is shown within algorithmic information theory that computational incompressibility "mimics" (except for a constant that only depends on the chosen universal programming language) the relations or inequalities found in information theory. According to Gregory Chaitin, it is "the result of putting Shannon's information theory and Turing's computability theory into a cocktail shaker and shaking vigorously."

Comparison is a feature in the morphology or syntax of some languages whereby adjectives and adverbs are rendered in an inflected or periphrastic way to indicate a comparative degree, property, quality, or quantity of a corresponding word, phrase, or clause. A superlative construction expresses the greatest quality, quantity, or degree relative to all other comparators.

Computational humor is a branch of computational linguistics and artificial intelligence which uses computers in humor research. It is a relatively new area, with the first dedicated conference organized in 1996.

<span class="mw-page-title-main">Computational creativity</span> Multidisciplinary endeavour

Computational creativity is a multidisciplinary endeavour that is located at the intersection of the fields of artificial intelligence, cognitive psychology, philosophy, and the arts.

In computability theory, the halting problem is the problem of determining, from a description of an arbitrary computer program and an input, whether the program will finish running, or continue to run forever. The halting problem is undecidable, meaning that no general algorithm exists that solves the halting problem for all possible program–input pairs.

The Automatic Complaint-Letter Generator is a website that automatically generates complaint letters. The website was created by Scott Pakin in 1994.

A story generator or plot generator is a tool that generates basic narratives or plot ideas. The generator could be in the form of a computer program, a chart with multiple columns, a book composed of panels that flip independently of one another, or a set of several adjacent reels that spin independently of one another, allowing a user to select elements of a narrative plot. The tool may allow the user to select elements for the narrative, or it may combine them randomly, a specific variation known as a random plot generator. Such tools can be created for virtually any genre, although they tend to produce formulaic and hackneyed situations.

Generative literature is poetry or fiction that is automatically generated, often using computers. It is a genre of electronic literature, and also related to generative art.

References

  1. ↑ Wardrip-Fruin, Noah (1 August 2005). "Christopher Strachey: The first digital artist?". Grand Text Auto. School of Engineering, University of California Santa Cruz. Retrieved 19 August 2016.
  2. 1 2 3 4 Gaboury, Jacob (9 April 2013). "[Christopher Strachey]". A Queer History of Computing. Rhizome. Retrieved 19 August 2016.
  3. 1 2 Rettberg, Jill Walker (2022). "Speculative Interfaces: How Electronic Literature Uses the Interface to Make Us Think about Technology". Electronic Book Review. doi:10.7273/1xsg-nv26.
  4. 1 2 Gaboury, Jacob (2022). "Queer Affects at the Origins of Computation". JCMS: Journal of Cinema and Media Studies. 61 (4): 169–174. doi:10.1353/cj.2022.0053. ISSN   2578-4919. S2CID   251241028.
  5. ↑ Hodges, Andrew (2012). Alan Turing: The Enigma. London: Random House. p. 478.
  6. ↑ Strachey, Christopher (1952). "Love Letters". Code re-implemented by Nick Montfort in 2014.
  7. ↑ Roberts, Siobhan (2017-02-14). "Christopher Strachey's Nineteen-Fifties Love Machine". The New Yorker. Retrieved 2023-02-05.
  8. ↑ Montfort, Nick; Fedorova, Natalia (2012). Small-Scale Systems and Computational Creativity (PDF). International Conference on Computational Creativity.
  9. ↑ Link, David. "There Must Be an Angel: On the Beginnings of the Arithmetics of Rays" (PDF). p. 19. Retrieved 19 August 2016.
  10. ↑ Sample, Mark (2013). An Account of Randomness in Literary Computing. Modern Language Association Conference. Retrieved 19 August 2016.
  11. ↑ Strachey, Christopher (1954). "The "Thinking" Machine". Encounter. p. 27.
This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.