<?xml version="1.0" standalone="yes"?>
<Paper uid="P98-2216">
  <Title>The Computational Lexical Semantics of Syntagmatic Relations</Title>
  <Section position="6" start_page="1331" end_page="1331" type="concl">
    <SectionTitle>
4 Conclusion
</SectionTitle>
    <Paragraph position="0"> In this paper, we built on a continuum perspective, knowledge-based, spanning the range from free-combining words to idioms. We further distinguished the notion of idiosyncrasies as defined in (Viegas and Bouillon, 1994), into restricted semantic co--occurrences and restricted lexical co-occurrences.</Paragraph>
    <Paragraph position="1"> We showed that they were formally equivalent, thus facilitating the processing of strictly compositional and semi-compositional expressions. Moreover, by considering the information in the lexicon as constraints, the linguistic difference between compositionality and semi-compositionality becomes a virtual difference for Hunter-Gatherer. We showed ways of minimizing the acquisition costs, by 1) using lexical rules as a way of expanding co-occurrences, 2) taking advantage of the LSF inheritance hierarchy.</Paragraph>
    <Paragraph position="2"> The main advantage of our approach over the ECD approach is to use the semantics coded in the lexemes along with the language independent LSF inheritance hierarchy to propagate restricted semantic co-occurrences. The work presented here is complete concerning representational aspects and processing aspects (analysis and generation): it has been tested on the translations of on-line unrestricted texts. The large-scale acquisition of restricted co-occurrences is in progress.</Paragraph>
  </Section>
class="xml-element"></Paper>