<?xml version="1.0" standalone="yes"?>
<Paper uid="H92-1051">
  <Title>Interaction between Structural Changes in Machine Translation</Title>
  <Section position="3" start_page="0" end_page="255" type="intro">
    <SectionTitle>
2. Formalism
</SectionTitle>
    <Paragraph position="0"> We use a simple formalism, representing a sentence as a network of semantic dependencies. The basic units of the formalism are indices, properties, and relations. A logical form consists of an unordered set of terms; each term is either a property predicated of an index, or a relation between two indices. The written notation depicts properties and relations as unary and binary functors, respectively, and indices as their arguments, i.e. within brackets. A logical form representing 'John saw Mary' might be</Paragraph>
    <Paragraph position="2"> subj(e,j) &amp; obj(e,m) This representation is simplified particularly in that the relation tense here stands for what should be a complex representation of tense, aspect, and aktionsart, related anaphorically to the preceding discourse. It can be seen that the representation includes the names of the concepts, both objects and events, which are mentioned in the sentence, and the semantic relationships between them. Each of the three indices, j, m and e, is a unique label given to a node in the dependency network. The root node of the network is specified at the beginning of the representation, in this case e, the node representing the seeing event. As long as the toot node of the network is specified, it is possible to convert a logical form mechanistically into a structured representation such as a dependency graph or a feature structure. The particular characteristics of the formalism -- the types of relations and predicates used and the manner of their use -- are justified elsewhere\[11\].</Paragraph>
  </Section>
class="xml-element"></Paper>