<?xml version="1.0" standalone="yes"?>
<Paper uid="C00-2109">
  <Title>Backward Beam Search Algorithm for Dependency Analysis of Japanese</Title>
  <Section position="7" start_page="759" end_page="759" type="concl">
    <SectionTitle>
5 Conclusion
</SectionTitle>
    <Paragraph position="0"> In this paper, we proposed a statistical Jttpanese dependency analysis method which processes a sentence backwards. As dependencies normally go from left to right in Japanese, it is eflhctive to analyze sentences backwards (from right to left). In this paper, we proposed a Japanese dependency analysis which combines a backward analysis and a statistical method. It can naturally incorporate a beam search strategy, an effective way of limiting the search space in the backwm'd analysis. We observed that the best perfbrmances were achieved when the width is very small. Actually, 95% of the analyses obtained with bemn width=l were the stone as the best analyses with beam width=20. The analysis time was proportional to the square of the sentence length (nmnber of segments), as was predicted from the algorithm. The average analysis time was 0.03 second (average sentence length was 10.0 bunsetsus) and it took 0.29 secend to analyze the longest sentence, which has 41 segments. This method can be ~tpplied to various languages which haw~ the stone or similar characteristics of dependencies, for example Koran, Turkish etc.</Paragraph>
  </Section>
class="xml-element"></Paper>