<?xml version="1.0" standalone="yes"?>
<Paper uid="C92-2068">
  <Title>Quasi-Destructive Graph Unification with Structure-Sharing*</Title>
  <Section position="9" start_page="0" end_page="0" type="concl">
    <SectionTitle>
6 Conclusion
</SectionTitle>
    <Paragraph position="0"> The structure-sharing scltemc introduced ill this paper made the Q-D Mg(~ritlnn run significantly f~mter.</Paragraph>
    <Paragraph position="1"> The original gain of the Q-D algorit, hnt was due to the fact that it does not create ally Over Copies or Early Col&gt;ies whereas iIIcrelllelltal (:opyillg sfllI~Ille inherently produces Early Copies (iLs defined in \[Totnal)echi, 19911) when a unification fails. Tilt: prol)osed schenm lllakes the Q-D algotfflmi fully i~vl)i(1 lh~dundaltt Collies as well by only copying the lowest nodes that need to be eoI)ied due to destrtt(:tive chatlges caused by successful unifications only. Since there will bc virtually uo overhead associated with structure=sharlng (except far returning two vahl(!s illstead (If oDc' to pa.ss tip :chattge(l illforltlatioll wht!ll rt!curs(oil for copying rcturos), the perfornlatlee of the prol)osed strnl:ture-sharing schellle should llOt drop eveii when the granmlar size is significantly scaled Ul). With the denttmstratcd speed of the algorithm.</Paragraph>
    <Paragraph position="2"> as well as the ability to handle cyclicity in the graphs.</Paragraph>
    <Paragraph position="3"> mid ease of switching betwemt strueture-sharittg attd non-structure sharing, the algorithm couhl lie a viable alternative to existing tttfifit:ation algorithnts used in current nature |language systems.</Paragraph>
    <Paragraph position="4"> AcrEs DE COLING-92, NANTES, 23-28 AOr3T 1992 4 4 6 PROC. OF COLING-92, NANTEs, AUG. 23-28, 1992</Paragraph>
  </Section>
class="xml-element"></Paper>