Sciweavers

Share
COLING
2008

Japanese Dependency Parsing Using a Tournament Model

9 years 4 months ago
Japanese Dependency Parsing Using a Tournament Model
In Japanese dependency parsing, Kudo's relative preference-based method (Kudo and Matsumoto, 2005) outperforms both deterministic and probabilistic CKY-based parsing methods. In Kudo's method, for each dependent word (or chunk) a loglinear model estimates relative preference of all other candidate words (or chunks) for being as its head. This cannot be considered in the deterministic parsing methods. We propose an algorithm based on a tournament model, in which the relative preferences are directly modeled by one-onone games in a step-ladder tournament. In an evaluation experiment with Kyoto Text Corpus Version 4.0, the proposed method outperforms previous approaches, including the relative preference-based method.
Masakazu Iwatate, Masayuki Asahara, Yuji Matsumoto
Added 29 Oct 2010
Updated 29 Oct 2010
Type Conference
Year 2008
Where COLING
Authors Masakazu Iwatate, Masayuki Asahara, Yuji Matsumoto
Comments (0)
books