<?xml version="1.0" standalone="yes"?>
<Paper uid="E99-1039">
  <Title>New Museums Site</Title>
  <Section position="5" start_page="263" end_page="263" type="concl">
    <SectionTitle>
4 Conclusion
</SectionTitle>
    <Paragraph position="0"> In this paper we demonstrated how the use of default unification in the organisation of lexical information can provide non-redundant description of lexical types. In this way, we implemented a default inheritance network that represents verbal subcategorisation information, using YADU. It resulted in a significant reduction in lexical redundancy, with linguistic regularities and sub-regularities defined by means of TDFSS, in a lexicon that is succinctly organised, and that is also easier to maintain and modify, when compared to its monotonic counterpart. The resulting verbal hierarchy is able not only to encode the same information as Pollard and Sag's but also to specify more sub-regularities, in a more concise way.</Paragraph>
    <Paragraph position="1"> Such an approach has the advantage of optionally allowing default specifications to persist outside the lexicon, which is important for the specification of control in super-equi verbs and for lexical semantics. Moreover, as an order independent operation, it provides a declarative mechanism for default specification, with no cost in formal elegance. Finally, as YADU operates directly on feature structures, defaults are allowed as a fully integrated part of the typed feature structure system, and, as a consequence YADU integrates well with constraint-based formalisms. Further work will complement these results by comparing the adequacy of different default unification oPerations, like the one used in DATR, for this kind of linguistic description. This work is part of a larger project concerned with the investigation of grammatical acquisition within constraint-based formalisms.</Paragraph>
  </Section>
class="xml-element"></Paper>