This chapter introduces symbolic machine learning in which decision trees, rules, or case-based classifiers are induced from supervised training examples. It describes the representation of knowledge assumed by each of these approaches and reviews basic algorithms for inducing such representations from annotated training examples and using the acquired knowledge to classify future instances. These techniques can be applied to learn knowledge required for a variety of problems in computational linguistics ranging from part-of-speech tagging and syntactic parsing to word-sense disambiguation and anaphora resolution. Applications to a variety of these problems are reviewed.

PDF, PS

McGraw-Hill, New York, NY 2003. McGraw-Hill.

@Book{mitchell:book97, title={Machine Learning}, author={Raymond J. Mooney}, address={New York, NY}, publisher={McGraw-Hill}, url="http://www.cs.utexas.edu/users/ai-lab?mitchell:book97", year={2003} }