Eliza is a kind of term rewriting system; it matches sentence patterns, and generates responses, using some of the matched content.
An iterated term-rewriting system can be Turing complete.
Actually, the whole process takes place inside the rewriting system recursively.
https://sites.google.com/view/elizagen-org/about
And https://sites.google.com/view/elizagen-org/eliza-related-res...
says
> Weizenbaum, J. (1966). ELIZA: A computer program for the study of natural language communication between man and machine. Communications of the ACM, 9, 36-45.
> This paper remains under ACM copyright, and so is inaccessible, except to members or for purchase. However there are numerous versions of the PDF online
1) SLIP (Symmetric List Processor) is a collection of subroutines designed by Joseph Weizenbaum to be embedded in a higher order language
2) ELIZA is a program, also written by Joseph Weizenbaum, and a SLIP application, which reads in a set of rules, called an ELIZA-script (the best known of these scripts is the doctor/therapist script commonly associated with ELIZA), and matches any console input against these rules in order to produce a transformation as an answer. The general idea is to give the appearance of a natural language conversation program that may be operated from a terminal.
3) In order to do so, ELIZA (the program) exposes some SLIP functions to these rule sets (expressed in an ELIZA-script). Mind that these functions are quite powerful and general in nature.
4) Generally speaking, ELIZA (the program) matches words in the input stream against a list of keywords, which are associated with rules for matching certain text patterns and rearranging them into an output stream. (In other words, for the most part a usual ELIZA-script, like the doctor script, merely reflects the input in a transposed form. There are is no "understanding" involved.)
5) One of these rules in ELIZA's grammar is the "PRE" rule, which reorders and/or substitutes certain expressions in the input stream in order to feed the recomposed output into another rule.
6) By this, we can use ELIZA (the program) to decompose and recompose and reinterpret a given stream using a special set of rules, expressed in an ELIZA-script, until a terminal state is reached. (Which is the case, when the input stream as been transposed reiteratively to a terminal symbol recognized by a rule in our script.)
7) This is both surprising and not surprising at all. SLIP was written to provide general building blocks for a higher order language and ELIZA (the program) is such a language. ELIZA (especially its doctor script) was highly influential for mimicking quite successfully a natural language conversation in the mid 1960s. To do so, it directly exposed SLIP functionality to its scripts (rule sets). While not advertised by any means, it is not of great wonder that some of the generality of SLIP may be exposed by ELIZA's grammar. Notably, the "PRE" grammar was, according to Weizenbaum, introduced for economical reasons, not for extra logical functionality. However, there is more to it, as it "leaks" generality.
(There are however, some technical limitations to the generality of ELIZA: e.g., keywords, which mark and group any rules, are hashed to 7-bit integers and there may be just 128 keywords and 512 rules in total.)
(Notably, this is not the only possible approach to problem solving that may be attempted using ELIZA. E.g., the palindrome problem used in the article as an example, doesn't require multiple sets of rules to incorporate state. We could do it also by simple reduction: If the input is a single letter or exactly two instances of the same letter ["A", "B", "A A", "B B"], it's a palindrome, output this as the final answer. Else, if the first and the last letter are the same ["A … A", "B … B"], discard them and redo with the remaining middle part. If this rule fails as well, it's not a palindrome, also a final answer.)
; Palindrome test by simple reduction
; "(0)" is a catch-all pattern
; "NONE" matches, where no keyword matches
; - ideal for help phrases
(PALIN
((PALIN 0) (PRE (2) (=REDUCE)))
)
(REDUCE
((A) (=TERM_TRUE))
((B) (=TERM_TRUE))
((A A) (=TERM_TRUE))
((B B) (=TERM_TRUE))
((A 0 A) (PRE (2) (=REDUCE)))
((B 0 B) (PRE (2) (=REDUCE)))
((0) (=TERM_FALSE))
)
(TERM_TRUE
((0) (WELL, THIS IS A PALINDROME))
)
(TERM_FALSE
((0) (NOT A PALINDROME AT ALL))
)
(NONE
((0) (TRY: PALIN A B A))
) (USAGE: PALIN A B B A ...)
START
at the beginning and a MEMORY rule (must have exactly 4 entries) at the end: (MEMORY XYZZY
(0 = A)
(0 = B)
(0 = A A)
(0 = B B)
)
:-)PS: I'm not sure, if the initial welcome message is actually mandatory, but the MEMORY rule definitely is.
And the MEMORY keyword "must be an ordinary keyword as well." So you'd need a (XYZZY ...) rule.
Also, the START symbol appears in the DOCTOR script, but is never mentioned in the body of the paper.
Another thing Weizenbaum doesn't mention in his description is the final empty list in the DOCTOR script. This does seem to be expected by the code.
Other: It has been a while, since I had a closer look at ELIZA, and I have to admit that I forgot most about the intrinsics of the MEMORY rule. :-)
"Moiré logic" was a joke, meaning, an interference pattern caused by two layers of logical state.
Well, there's actually one thing, I can contribute: The famous photo of Weizenbaum on a terminal (sometimes attributed to the German magazine "Die Zeit") – e.g. here [1] – seems to show Weizenbaum on a Lorenz teletypewriter [2], so there is some probability to the photo actually having been taken in Germany.
[1] https://maeda.pm/2019/02/11/joseph-weizenbaum-humanist-techn...
[2] https://twitter.com/RetroWizzard/status/1419658098210451459 (1st image)
PS: You may find this one (my own doing) amusing: https://masswerk.at/eliza/
Then I thought it was referring to a programming language, Eliza.
Now I think it is referring to a modern programming language created to replicate the implementation of the conversation program, ELIZA.
The whole thing could have been far less confusing if:
1. The page provided more context about what ELIZA is.
2. If ELIZA is indeed a programming language (a Lisp?) inspired by the original ELIZA, it would be a good idea to give it a different name.
Anyway, it was frustrating to read this page so I have stopped.