<?xml version="1.0" standalone="yes"?>
<Paper uid="E99-1009">
  <Title>Geometry of Lexico-Syntactic Interaction</Title>
  <Section position="8" start_page="67" end_page="68" type="concl">
    <SectionTitle>
5 Lecomte and Retor6 (1995) propose to use the
</SectionTitle>
    <Paragraph position="0"> expressivity of modules in general to classify words rather than just category formulas (=modules without id or Cut links). Our method provides semantic motivation for modules at the machine level but we propose to maintain the less unwieldy categories at the user level.</Paragraph>
    <Paragraph position="1">  lexical semantics can be substituted into the unfolded lexical category by a Cut, and the resulting module normalised by Cut elimination in a precompilation. This is illustrated for the 'inhabits' example in figure 8.</Paragraph>
    <Paragraph position="2"> In this way, rather than starting the proof search with a frame comprising just the unfolding of lexical categories, one starts with a frame comprising the preevaluated modules resulting from lexical substitution. Let us consider again (lb) from this point of view. First note, as well as figure 8, the precompilation of a proper name lexical assignment as in figure 9. The proof frame prior to proof search is that in figure 10. Adding axiom links yields the same net, and thus the same semantics, as that obtained for (1 a) in figure 5.</Paragraph>
    <Paragraph position="3"> A slightly more involved illustration of the same point is provided by the following lexical assignments for the paraphrases (2a) and (2b).</Paragraph>
    <Paragraph position="4">  These assign semantics (2c) to both (2a) and (2b) and, as the reader may check, by partially evaluating lexical modules in a precompilation, normal form semantics is obtained directly in both cases.</Paragraph>
    <Paragraph position="5"> Conclusion In both the example worked out explicitly and the one left to the reader, we deal with words which are synonyms of continuous expressions: 'inhabits' = 'lives in' and 'seeks' = 'tries to find'. This enables us to represent the evaluated lexical modules as planar. However it should be noted that in general lexical substitution involves linking syntactic modules which are ordered with lexical semantic modules which are not ordered, and which could be multiple-binding, and Cut elimination has to be performed in a hybrid architecture which must preserve the linear precedence of syntactic literals. It is therefore of importance to the future generalization of the method we propose to investigate the precise nature of such hybrid architectures.</Paragraph>
  </Section>
class="xml-element"></Paper>