Write out a program that acts as a simplified eliza using


write out a program that acts as a simplified Eliza using prolog but I can't even figure out where to start. Here are the steps I have to follow. 1. accept a sentence that is typed in by the user as a list, 2. change each 'you' in the sentence to 'i', 3. change each 'i' in the original sentence to 'why do you', 4. change each 'are' to 'am not', 5. change each 'do' to 'no, ' (change to no with a comma and a space after the word), 6. change ‘portuguese' to ‘russian', 7. write out the changed sentence as a response to the user, note that the response should not be a list but words separated by spaces (hint: you probably need a separate recursive output predicate instead of writing the list straight to the terminal). Also I'm using swi-prolog.

Request for Solution File

Ask an Expert for Answer!!
Computer Engineering: Write out a program that acts as a simplified eliza using
Reference No:- TGS0661837

Expected delivery within 24 Hours