Word Form Record
Jump to navigation
Jump to search
A Word Form Record is a lexical record about a single word form.
- AKA: Terminal Word Record, Surface Word Record.
- Context:
- It can be associated to a Lexeme Record or a Word Sense Inventory Record. e.g. “went” ⇒ GO_VERB and "wolves” ⇒ WOLF_NOUN.
- It can be restricted to which Word Senses it applied to. e.g. some senses of CHATTER_1_NOUN are not pluralized.
- It can have a Part-of-Speech Role (or be gotten from the Lexeme Record).
- It can be associated to (corefer to) one or more Word Mentions (and be mapped via a Coreference Task).
- It can be associated to another Word Form Record.
- with alternate Spelling (or mis-spelling). e.g. realise <=> realize.
- with alternate Pronunciation (or mis-pronunciation). e.g. content <=> content.
- It can have one intended meaning (by means of Word Sense).
- It can have one Description.
- It can have one or more Linguistic Expressions with sample usage.
- It can be a member of a Lexical Database.
- It can belong to a Word Form Set (such as a Declension).
- It can be automatically generated from a Based Word Record, e.g. “Great-great-great-grandmother” and “kaleidoscopephobia”.
- Based on Allomorphs and one Morphological Rule/Lexical Rule/Orthographic Rules.
- It can be an Input to a Lexicalized Parser.
- It can be the Output of an Orthographic Rule.
- Example(s):
- See: Lexeme Record, Technical Term Record, Etymological Word Record.
References
2003
- (Sag et al., 2003) ⇒ Ivan A. Sag, Thomas Wasow, and Emily M. Bender. (2003). “Syntactic Theory: A Formal Introduction, 2nd edition." CSLI Publications.
- lexical entry Information about individual words [q.v.] that must be stipulated is put into the lexicon [q.v.] in the form of descriptions that we call lexical entries. They are ordered pairs, consisting of a phonological form (description) and partial feature structure description. Fully resolved lexical sequences [q.v.] consistent with lexical entries can serve as the INPUT values to lexical rules [q.v.].
- 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).
- lexical rule instantiation Our lexical rules [q.v.] are descriptions, specifying the value of some features and leaving others unspecified. A lexical rule instantiation is a fully resolved feature structure that is consistent with the specification of some lexical rule.
- lexical sequence Ordered pairs that can serve as the INPUT and OUTPUT values of lexical rules [q.v.] are called lexical sequences. They consist of a phonological form and a fully resolved feature structure.
- lexicon The list of all words [q.v.] (or lexemes [q.v.]) of a language is called its 'lexicon'. The lexicon is the repository of all idiosyncratic information about particular words including syntactic, semantic, and phonological information. In some theories of grammar, the lexicon can also contain a great deal more systematic information organized by a type hierarchy [q.v.] and/or lexical rules.