<?xml version="1.0" standalone="yes"?>
<Paper uid="C92-2103">
  <Title>GENERATION FROM UNDER- AND OVERSPECIFIED STRUCTURES*</Title>
  <Section position="9" start_page="0" end_page="0" type="concl">
    <SectionTitle>
7 Summary
</SectionTitle>
    <Paragraph position="0"> Ill tiffs l)aper an algoritlun had t)een described which can be used to generate from filly specified feature structures a.s well as front variants of under- or overspecified feature structures in the LFG framework.</Paragraph>
    <Paragraph position="1"> The algorithm covers the cases given it, 114\] and \[151 &amp;s a subset. The treatment of recursion allows even for infinite many possible generations that the sohttions can I)e presented one by one, e.g. the generator will not go into an infinite loop between two solutions.</Paragraph>
    <Paragraph position="2"> The generator is implicit head-driven, e.g. it selects the head automatically for a given input structure with respect to the target grammar. As it is shown in ACTES DE COLING-92, NAMES, 23-28 ^O~rt ' 1992 6 9 1 PROC. OF COLING-92. N^N'rEs, AUG. 23-28. 1992 \[5\] this behaviour of the algorithm allows the efficient trcatment of head-switching phenomenons.</Paragraph>
    <Paragraph position="3"> It has been shown, that the algorithm provides information which allows in ease of failure to produce debugging information in terms of the target grammar, rather than in terms of the programming language the algorithm is iml)lemented in.</Paragraph>
    <Paragraph position="4"> The algorithm is implemented in PROLOG in the edinburgh syntax. Currently the implemention of the delmgging meehmfisms is incomplete.</Paragraph>
    <Paragraph position="5"> Although it is not shown in tiffs paper, the technique used for the generator could be easily adopted for parsing, where the input string takes tile part of the iuput feature structure. Ill this sense tile c-structure is only considered as an auxiliary structure where the gramntar describes basically a relation between a surface string and a feature structure. To adopt tile technique for parsing would have the advantages * to use basically the same maclfinery for parsing and generation where the nmehinery is optimized for each task, * to have the same improved possibilities for debugging, and e to allow to start the parsing of striugs while they are typed in, and not only after the complete string to be parsed is known.</Paragraph>
    <Paragraph position="6"> One of the major goals for the fi~ture development of the algorithm is to reduce the use of backtracking ,as much as possible by using disjunctions as part of the feature strncture.</Paragraph>
    <Paragraph position="7"> The algorithm should be also applicable to other grammar formalisms like PATR-II (see \[12\]) which make use of a context-fl'ee backbone and anotated descriptions. It is also intended to nse tlte algoritlnn for formalisms like ItPSC.</Paragraph>
  </Section>
class="xml-element"></Paper>