File Information

File: 05-lr/acl_arc_1_sum/cleansed_text/xml_by_section/concl/00/c00-2096_concl.xml

Size: 2,299 bytes

Last Modified: 2025-10-06 13:52:44

<?xml version="1.0" standalone="yes"?>
<Paper uid="C00-2096">
  <Title>Unscrambling English word order</Title>
  <Section position="6" start_page="668" end_page="668" type="concl">
    <SectionTitle>
7 Conclusions
</SectionTitle>
    <Paragraph position="0"> \Y=e have shown how retrieving disl)laeed items directly, rather than t)ositing a trace of some kind and then eancellillg it against an appriate iteln when one turns up, can I)rovide treatlllellts of leftand right-extraposition which display the advantages that (Johnson and Kay, 1994) obtain for leftextraposition. This approach to extraposition can be extended to deal with 'intraposition' and to cases where items have been extracted ti'om non-clausal items. In order to avoid overgeneration, we needed to introduce a set of LP-rules which are applied as phrases are constructed in order to ensure, that items have not been shifted to unacceptable positions. The extra computation required for checking the LP-rules has no effect on l;he comI)lexity of the parsing process, since they simply add a constant (and t~irly small) extra set of steps each time a new edge is proposed. As a rough tmrformance guide, the gralnInar generates five analyses for 30 Ite built on that site a more unattractive house than the eric which he built in Greenwich.</Paragraph>
    <Paragraph position="1"> on the basis of 237 edges (the different global analyses m'ise from the attachment ambiguities for the wn:ious modifiers), and takes 4.1 seconds to &lt;1o so (compiled Sicstus on a Pentiunl 350). This sentence contains a right-shifted NP, which itself contains a 'more ... than ...' construction and also a relative clause with a left-shifted WII-pronoun, and hence could be expected to cause problems for al)l)roaches using si)onsors , while 8 Betty, I believe, is a fool.</Paragraph>
    <Paragraph position="2"> takes 0.27 seconds. Tit('. worst case complexity analysis for this kind of approach is fairly awflfl (O(l y) X 22(N-I)) where 1 ~ is the number of unsaturated edges in the initial chart and N is the length of the sentence (Ramsay, in press)). In practice the LP-rules provide sufficient constraints on the generation of non-coral)act phrases for pertbrmalme to be generally acceptable on sentences of about twenty words.</Paragraph>
  </Section>
class="xml-element"></Paper>
Download Original XML