Premium
Weighted Constraints in Generative Linguistics
Author(s) -
Pater Joe
Publication year - 2009
Publication title -
cognitive science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.498
H-Index - 114
eISSN - 1551-6709
pISSN - 0364-0213
DOI - 10.1111/j.1551-6709.2009.01047.x
Subject(s) - generative grammar , computer science , connectionism , set (abstract data type) , linguistics , typology , cognitive linguistics , grammar , artificial intelligence , natural language , cognition , natural language processing , psychology , sociology , artificial neural network , philosophy , neuroscience , anthropology , programming language
Harmonic Grammar (HG) and Optimality Theory (OT) are closely related formal frameworks for the study of language. In both, the structure of a given language is determined by the relative strengths of a set of constraints. They differ in how these strengths are represented: as numerical weights (HG) or as ranks (OT). Weighted constraints have advantages for the construction of accounts of language learning and other cognitive processes, partly because they allow for the adaptation of connectionist and statistical models. HG has been little studied in generative linguistics, however, largely due to influential claims that weighted constraints make incorrect predictions about the typology of natural languages, predictions that are not shared by the more popular OT. This paper makes the case that HG is in fact a promising framework for typological research, and reviews and extends the existing arguments for weighted over ranked constraints.