Abstract
We present a novel algorithm for Japanese dependency analysis. The algorithm allows us to analyze dependency structures of a sentence in linear-time while keeping a stateof-the-art accuracy. In this paper, we show a formal description of the algorithm and discuss it theoretically with respect to time complexity. In addition, we evaluate its efficiency and performance empirically against the Kyoto University Corpus Version 2. The proposed algorithm with improved models for dependency yields the best accuracy in the previously published results on the Kyoto University Corpus Version 2.
