A good straw man” learning algorithm is as follows: create a table Out of all the training examples identify which output occurs most often among the training examples; call it d. Then when given an input that is not in the table, just return d. For inputs that are in the table, return the output associated with it (or the most frequent output. if there is more than one). Implement this algorithm and see how well it does on the restaurant domain. This should give you an idea of the baseline for the domain—the minimal performance that any algorithm should be able to obtain.