Academia.eduAcademia.edu

How do we construct convergent numerations?

This essay claims that in a formal model, numerations can be conceived as random (equivalently, pragmatically determined) only if syntactic derivations can enrich them in a highly constrained way, with items from a special lexical component of purely grammatical or “closed class'' items. Items from this subcomponent, the “Grammatical Lexicon”, have precisely the properties (insertion into partly processed grammatical environments, and possible null phonology) which make the otherwise randomly selected numerations “converge'' in well-formed grammatical derivations.

Loading...

Loading Preview

Sorry, preview is currently unavailable. You can download the paper by clicking the button above.