Monday, November 6
Bring your code to class. Be prepared to be called on to put it on the board.
- Define the function find-common-slots, as discussed in
- For extra in-class credit, extend the algorithm to handle fillers that are
lists. That is, if an index has two features, e.g., :feature (m-wing
m-claw), the algorithm should be able to recognize the commonality with
another index with some kind of wing, claw, or both.