A Computational Framework for Lexical Description (1987)
| Venue: | Computational Linguistics |
| Citations: | 17 - 3 self |
BibTeX
@ARTICLE{Ritchie87acomputational,
author = {Graeme D. Ritchie and Stephen G. Pulman and Alan W. Black and Graham J. Russell},
title = {A Computational Framework for Lexical Description},
journal = {Computational Linguistics},
year = {1987},
volume = {13},
pages = {290--307}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
this paper are taken from our implemented description and hence will contain this fifth field, with a value of NIL). There are two classes of rules. Lexical rules (of which there are three types) express relationships between entries, or between fields within entries, and have a procedural interpretation which maps a set of basic entries into a possibly larger set of entries with more specified categories. Morphological rules (of which there are two types) express relationships between characters and morphemes within a word, and have a procedural interpretation which allows a string of characters to be decomposed into a structural analysis of a word. There is also a very simple -4mechanism for defining default values for syntactic features, which does not properly fall into either of these classes of rules. The lexical rules are of the following types:
Citations
No citations identified.
