Update Seminar Form
Presentation of Weizenbaum's paper on "ELIZA -- A Computer Program For the Study of Natural Language Communication Between Man and Machine" to the class.
How Eliza works:
User gives input statement S.
S is examined for key words (key words are ranked).
S is transformed according to rules associated with keywords.
Transformation rules are also specified for content-free statements.
Transformed S is output by Eliza.
Identify the "most important" key word in S.
Identify the context of key word, e.g. if "YOU" is followed by "ARE" then the context is that an assertion is being made.
Choice of transformation rule.
Making Eliza respond "intelligently" when no key word is found.
Editing, extension of Eliza program (we call this "Educating Eliza").
Example of Transformation:
Input S="IT SEEMS THAT YOU HATE ME"
IT SEEMS THAT
Identification of key words: 2, 4. Nothing else is understood by Eliza.
Decomposition rule: __ YOU __ ME
Reassembly rule: Change YOU to I and ME to YOU. Replace the first blank by the stock phrase "WHAT MAKES YOU THINK", replace the second blank by 3:
WHAT MAKES YOU THINK
Output S'="WHAT MAKES YOU THINK I HATE YOU".
Transformation Tree Diagram:
Prof. Ashay Dharwadker