<?xml version="1.0" standalone="yes"?>
<Paper uid="C94-1067">
  <Title>An HPSG Parser Based on Description l,ogies*</Title>
  <Section position="2" start_page="0" end_page="0" type="intro">
    <SectionTitle>
1 Introduction
</SectionTitle>
    <Paragraph position="0"> Ira tiffs paper I present a parser for IIP'SO based on Description Logics (1)1.). &amp;quot;l)m main mntiwrtion for specifying such it parser relies on considerations concerning the disambiguation of NL expressions. In ISchmitz, Quantz 931 it is shown how different types of ambigtfity can be handled will) a homogeneous approach based on lhe notion of preference rules lJackendoff 83\]. A major reqnirement for such a t,nified approach is that information usually represented rather differently (e.g. syntactic, semantic, and encyclopedic information) is homogeneously represented in it tin;fern1 and declarative formalism in order to express and evaluate the complex l)references stemming from the different kinds of information.</Paragraph>
    <Paragraph position="1"> Description Imgics have been developed ira the field of Knowledge Representation (see, for example, \[Brachman et al. 91\]). qtrey have already been used for the representation of semantic and encyclopedic information, e.g. IAllgayer et al. 89, Stock 91, Preuss el al. 921. Due 1(5 their similarity to typcd feature formalisms \[Carpenler 921, syntactic infonnation is in principle also expressible in DI,, as already sketched in \[Quanlz 93, Quantz, Sehmilz 941.</Paragraph>
    <Paragraph position="2"> Furlhermore, Preferential Defaull Description Logics (H)DL) based on weighted defaults \[Quuntz, Ryan 931 can be used to represent the preference rules in a declarative and formally well-founded way.</Paragraph>
    <Paragraph position="3"> ht the following I will mainly show how IIl,'SG-slyle syntactic information can be represented in 1)I., atrld bow a simple parser can be build by using tim inference capabilities of a DL system. Note that when specifying the parser I will kee t) the presentation as simple as possible, thereby deliberately ignoring efficiency aspects. I will also refrain from model;riga//aspccts of relevant knowledge in DL, i.e.</Paragraph>
    <Paragraph position="4"> there are still pieces of information which are not explicitly encoded in the DL modeling, but tire rather ;nil;licitly cnntained in lhe parser (e.g. information related to linear precedence and to traces}.</Paragraph>
    <Paragraph position="5"> The main objective of this paper it thus neilher to contribute to research in efficient parsing tectmology, nor to &amp;quot;The project KIT-VM11 is suppo21ed by lhe German leedcral Minister of Research and Technology (BMFF) under conh'ac101 IV 101Q8.</Paragraph>
    <Paragraph position="6"> develop a declarative formalism ira which all aspects relevant for NI.P can be represented. It is rather to prnvide the b'ilsis for an implementation of the exception minimizalion aplsroach to interpretation proposed in IQuantz 931. In Section 6 I will hriefly sketch how the l)L-based parser l)resenled in Section 5 can be exleuded to realize this approach. null</Paragraph>
  </Section>
class="xml-element"></Paper>