A Computational Framework for Lexical Description

To achieve generality, natural lang parsers require dictionaries that handle lexical information in a linguistically motivated but computationally viable manner. Various rule formalisms are presented that process orthographic effects, word structure, & lexical redundancy in a manner that allows the statement of linguistic generalizations with a clear computational interpretation. A compact description of a medium-sized subset of the Eng lexicon can be stated using these formalisms. The proposed mechanisms have been implemented & tested, but need to be refined further if they are to be regarded as an interesting linguistic theory. 15 References. HA