<?xml version="1.0" standalone="yes"?>
<Paper uid="P03-1047">
  <Title>Bridging the Gap Between Underspecification Formalisms: Minimal Recursion Semantics as Dominance Constraints</Title>
  <Section position="8" start_page="0" end_page="0" type="concl">
    <SectionTitle>
7 Conclusion
</SectionTitle>
    <Paragraph position="0"> We have related two underspecification formalism, MRS and normal dominance constraints. We have distinguished the sublanguages of MRS-nets and normal dominance nets that are sufficient to model scope underspecification, and proved their equivalence. Thereby, we have obtained the first provably efficient algorithm to enumerate the readings of underspecified semantic representations in MRS.</Paragraph>
    <Paragraph position="1"> Our encoding has the advantage that researchers interested in dominance constraints can benefit from the large grammar resources of MRS. This requires further work in order to deal with unrestricted versions of MRS used in practice. Conversely, one can now lift the additional modeling power of CLLS to MRS.</Paragraph>
  </Section>
class="xml-element"></Paper>