<?xml version="1.0" standalone="yes"?>
<Paper uid="W97-1515">
  <Title>Experiences with the GTU grammar development environment</Title>
  <Section position="4" start_page="0" end_page="107" type="intro">
    <SectionTitle>
1 Introduction
</SectionTitle>
    <Paragraph position="0"> GTU (German: Grammatik-Testumgebung; grammar test environment) was developed as a flexible and user-friendly tool for the development and testing of grammars in various formats. Throughout the last 7 years it has been successfully used as a tutoring tool to supplement syntax courses in computational linguistics at the Universities of Koblenz and Zurich.</Paragraph>
    <Paragraph position="1"> GTU has been implemented in Arity Prolog under DOS and OS/2, and in SICStus Prolog under UNIX.</Paragraph>
    <Paragraph position="2"> In this paper we will concentrate on the UNIX version. GTU in this version is a stand-alone system of about 4.5 MB compiled Prolog code (not counting the lexicons) 1. GTU interacts with 3 German lexicons: lAccording to rearrangements of the operating system the actual memory requirements total about 7 MB for both SUN OS 4.x and SUN OS 5.x.</Paragraph>
    <Paragraph position="3"> 1. a small hand-coded stem-lexicon whose vocabulary has been tailored towards the test sentences (This lexicon also contains selectional restrictions for all its nouns and adjectives.),  2. GerTWOL (Oy, 1994), a fast morphology analysis program, and 3. PLOD, a full-form lexicon that has been derived from the CELEX lexical database (Baayen, Piepenbrock, and van Rijn, 1995).</Paragraph>
    <Paragraph position="4"> GTU supports grammars under four formalisms: 1. Definite Clause Grammar (DCG, (Pereira and Shieber, 1987)) augmented with feature structures, null 2. Immediate Dominance / Linear Precedence Grammar (ID/LP; a subset of GPSG), 3. Generalized Phrase Structure Grammar (GPSG, (Gazdar et al., 1985)), 4. Lexical Functional Grammar (LFG, (Kaplan and Bresnan, 1982)).</Paragraph>
    <Paragraph position="5">  Additionally, GTU provides a first step towards semantic processing of LFG f-structures. Thus a grammar developer may specify the way the semantic module computes logical expressions for an f-structure using semantic rules. In another module the selectional restrictions of the hand-coded lexicon can be used to compute if (a reading of) a sentence is semantically anomalous. This module can be switched on and off when parsing a sentence. GTU's features have been published before (see (Jung, l%icharz, and Volk, 1994) or (Volk, Jung, and Fticharz, 1995)). In this paper we concentrate on evaluating GTU's features, comparing them to some other workbenches that we have access to (mostly GATE (Gaizauskas et al., 1996) and the Xerox LFG workbench (Kaplan and Maxwell, 1996)). From this we derive recommendations for future grammar workbenches.</Paragraph>
  </Section>
class="xml-element"></Paper>