<?xml version="1.0" standalone="yes"?>
<Paper uid="P88-1026">
  <Title>Lexicon and grammar in probabilistic tagging of written English.</Title>
  <Section position="10" start_page="214" end_page="215" type="concl">
    <SectionTitle>
10. Feamrisation
</SectionTitle>
    <Paragraph position="0"> The development of the CLAWS tagset md UCREL grammar owes much to the work of Quirk et al. (1985) while the tags themselves have evolved from the Brown tagset G:~ and Ku~ra, 1982). However, the rules and symbols chosen have been wa~l,-~_ into a notation compatible with other theories of grammar. For instate, tags from the extended ve~ion of the CLAWS lexicon have been translated into a formalism compatible with the Winchester pa~er (Sharman, 1988). A program has also been written to map all of the ten thousand productions of the c~urent UCREL grammar into the notation used by the Gr~-mm~tr Deve/opment Environment ((\]DE) (Briscoe et at., 1987; Grover et aL, 1988; Carroll et aL. 1988). This is a l~.liminary step in the task of recasting the grammar into a feanne-hased unification formalism which will allow us to radically reduce the size of the rule set while preventing file grammar from overgeneradng.</Paragraph>
    <Paragraph position="2"/>
    <Paragraph position="4"> In ,~m~/, we have a wor~ tagging system fl~ minimal post-editing, a _~jly accumulating C/oqms of parsed and a C/OIIge~-fl~: ~'.~rnmar of about ten thousand producdons which is currently being recast into a unification forma, m Additionally, w~ have p~grams for extruding statistical and conocatinnal data from both word tagged and pined text cotl~Om.</Paragraph>
  </Section>
class="xml-element"></Paper>