<?xml version="1.0" standalone="yes"?>
<Paper uid="W04-0810">
  <Title>A First Evaluation of Logic Form Identification Systems</Title>
  <Section position="3" start_page="0" end_page="0" type="intro">
    <SectionTitle>
2 General Guidelines
</SectionTitle>
    <Paragraph position="0"> The Logic Form of a sentence is the conjunction of individual predicates, where the relationships among them are expressed via shared arguments.</Paragraph>
    <Paragraph position="1"> Predicates are generated for all content words such as nouns, verb, adjectives and adverbs. Pronouns are treated as independent nouns. Prepositions and conjunctions are also mapped onto predicates that capture the relation between the prepositional object and the constituent to which it is attached and the relation among the coordinated entities, respectively. null There are two types of arguments: e - for events, x - for entities. For the sentence presented above we have two events - e1, e2 corresponding to each verb/action in the sentence and four entities - x1, x2, x3, x4 corresponding to the heads of the base noun phrases (NP). Each verb predicate has the second argument set to the corresponding logical subject and the third argument to its direct object. The remaining slots for a verb predicate are filled with the arguments of their indirect and prepositional objects.</Paragraph>
    <Paragraph position="2"> In the example presented above the predicate eat has arguments after ; (semicolon) which indicates its adjuncts. The distinction between complements and adjuncts is a novelty to the LF proposed by the authors in this paper. For this first trial, we did not make the distinction between the two and thus the accepted representation would beeat:v (e2,</Paragraph>
    <Paragraph position="4"> Predicates are formed by the concatenation of the base form of the word and its lexical category as encoded in WordNet (since only nouns, verbs, adjectives and adverbs are encoded in WordNet, only predicates for those lexical categories have the category attached to the predicate).</Paragraph>
    <Paragraph position="5"> To ease the task, the notation was relaxed by adopting few simplifications similar, to some extent, to the simplications in (Moldovan and Rus, 2001): determiners, plurals, negation, auxiliaries and verb tenses, punctuation are ingnored. Collocations, such as New York, should be considered a single predicate as well as verbs having particles (e.g. give up). For cases when an argument is underspecified, such as the logical subject in Jim was told to</Paragraph>
    <Section position="1" start_page="0" end_page="0" type="sub_section">
      <SectionTitle>
Association for Computational Linguistics
</SectionTitle>
      <Paragraph position="0"> for the Semantic Analysis of Text, Barcelona, Spain, July 2004 SENSEVAL-3: Third International Workshop on the Evaluation of Systems say something, an artificial argument should be generated. null The advantages of the LF notation are mantfold: a0 it allows a simple syntax/semantics interface a0 it is user friendly a0 it has positional syntactic arguments that ease other NLP tasks such as textual interpretationa and textual inference a0 if predicates are disambiguated with respect to a general ontology such as WordNet it leads to concept predicates a0 it is easily customizable (for example to distinguish between arguments and adjuncts) For details about the principles of Logic Forms read Chapter 2 in (Rus, 2002), (Rus and Moldovan, 2002) and (Hobbs, 1986). The LF notation proposed for the LFi competition is novel, and different from the one described in the previous references since it distinguishes between complements and adjuncts among other differences. A web page for the LFi task is available at http://www.cs.iusb.edu/ vasile/logic/indexLF.html and a discussion group, called logicform, was opened at yahoo.groups.com which can also be consulted. null</Paragraph>
    </Section>
  </Section>
class="xml-element"></Paper>