<?xml version="1.0" standalone="yes"?>
<Paper uid="C04-1090">
  <Title>A Path-based Transfer Model for Machine Translation</Title>
  <Section position="3" start_page="0" end_page="0" type="intro">
    <SectionTitle>
2 Paths in Dependency Trees
</SectionTitle>
    <Paragraph position="0"> The dependency tree of a sentence consists of a set of nodes, each of which corresponds to a word in the sentence. A link in the tree represents a dependency relationship between a pair of words.</Paragraph>
    <Paragraph position="1"> The links are directed from the head towards the modifier. Except the root of tree, every node has exactly one incoming link. An example dependency tree is shown in Fig. 1.</Paragraph>
    <Paragraph position="2"> John found a solution to the problem.</Paragraph>
    <Paragraph position="3"> det detsubj obj to Figure 1. An example dependency tree A sequence of nodes n</Paragraph>
    <Paragraph position="5"> and the dependency links between them form a path if the following conditions hold: a. [?] i (1[?] i &lt; k), there is a link from n</Paragraph>
    <Paragraph position="7"> A set of paths is said to cover a dependency tree if the union of the nodes and links in the set of paths include all of the nodes and links in the dependency tree.</Paragraph>
  </Section>
class="xml-element"></Paper>