<?xml version="1.0" standalone="yes"?>
<Paper uid="A97-1011">
  <Title>A non-projective dependency parser</Title>
  <Section position="4" start_page="64" end_page="64" type="intro">
    <SectionTitle>
WWW t .
2 Background
</SectionTitle>
    <Paragraph position="0"> Our work is partly based on the work done with the Constraint Grammar framework that was originally proposed by Fred Karlsson (1990). A detMled description of the English Constraint Grammar (ENGCG) is in Karlsson et al. (1995). The basic rule types of the Constraint Grammar (Tapanainen, 1996) 2 are REMOVE and SELECT for discarding and selecting an alternative reading of a word. Rules also have contextual tests that describe the condition according to which they may be applied. For example,  the rule REMOVE (V) IF (-1C DET); discards a verb (V) reading if the preceding word (-1) is unambiguously (C) a determiner (DET). More than one such test can be appended to a rule.</Paragraph>
    <Paragraph position="1">  The rule above represents a local rule: the test checks only neighbouring words in a foreknown position before or after the target word. The test may also refer to the positions somewhere in the sentence without specifying the exact location. For instance,</Paragraph>
  </Section>
class="xml-element"></Paper>