4 ms·

At first, I thought it was referring to the conversation program, Eliza. Then I thought it was referring to a programming language, Eliza. Now I think it is r

At first, I thought it was referring to the conversation program, 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.

kazinator 4y ago
I believe the article refers to the conversation program Eliza, but whose classic pattern-response database is replaced with different content. Plus there must be some feedback to close the loop; i.e. Eliza's output must be fed back to it as input. 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.
- abrax3141 4y ago
  > Plus there must be some feedback to close the loop; > i.e. Eliza's output must be fed back to it as input. Actually, the whole process takes place inside the rewriting system recursively.
lupire 4y ago
The page says " ELIZA script, conforming to the specification given by Joseph Weizenbaum in his famous 1966 CACM paper". https://sites.google.com/view/elizagen-org/about https://sites.google.com/view/elizagen-org/about And https://sites.google.com/view/elizagen-org/eliza-related-resources 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
- abrax3141 4y ago
  It looks like ACM has open-accessed this paper.
masswerk 4y ago
Well, this is quite a set of Russian dolls: 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 has 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, by not only allowing us to recompose an input, but also allowing us to feed this output into another, specified rule, where it will be interpreted anew. This can be used to encode state and to repetitively interpret a stream with respect to this state until a terminal state (as the answer to a problem) is eventually reached. (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.)
deleted 4y ago
[deleted]

kazinator 4y ago

I believe the article refers to the conversation program Eliza, but whose classic pattern-response database is replaced with different content. Plus there must be some feedback to close the loop; i.e. Eliza's output must be fed back to it as input. 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.

abrax3141 4y ago
> Plus there must be some feedback to close the loop; > i.e. Eliza's output must be fed back to it as input. Actually, the whole process takes place inside the rewriting system recursively.

lupire 4y ago

The page says " ELIZA script, conforming to the specification given by Joseph Weizenbaum in his famous 1966 CACM paper". https://sites.google.com/view/elizagen-org/about https://sites.google.com/view/elizagen-org/about And https://sites.google.com/view/elizagen-org/eliza-related-resources 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

abrax3141 4y ago
It looks like ACM has open-accessed this paper.

masswerk 4y ago

Well, this is quite a set of Russian dolls: 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 has 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, by not only allowing us to recompose an input, but also allowing us to feed this output into another, specified rule, where it will be interpreted anew. This can be used to encode state and to repetitively interpret a stream with respect to this state until a terminal state (as the answer to a problem) is eventually reached. (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.)

deleted 4y ago

[deleted]