<?xml version="1.0" standalone="yes"?>
<Paper uid="W00-1212">
  <Title>A Block-Based Robust Dependency Parser for Unrestricted Chinese Text,</Title>
  <Section position="4" start_page="79" end_page="82" type="metho">
    <SectionTitle>
3 Dependency analysis
</SectionTitle>
    <Paragraph position="0"> Text For an Input: S = blockl, block2,...,block,, the dependency parsing will generate a set of 3-tuple in the form of {governor, dependant, dependency-relation}, which represents dependency relations between blocks in the given sentence.</Paragraph>
    <Paragraph position="1"> {&lt; gov 1 , depl , rel% &gt;,  &lt;gov 2 , dep2 ,rela 2&gt; .... &lt; gov. , dep, , rela m &gt;} Algorithm 2: The dependency parsing  1) Count the number of block qualifying of acting as a predicate, denoted as s. These kind of blocks are called &amp;quot;predicate candidates&amp;quot;. 2) Decide the predicate from these s blocks, denoted as blockj 3) If s=0, return; //need not analysis; 4)For any case of S, S=1,2,... (S&gt;0), dependency parsing respectively; do  A sentence may contain s predicate candidates. For each case, we defined a detailed analysis algorithm. Up to now, the parser is designed to have ability to treat with sentences containing up to 7 predicate candidates. In case a sentence has more than 7 predicate candidates, it will be partitioned into two parts, and then doing analysis in turn.</Paragraph>
    <Paragraph position="2"> Suppose the predicate block is blockj, the number of &amp;quot;predicate candidates&amp;quot; is denoted as s. We explain the dependency parsing by the following two simple cases.</Paragraph>
  </Section>
class="xml-element"></Paper>