| Part of a series on |
| Linguistics |
|---|
 Portal |
Model-theoretic grammars, also known as constraint-based grammars, contrast with generative grammars in the way they define sets of sentences: they state constraints on syntactic structure rather than providing operations for generating syntactic objects.[1] A generative grammar provides a set of operations such as rewriting, insertion, deletion, movement, or combination, and is interpreted as a definition of the set of all and only the objects that these operations are capable of producing through iterative application. A model-theoretic grammar simply states a set of conditions that an object must meet, and can be regarded as defining the set of all and only the structures of a certain sort that satisfy all of the constraints.[2] The approach applies the mathematical techniques of model theory to the task of syntactic description: a grammar is a theory in the logician's sense (a consistent set of statements) and the well-formed structures are the models that satisfy the theory.
- ^ Pullum, Geoffrey Keith; Scholz, Barbara C. (2001). "On the distinction between generative-enumerative and model-theoretic syntactic frameworks" (PDF). In de Groote, Philippe; Morrill, Glyn; Retor, Christian (eds.). Logical Aspects of Computational Linguistics: 4th International Conference. Springer Verlag. pp. 17–43.
- ^ Pullum, Geoffrey Keith (2007). "The evolution of model-theoretic frameworks in linguistics" (PDF). In Rogers, James; Kepser, Stephan (eds.). Model-theoretic syntax at 10 – Proceedings of the ESSLLI2007 MTS@10Workshop. Trinity College Dublin. pp. 1–10.