| |
| | CSLI Calendar, 26 November 1997, vol. 13:11 |
 | | This question leads to a distinction among two kinds of regularities that have both been called 'lexical rules': productive rules, for which one always knows, given an appropriate input, what the output will be (e.g. |
 | | regular inflection, diminutives, and expletive infixation); and semiproductive rules, for which one has to know whether the output is an actual word and what its peculiarities might be (e.g. |
 | | I will argue that the productive cases warrant setting up independent lexical entries for the productive affixes, within-word combination being accomplished online by rules of the same character as regular phrasal rules; while the instances of semiproductive regularities must be listed individually and related by inheritance hierarchies. |
| www-csli.stanford.edu /Archive/calendar/1997-98/msg00011.html (2008 words) |
|