ELIZA—a computer program for the study of natural language communication between man and machine

Probably not a substantial claim: may not pass S3 (load-bearing).

The largest dictionary so far attempted contains about 50 keywords.

“The largest dictionary so far attempted contains about 50 keywords.”

Probably not a substantial claim: may not pass S3 (load-bearing).

ELIZA scripts exist (at this writing) in Welsh and German as well as in English.

“ELIZA scripts exist (at, this writing) in Welsh attd Gernmn as well as in English.”

Probably not a substantial claim: may not pass S3 (load-bearing).

The set of transformation rules can be guaranteed to terminate with a decomposition rule which must match.

“Of course, lhe set of transformation rules can be guaranteed to terminate with a decomposition rule which nmst match.”

Probably not a substantial claim: may not pass S3 (load-bearing). May combine two claims.

The decomposition rule (0 K 0) will match any text in which the word K appears while (0) will match any text whatever.

“The decomposition rule (o K o) will match any text in which tile word K appears while (0) will match any text whaiever.”

Classified as probably not a substantial claim.

Input sentences are analyzed on the basis of decomposition rules triggered by key words appearing in the input text.

“Input sentences are analyzed on the basis of decomposition rules which are triggered by key words appearing in the input text.”

Probably not a substantial claim: may not pass S3 (load-bearing).

The transformation rules that cause the input "Everybody hates me" to be transformed to "Can you think of anyone in particular," and other such rules, are based on quite specific hypotheses about the world.

“For e>:ample, the tran>formation rules which cause ihc input Everybody hates me to be transformed to Can you think of anyone in particular and other such are based on quite specific hypotheses about the world.”

Probably not a substantial claim: may not pass S3 (load-bearing). May combine two claims.

The current version of ELIZA requires that one keyword be associated with MEMORY and that exactly four transformations accompany that word in that context.

“The eurrent version of E L I Z A requires that one keyword be associated with M E M O R Y and that exactly four transformations aceoinpany that word in that context.”

Probably not a substantial claim: may not pass S3 (load-bearing).

Whenever 'MY' is the highest ranking keyword of a text, one of the transformations on the MEMORY list is randomly selected, and a copy of the text is transformed accordingly.

“Whenever it is the highest ranking keyword of a text one of the transformations on the M E M O R Y list is randomly selected, and a copy of the text is transformed accordingly.”

Classified as probably not a substantial claim. May combine two claims.

The system selects a decomposition rule for the highest ranking keyword found in an input text, attempts to match that text according to that decomposition rule and, failing to make a match, selects the next reassembly rule associated with the matching decomposition rule and applies it to generate an output text.

“The system described so far is ess(qltially one which selects ~t decomposition rule for the highest ranking keyword found in an input text, attempts to match that text according to that decomposition rule and, failing to make a match, selects the next reassembly rule associated with the matching decomposition rule and applies it.to generate an output texi.”

Probably not a substantial claim: may not pass S3 (load-bearing).

The mechanism makes it possible to test on key phrases as opposed to single key words.

“This mechanism makes it possible to, in effect, test on key phrases as opposed to single key words.”

Probably not a substantial claim: may not pass S3 (load-bearing).

No list named in any of the words of the KEY vector contains more than two key list structures.

“No list named in any of the words of the KEY vector contains more than two key list structures.”

Probably not a substantial claim: may not pass S3 (load-bearing). May combine two claims.

The given language for ELIZA is English, and the other language, expressions of which are generated, is also English.

“The “given language” is English as is the “other language”, expressions of which arc generated.”

Probably not a substantial claim: may not pass S3 (load-bearing).

When a text without keywords is encountered later and a certain counting mechanism is in a particular state and the stack in question is not empty, then the transformed text is printed out as the reply.

“When a text without keywords is encountered later and a certain counting mechanism is in a particular state and the stack in question is not empty, then the transformed text is printed out as the reply•”

Probably not a substantial claim: may not pass S2 (checkable), S3 (load-bearing).

The script that has formed the basis for most of this discussion has an overwhelmingly psychological orientation.

“The script that has formed the basis for most of this discussion happens to be one with an overwhehningly psychological orientation.”

Probably not a substantial claim: may not pass S3 (load-bearing).

The idea that the present ELIZA script contains no information about the real world is not entirely true.

“~.~: idea ihat the presettt ELIZA s{:rk)t contains no infocmation about tl~e real world i:s ,tot.e~tirely true.”

Classified as probably not a substantial claim.

An important property of ELIZA is that a script is data; i.e., it is not part of the program itself.

“An important property of ELIZA is that a script is data; i.e., it is not part of the program itself.”

Probably not a substantial claim: may not pass S3 (load-bearing), S4 (based).

Some subjects have been very hard to convince that ELIZA, with its present script, is not human.

“Seine subjects'have been very hm'd to convince t h a t E L I Z A (with its present script) is not hunmn.”

Probably not a substantial claim: may not pass S3 (load-bearing).

Changes, additions and deletions of an ELIZA script may be made with considerable efficiency and on the basis of entirely contextual cues, without line numbers or other artificial devices.

“Suftice it to say that changes, additions and deletions of the script may be made with considerable efficiency and on the basis of entirely contextual cues, i.e., without resort to line numbers or any other artificial devices.”

Probably not a substantial claim: may not pass S3 (load-bearing).

There is another mechanism which causes the system to respond more spectacularly in the absence of a key.

“There is, however, another mechanism which causes the s y s t e m to respond more spectacularly in the absence of a key.”

Classified as probably not a substantial claim.

Responses are generated by reassembly rules associated with selected decomposition rules.

“Responses are generated by reassembly rules associated with selected decomposition rules.”

Probably not a substantial claim: may not pass S3 (load-bearing).

The mechanism ensures that the complete set of reassembly rules associated with a given decomposition rule is cycled through before any repetitions occur.

“Tl, Js mechanism h~st,res that the complete set of reassernbly rules ~ssoeiated with a given deeomposh:ion rule is cycled through before any repetitions 0CCUY,”

Probably not a substantial claim: may not pass S3 (load-bearing). May combine two claims.

The input text 'Am I sick' would elicit either 'Do you believe you are sick' or 'Why do you ask' depending on how many times the general form had already occurred.

“Then, the input text Am I siek would elicit either ])o you believe you are siek or Why do yotl ask i depending on how many tinles the general form had already occurred.”

Probably not a substantial claim: may not pass S3 (load-bearing), S4 (based).

At this writing, the only serious ELIZA scripts that exist are ones that cause ELIZA to respond roughly as certain psychotherapists (Rogerians) would.

“At this writing, the only serious ELIZA scripts whieh exist are seine which cause E L I Z A to respond roughly as would certain psychotherapists (Rogerians).”

May combine two claims.

ELIZA is not restricted to a particular set of recognition patterns or responses, nor even to any specific language.

“Hence, E L I Z A is not restricted to a particular set of recognition patterns or responses, indeed not even to any specific language.”

Probably not a substantial claim: may not pass S2 (checkable), S3 (load-bearing).

A large part of whatever elegance may be credited to ELIZA lies in the fact that ELIZA maintains the illusion of understanding with so little machinery.

“A large part of whatever elegance may be credited to ELIZA lies in the fact that ELIZA maintains the illusion of understanding with so little machinery.”

Probably not a substantial claim: may not pass S3 (load-bearing), S4 (based). May combine two claims.

Seen in the coldest possible light, ELIZA is a translating processor in Gorn's sense, but one especially constructed to work well with natural language text.

“Seen in the coldest possible light, ELIZA is a translating processor in Gorn's sense; however, it is one which has been especially constructed to work well with natural language text.”

Probably not a substantial claim: may not pass S2 (checkable), S3 (load-bearing).

Gorn's words fit ELIZA well.

“It is striking to note how well his words/fit ELIZA.”

Probably not a substantial claim: may not pass S3 (load-bearing). May combine two claims.

In principle, the given language could be the English of algebra word problems and the other language a machine code allowing a particular computer to solve the stated problems.

“In principle, the given hmguage could as well be the kind of English in which “word problems” in algebr~L am given to high school students and the other language, a machine code allowing a particular computer to “solve” the stated problems.(See Bobrow's program S T U D E N T [3].)”

• cites [3] 3. Bom¢ow, D.G. Natural language input for a computer prob- lem solving system. Doctoral thesis, Math. Dept., MIT. Cambridge, Mass., 1964.Not checked yet

  Not checked in the free run.

Probably not a substantial claim: may not pass S4 (based).

For a computer program to draw valid conclusions from what it is told, it must at least have the capacity to store selected parts of its inputs.

“In order for a computer program to be able to do that, it must at least have the capacity to store 8elected parts of its inputs.”

• AssumptionRests on an assumption: The crucial test of understanding is not the ability to continue a conversation but to draw valid conclusions from what one is being told.

Probably not a substantial claim: may not pass S2 (checkable), S3 (load-bearing).

The whole ELIZA script constitutes, in a loose way, a model of certain aspects of the world.

“The whole script constitutes, in a loose way, a model of certain aspects of the world.”

Probably not a substantial claim: may not pass S2 (checkable).

The problem of drawing valid conclusions is more than one of storage; a great part of it is subsumed under the word "selected."

“Of course, the problem is more than one of storage.A great part of it is, in fact, subsumed under the word “selected” used just, above.”

Probably not a substantial claim: may not pass S3 (load-bearing).

A translating processor, even if it operates only syntactically, generates corresponding expressions of another language to which meanings can be attributed.

“Given a language which already possesses semantic content, then a translating processor, even if it operates only syntactically, generates correspondittg expressions of another language to which we can attritmte as “meanings” (possibly multiple--the translator may not be one to one) the “semantic intents” of the generating source expressions; whether we find the result consistent or useful.or both”

• cites [2] 2. Goax, S. Semiotic relationships in ambiguously stratified bmguage systems. Paper presented at Int. Colloq. Algebraic Linguistics and Automatic Theory, Hebrew U. of Jerusalem, Aug. 1964.Not checked yet

  Not checked in the free run.

Probably not a substantial claim: may not pass S3 (load-bearing).

The ELIZA program itself is merely a translating processor in the technical programming sense.

“It is useful to remember that the ELIZA program itself is merely a translating processor in the technical programming sense.”

Probably not a substantial claim: may not pass S2 (checkable). May combine two claims.

ELIZA shows how easy it is to create and maintain the illusion of understanding, and perhaps of judgment.

“E L I Z A shows, if nothing else, how easy it is to create and nmiutain the illusion of understanding, hence perhaps of j u d g m e n t”

• AssumptionRests on an assumption: The human speaker contributes much to clothe ELIZA's responses in plausibility.

Classified as probably not a substantial claim.

To encourage its conversational partner to offer inputs from which it can select remedial information, ELIZA must reveal its misunderstanding.

“But to encourage its conversational partner to offer inputs from which it can select remedial information, it, must ret, eal its mistmderstanding.”

Probably not a substantial claim: may not pass S3 (load-bearing).

A given ELIZA script need not start out as a large, full-blown scenario.

“An important consequence of the editing facility built into ELIZA is that a given ELIZA script need not start out to be a large, full-blown scenario.”