Research on Language and Computation

, Volume 6, Issue 2, pp 163–203

Linguistic Constraint Systems as General Soft Constraint Satisfaction


DOI: 10.1007/s11168-008-9050-x

Cite this article as:
Pendar, N. Res on Lang and Comput (2008) 6: 163. doi:10.1007/s11168-008-9050-x


This paper proposes that linguistic constraint satisfaction can be viewed as an instance of general human soft constraint satisfaction. After a discussion on the relation between modularity in grammar and soft constraints and a review of the conceptions of gradient phenomena in language, the paper presents a generalized theory of soft constraint satisfaction from the AI literature (Bistarelli 2001). It then shows that a unifying underlying theory of constraint satisfaction allows us to bring different constraint-based linguistic theories (e.g., LOT and HPSG) closer together as well as account for certain gradient phenomena straightforwardly.


Constraint-based linguistic theoriesSoft constraint satisfactionCognitive modeling of language

Copyright information

© Springer Science+Business Media B.V. 2008

Authors and Affiliations

  1. 1.Department of EnglishIowa State UniversityAmesUSA