<?xml version="1.0" standalone="yes"?>
<Paper uid="P98-2216">
  <Title>The Computational Lexical Semantics of Syntagmatic Relations</Title>
  <Section position="3" start_page="0" end_page="0" type="intro">
    <SectionTitle>
1 Introduction
</SectionTitle>
    <Paragraph position="0"> You can take advantage o\] the chambermaid 1 is not a collocation one would like to generate in the context of a hotel to mean &amp;quot;use the services of.&amp;quot; This is why collocations should constitute an important part in the design of Machine Translation or Multilingual Generation systems.</Paragraph>
    <Paragraph position="1"> In this paper, we address the issue of syntagmatic expressions from a computational lexical semantic perspective. From a representational viewpoint, we argue for a hybrid approach combining linguistic and conceptual paradigms, in order to account for the continuum we find in natural languages from free combining words to frozen expressions (such as in idioms kick the (proverbial) bucket). In particular, we focus on the representation of restricted semantic and lexical co-occurrences, such as heavy smoker and pro#ssor ... students respectively, that we define later. From a processing viewpoint, we show how to generate/analyze syntagmatic expressions by using an efficient constraint-based processor, well fitted for a knowledge-driven approach. In the following, we first compare different approaches to collocations. Second, we present our approach in terms of representation and processing. Finally, we show how to facilitate the acquisition of co-occurrences by using 1) the formalism of lexical rules (LRs), 2) an 1Lederer, R. 1990. Anguished English A Laurel Book, Dell Publishing.</Paragraph>
    <Paragraph position="2"> inheritance hierarchy of Lexical Semantic Functions (LSFs).</Paragraph>
  </Section>
class="xml-element"></Paper>