<?xml version="1.0" standalone="yes"?>
<Paper uid="C94-1025">
  <Title>PROBABILISTIC TAGGING WITH FEATURI~ STR,UCTUR,I;3S</Title>
  <Section position="8" start_page="164" end_page="164" type="concl">
    <SectionTitle>
6 FURTHEI~ RESEARCH
</SectionTitle>
    <Paragraph position="0"> We intend to search for other similar models while keeping in mind the basic idea described above: Splitring up a tag into D-pairs and deducing it, s contextual probability from the contextual probabilities of its fvpairs. null Furthermore, it may be preferable to split up the tags only when tim frequencies are too small s .</Paragraph>
    <Paragraph position="1"> 7 For a similar experiment for Qerman (20,000 words training corpus, 689 tags, trigrams) an accuracy of 72.5 % has been reported (Wothke et al., 1993, p. 21).</Paragraph>
    <Paragraph position="2"> Ssuggestcd by 'red Briscoe, Rank Xerox Research Centre, Grenoble, France</Paragraph>
  </Section>
class="xml-element"></Paper>