ELIZA in POP and some mention of PARRY too.

[ambiamber]

Intro to POP: https://en.wikipedia.org/wiki/POP-2

This tar file: http://ftp.math.utah.edu/pub/mirrors/minnie.tuhs.org/UA_Distributions/UNSW/92/92.tar.gz

Contains:

;;;     / p o p / u s r / l i b / e l i z a . p
;;;     Sussex Mini ELIZA programme
;;;     Written by Steven Hardy 18th October 1976
;;;     modified by Aaron Sloman 17 May 1978
;;; the function changeperson is now called before any tests are carried out,
;;; so that you always refers to the user, I to the computer, etc.,
;;; in the transformed sentence, which is then analysed by other procedures
;;; trying to react to it.
;;; The variable "sentence" is local to the function "Eliza", and used non-
;;; locally by other procedures. Thus, general purpose matching procedures
;;; can be defined which simply take a pattern as argument. Examples are
;;; the procedures:  itmatches, itcontains, ithasoneof, itslikeoneof,
;;;     and itsaquestion,
;;; which are used by lots of other procedures to test the current sentence.
[...and so on...]

Plus documentation:

$ nroff -t usr/lib/tmac.t ./demos/elizarules 2>/dev/null | head -n 30



                            EXTENDING ELIZA
                            ===============

You can run the ELIZA program by typing
        : LIB ELIZA;
The program will then be compiled (which takes quite a long time), after
which it will print out:
        PLEASE TYPE
                ELIZA
You should then type
        : ELIZA
to get the program going.

Eliza will go on until you type CTRL‐D, or  CTRL‐X,  or  one  of  "BYE",
"GOODBYE".

Eliza  contains  a  set of rules for responding to the sentence you type
in.  If you want to extend the program, by giving it  new  rules,  first
type
        : BYE
which will cause SETPOP to be executed, so that you are then again talk‐
ing to POP11, and can define functions, give commands, etc.

You can then define new rules.  Here is an example of one of the rules:
        : NEWRULE BECAUSE;
        :       IF      ITCONTAINS([BECAUSE])
        :       THEN    [IS THAT THE REAL REASON?]

One of the documents in that tar file is also available published: https://doi.org/10.1016/0004-3702(77)90028-5
Conversational language comprehension using integrated pattern-matching and parsing
Roger C. Parkinson, Kenneth Mark Colby, William S.Faught
Artificial Intelligence Volume 9, Issue 2, October 1977, Pages 111-134

It concerns PARRY and contains a sample interview.

Newer version are here: https://www.cs.bham.ac.uk/research/projects/poplog/lib/