<?xml version="1.0" standalone="yes"?>
<Paper uid="P06-2048">
  <Title>Exploring the Potential of Intractable Parsers</Title>
  <Section position="4" start_page="369" end_page="369" type="intro">
    <SectionTitle>
2 Preliminaries
</SectionTitle>
    <Paragraph position="0"> For the following discussion, it will be useful to establish some terminology and notational conventions. Typically we will represent variables with capital letters (e.g. X, Y ) and sets of variables with bold-faced capital letters (e.g. X, Y). The domain of a variable X will be denoted dom(X), and typically we will use the lower-case correspondent (in this case, x) to denote a value in the domain of X. A partial assignment (or simply assignment) of a set X of variables is a function w that maps a subset W of the variables of X to values in their respective domains. We de ne dom(w) = W. When W = X, then we say that w is a full assignment of X. The trivial assignment of X makes no variable assignments.</Paragraph>
    <Paragraph position="1"> Let w(X) denote the value that partial assignment w assigns to variable X. For value x [?] dom(X), let w[X = x] denote the assignment identical to w except that w[X = x](X) = x.</Paragraph>
    <Paragraph position="2"> For a set Y of variables, let w|Y denote the restriction of partial assignment w to the variables in dom(w) [?] Y.</Paragraph>
  </Section>
class="xml-element"></Paper>