<?xml version="1.0" standalone="yes"?>
<Paper uid="P01-1060">
  <Title>Parse Forest Computation of Expected Governors</Title>
  <Section position="8" start_page="0" end_page="0" type="concl">
    <SectionTitle>
B Parse Forest Lexicalization
</SectionTitle>
    <Paragraph position="0"> The function LEXICALIZE below takes an unlexicalized parse forest as argument and returns a lexicalized parse forests, where each symbol is uniquely labeled with a lexical head. Symbols are split if they have more than one lexical head.</Paragraph>
    <Paragraph position="1">  calling the function NEWT. The new symbols are linked to the original ones by means of a206a12a111a152a198a113 . For each rule in the old parse forest, the set of all possible combinations of the lexicalized daughter symbols is generated. The function LEMa23 a110 a27 returns the lemma associated with lexical rule a110 .  For each combination of lexicalized daughter symbols, a new rule is inserted by calling ADD.</Paragraph>
    <Paragraph position="2"> ADD calls NEWNT to create new non-terminals and NEWRULE to generate new rules. A non-terminal is only created if no symbol with the same lexical head was linked to the original node.</Paragraph>
  </Section>
class="xml-element"></Paper>