File Information

File: 05-lr/acl_arc_1_sum/cleansed_text/xml_by_section/concl/82/j82-1003_concl.xml

Size: 2,212 bytes

Last Modified: 2025-10-06 13:55:58

<?xml version="1.0" standalone="yes"?>
<Paper uid="J82-1003">
  <Title>From English to Logic: Context-Free Computation of &amp;quot;Conventional&amp;quot; Logical Translation 1</Title>
  <Section position="10" start_page="0" end_page="0" type="concl">
    <SectionTitle>
6. Concluding Remarks
</SectionTitle>
    <Paragraph position="0"> From the point of view of theoretical and computational linguistics, Gazdar's approach to grammar offers profound advantages over traditional approaches: it dispenses with transformations without loss of insight, offers large linguistic coverage, and couples simple, semantically well-motivated rules of translation to the syntactic rules.</Paragraph>
    <Paragraph position="1"> We have attempted to show that the advantages of Gazdar's approach to grammar can be secured without commitment to an intensional target logic for the translations of natural language sentences. To motivate this endeavour, we have argued that there are philosophical and practical reasons for preferring a conventional target logic, and that there are as yet no compelling reasons for abandoning such logics in favour of intensional ones. More concretely, we have shown how to reformulate Gazdar's semantic rules to yield conventional translations, and have briefly described some extant PSG parsers, including one that is capable of parsing and translating in accordance with the reformulated Gazdar grammar (minus metalinguistic constructs).</Paragraph>
    <Paragraph position="2"> We believe that a parser-interpreter of this type will prove very useful as the first stage of a natural language understanding system. Since the grammar rules are expressed in a concise, individually comprehensible form, such a system will be easy to expand indefinitely. The assignment of a well-defined logical form to input sentences, compatible with favoured knowledge representation formalisms, should help to 42 American Journal of Computational Linguistics, Volume 8, Number 1, January-March 1982 Lenhart K. Schubert and Francis Jeffry Pelletier From English to Logic bring a measure of precision and clarity to the rather murky area of natural language interpretation by machine. null</Paragraph>
  </Section>
class="xml-element"></Paper>
Download Original XML