Eureka! I'm starting to get the algorith now. I just had a moment of clarity which I'm highlighting in the following code-block below.
"Do you remember Monad?" -like "* you remember *"
^^^ That's all I need to know to get going. ^^^
Now I need help with my input file. I can't decide whether to do a .CSV file, or hard a code a multi dimensional hash/array table, or perhaps hard code some sort of PS object.
The following JavaScript code snippet is portion of the standard Eliza input file.
# ["remember", 5, [
# ["* i remember *", [
# "Do you often think of (2) ?",
# "Does thinking of (2) bring anything else to mind ?",
# "What else do you recollect ?",
# "Why do you remember (2) just now ?",
# "What in the present situation reminds you of (2) ?",
# "What is the connection between me and (2) ?",
# "What else does (2) remind you of ?"
# ]],
# ["* do you remember *", [
# "Did you think I would forget (2) ?",
# "Why do you think I should recall (2) now ?",
# "What about (2) ?",
# "goto what",
# "You mentioned (2) ?"
# ]],
# ["* you remember *", [
# "How could I forget (2) ?",
# "What about (2) should I remember ?",
# "goto you"
# ]]
# ]]
There can be many keywords but for each keyword and its designated sorting-weight; there can be be multiple decomposition patterns and for any decomposition pattern there can be multiple reassembly patterns.
In the example above the keyword is "remember" its weight is 5, its decomposition patterns are the strings with the "*" wildcard characters in them and the reassembly patterns have the (2) numbers in them.
I need to sort the list of keywords by weight" and then find the decomposition pattern that matches the highest weighted keyword found in the human's key entered input response pattern and then randomly choose a reassembly pattern from the correct decomposition pattern.
There are a few other things but that's basicly it.
What do you think for my input file: .CSV, hash-array table, PS object?