Paper: Optimality Theory: Universal Grammar Learning And Parsing Algorithms And Connectionist Foundations (Abstract)

ACL ID P94-1037
Title Optimality Theory: Universal Grammar Learning And Parsing Algorithms And Connectionist Foundations (Abstract)
Venue Annual Meeting of the Association of Computational Linguistics
Session Main Conference
Year 1994
Authors

Paul Smolensky and Bruce Tesar Department of Computer Science and Institute of Cognitive Science University of Colorado, Boulder USA We present a recently proposed theory of grammar, Optimality Theory (OT; Prince & Smolensky 1991, 1993). The principles of OT derive in large part from the high-level principles governing computation in con- nectionist networks. The talk proceeds as follows: (1) we summarize OT and its applications to UG. The we present (2) learning and (3) parsing algorithms for OT. Finally, (4) we show how crucial elements of OT emerge from connectionism, and discuss the one central feature of OT which so far eludes connectionist explanation. (1) In OT, UG provides a set of highly general univer- sal constraints which apply in parallel to assess the well- formedness of pos...