<?xml version="1.0" standalone="yes"?>
<Paper uid="P04-1041">
  <Title>Long-Distance Dependency Resolution in Automatically Acquired Wide-Coverage PCFG-Based LFG Approximations</Title>
  <Section position="3" start_page="0" end_page="0" type="intro">
    <SectionTitle>
2 Lexical Functional Grammar (LFG)
</SectionTitle>
    <Paragraph position="0"> the grouping of words and phrases into larger constituents and is realised in terms of a CF-PSG grammar. F(unctional)-structure represents abstract syntactic functions such as SUBJ(ect), OBJ(ect), OBL(ique), closed and open clausal COMP/XCOMP(lement), ADJ(unct), APP(osition) etc. and is implemented in terms of recursive feature structures (attribute-value matrices). C-structure captures surface grammatical configurations, f-structure encodes abstract syntactic information approximating to predicate-argument/dependency structure or simple logical form (van Genabith and Crouch, 1996). C- and f-structures are related in terms of functional annotations (constraints,</Paragraph>
    <Paragraph position="2"> Uparrows point to the f-structure associated with the mother node, downarrows to that of the local node.</Paragraph>
    <Paragraph position="3"> The equations are collected with arrows instantiated to unique tree node identifiers, and a constraint solver generates an f-structure.</Paragraph>
  </Section>
class="xml-element"></Paper>