... That is, to decide the relationof morphemes j and i (j < i), we use morphemesj−2, j−1, j, j+1, j+2 and i−2, i−1, i, i+1, i+2.Running Time and Asymptotic Time Complex-ity We have observed ... 2006 shared task (Buchholz and Marsi,2006) can handle Japanese sentences. But they arebasically word-based.49Window Size Dep. Acc. Dep. Type Acc.0 (T = 1) 82.71 99 .29 1 (T = 2) 93.57 99.492 ... perceptron algorithm. Machine Learning,37(3):277 296 .U. Kreßel. 1999. Pairwise classification and support vec-tor machines. In B. Sch¨olkopf, C. J. Burges, and A. J.Smola, editors, Advances in Kernel...