Constraint-based grammar

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

Constraint-based grammars can perhaps be best understood in contrast to generative grammars. Whereas a generative grammar lists all the transformations, merges, movements, and deletions that can result in all well-formed sentences, constraint-based grammars take the opposite approach: allowing anything that is not otherwise constrained.

"The grammar is nothing but a set of constraints that structures are required to satisfy in order to be considered well-formed."[1] "A constraint-based grammar is more like a database or a knowledge representation system than it is like a collection of algorithms."[1]

Examples of such grammars include


  1. ^ a b Pollard, Carl. "The nature of constraint-based grammar" (PDF). 11th Pacific Asian conference on language, information and computation.
  2. ^ a b c d Müller, Stefan (2016). Grammatical theory: From transformational grammar to constraint-based approaches. Berlin: Language Science Press. pp. 490–491.
  3. ^ Christiansen, Henning. "CHR Grammars with multiple constraint stores." First Workshop on Constraint Handling Rules: Selected Contributions. Universität Ulm, Fakultät für Informatik, 2004.