<?xml version="1.0" standalone="yes"?>
<Paper uid="C00-1074">
  <Title>Hybrid Neuro and Rule-Based Part of Speech Taggers</Title>
  <Section position="3" start_page="509" end_page="509" type="intro">
    <SectionTitle>
2 POS Tagging Problems
</SectionTitle>
    <Paragraph position="0"> In this paper, suppose there is a lexicon V, where the POSs that can be served by each word are list.ed, and tiler(; is a set of POSs, l?. That is, unknown words that do not exist in the lexicon are not dealt with. The POS tagging problem is thus to find a string of POSs T = T172..-% (ri C F, i = 1,-..,s) by following procedure ~o when sentence W = wlw2...w.~ (wi C V,</Paragraph>
    <Paragraph position="2"> where t is the index of the target word (the word to be tagged), and W t is a word sequence with length l + 1 + r (:entered on the target word: lie t : wt_ 1 .... io t * . . Wt+r~ (2) where t - 1 &gt; 1, t + r _&lt; s. 'l'agging ca.n thus be regarded as a classification problem 1) 3, replacing the POS with (;lass and can therefore be handled by using neural nets.</Paragraph>
  </Section>
class="xml-element"></Paper>