Represent background knowledge

The one thing that the algorithim needs to be successful is background knowledge and little exists for the passage. It would seem that I could do an adequate job of representing the background knowledge using the case frames provided by Ehrlich. I am tempted to represent the background knowledge first using Ehrlich's case frames and worry about re-representing the passage after understanding more about the paths the algorithim searches. This might be a mistake.