File Information

File: 05-lr/acl_arc_1_sum/cleansed_text/xml_by_section/intro/92/c92-2103_intro.xml

Size: 758 bytes

Last Modified: 2025-10-06 14:05:14

<?xml version="1.0" standalone="yes"?>
<Paper uid="C92-2103">
  <Title>GENERATION FROM UNDER- AND OVERSPECIFIED STRUCTURES*</Title>
  <Section position="3" start_page="0" end_page="0" type="intro">
    <SectionTitle>
1 Introduction
</SectionTitle>
    <Paragraph position="0"> In this paper I will present all algorithut for generation fronl under- alld overspccitied feattlrc struetltres in the Lr'(; fi'amework 1. Tile algorithm makes use of the concept of generation as slructuT~-driven derivatzon as it is described ill 114, 15, 16\]. Most of tile time the algorithm works top-down breadth-first, similar to the gcncrator described ill \[7\] and \[61. Only for thc creation of the final structure tile algorithm works bottonl-Ill),</Paragraph>
  </Section>
class="xml-element"></Paper>
Download Original XML