<?xml version="1.0" standalone="yes"?>
<Paper uid="C94-1033">
  <Title>Backtracking-Free Dictionary Access Method for Japanese Morphological Analysis</Title>
  <Section position="4" start_page="211" end_page="211" type="evalu">
    <SectionTitle>
5 Experimental results
</SectionTitle>
    <Paragraph position="0"> We applied the TRIE with fail pointers to our 70,491-word dictionary for Japanese morphological analysis (in which the average word length is 2.8 characters) and compared it with a conventional TRIE-based system, using two sets of data: newspapers articles (44,113 characters) and computer manuals (235,104 characters). The results are shown in Table 1.</Paragraph>
    <Paragraph position="1"> The tables show both the number of node accesses and the actual CPU time. For the newspaper articles, our method (marked as TRIE w/ FP) had 25% fewer node accesses than than the SThis information is redundant, because one can look up every possible word by following the fail pointer, llowever, if the nodes are in secondary storage, it is wort, h having the length information within the node to minimize the disk access.</Paragraph>
  </Section>
class="xml-element"></Paper>