Lexical Rule
Jump to navigation
Jump to search
A Lexical Rule is a Rule within a Lexicon.
- Context:
- It can be associated to a Lexical Rule Instantiation.
- It can build a new word in the Lexicon.
- It can be a Word-Formation Rule (which forms words out of Word Bases and Affixes.
- Example(s):
- Counter-Example(s):
- See: Lexeme, Lexical Record, Lexical Unit, Part-of-Speech, Morphological Rule, Word Formation Process, Morphological Processing, Morphological Compounding Rule, Compound Word Generation Process, Word Sense Disambiguation.
References
2009
- (Wikipedia, 2009) ⇒ http://en.wikipedia.org/wiki/Lexical_rule
- A lexical rule is in a form of syntactic rule used within many theories of natural language syntax. These rules alter the argument structures of lexical items (for example verbs and declensions) in order to alter their combinatory properties.
- Lexical rules affect in particular specific word classes and morphemes. Moreover, they may have exceptions, do not apply across word boundaries and can only apply to underlying forms.
- An example of a lexical rule in spoken English is the deletion of /n/. This rule applies in damn and autumn, but not in hymnal. Because the rule of n-deletion apparently needs information about the grammatical status of the word, it can only be lexical.
- Lexical rules are the inverse of postlexical rules.
2003
- (Sag et al., 2003) ⇒ Ivan A. Sag, Thomas Wasow, and Emily M. Bender. (2003). “Syntactic Theory: A Formal Introduction, 2nd edition [1] [2]." CSLI Publications. ISBN:1575863995, Glossary pp. 555-584.
- QUOTE: lexical rule Lexical rules are one of the mechanisms (along with the type type hierarchy [q.v.]) used to capture generalizations within the lexicon. Families of related words - such as the different inflectional forms of a verb - can be derived from a single lexical entry [q.v.] by means of lexical rules. We formalize lexical rules as a type of feature structure with features INPUT and OUTPUT. There are three sybtypes of lexical rules: derivational (relating lexemes [q.v.] to lexemes), inflectional (relation lexemes to words [q.v.]), and post-inflectional (relating words to words).
1994
- (van Noord & Bouma, 1994) ⇒ Gertjan van Noord, and Gosse Bouma. (1994). “Adjuncts and the Processing of Lexical Rules.” In: Proceedings of the 15th conference on Computational Linguistics. doi:10.3115/991886.991928
- The standard HPSG analysis of Germanic verb clusters can not explain the observed narrow scope readings of adjuncts in such verb clusters. We present an extension of the HPSG analysis that accounts for the systematic ambiguity of the scope of adjuncts in verb cluster constructions, by treating adjuncts as members of the subcat list. The extension uses powerful recursive lexical rules, implemented as complex constraints. We show how 'delayed evaluation' techniques from constraint-logic programming can be used to process such lexical rules.