<?xml version="1.0" standalone="yes"?>
<Paper uid="E85-1021">
  <Title>DESIGN AND IMPLEMENTATION OF A LLXICAL DATA BASE</Title>
  <Section position="3" start_page="0" end_page="0" type="intro">
    <SectionTitle>
INTRODUCTION
</SectionTitle>
    <Paragraph position="0"> It has been traditionally assumed by computational linguists and particularly by designers of large natural language processing systems such as machine translation systems that the lexicon should be limited to lexical information that cannot be derived by rules.</Paragraph>
    <Paragraph position="1"> According to this view, a lexicon consists of a list of basic morphemes along with irregular or unpredictable words.</Paragraph>
    <Paragraph position="2"> In this paper, I would like to reexamine this traditional view of the lexicon and point out some of the problems it faces which seriously question the general adequacy of this model for natural language processing.</Paragraph>
    <Paragraph position="3"> As a trade-off between the often conflicting linguistic, computational and also practical considerations, an alternative conception of the lexicon will be discussed, largely based on Jackendoff's (1975) proposal. According to this view, lexical entries are fully-specified but related to one another. First developed for a French parser (cf. Wehrli, 1984), this model has been adopted for an English parser in development, as well as for the prototype of a French-English translation system.</Paragraph>
    <Paragraph position="4"> This paper is organized as follows: the first section addresses the general issue of what constitutes a lexical entry as well as the question of the relation between lexicon and morphology from the point of view of both theoretical linguistics and computational linguistics. Section 2 discusses the relational word-based model of the lexicon and the role morphology is assigned in this model. Finally, it spells out some of the details of the implementation of this model.</Paragraph>
  </Section>
class="xml-element"></Paper>