chapter  9
28 Pages

Symbolic Paring Via Subsymbolic Rules

Connectionist approaches to Natural Language Processing, although by most accounts not yet as successful as symbolic approaches, stand as an important counterpoint to them. In connectionism, there is the promise of robust decision making, generalization, and other benefits of a style of programming based on the explicit presentation of input-output patterns (sometimes called extensional programming). Symbolic approaches enjoy the perspective of years of linguistic study, the application of well-understood methods, and a certain security that only comes from computing symbolic intermediate structures to reassure that processing is proceeding according to design.