TY - GEN
T1 - A reranking approach for dependency parsing with variable-sized subtree features
AU - Shen, Mo
AU - Kawahara, Daisuke
AU - Kurohashi, Sadao
PY - 2012
Y1 - 2012
N2 - Employing higher-order subtree structures in graph-based dependency parsing has shown substantial improvement over the accuracy, however suffers from the inefficiency increasing with the order of subtrees. We present a new reranking approach for dependency parsing that can utilize complex subtree representation by applying efficient subtree selection heuristics. We demonstrate the effectiveness of the approach in experiments conducted on the Penn Treebank and the Chinese Treebank. Our system improves the baseline accuracy from 91.88% to 93.37% for English, and in the case of Chinese from 87.39% to 89.16%.
AB - Employing higher-order subtree structures in graph-based dependency parsing has shown substantial improvement over the accuracy, however suffers from the inefficiency increasing with the order of subtrees. We present a new reranking approach for dependency parsing that can utilize complex subtree representation by applying efficient subtree selection heuristics. We demonstrate the effectiveness of the approach in experiments conducted on the Penn Treebank and the Chinese Treebank. Our system improves the baseline accuracy from 91.88% to 93.37% for English, and in the case of Chinese from 87.39% to 89.16%.
UR - http://www.scopus.com/inward/record.url?scp=84883420449&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84883420449&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:84883420449
SN - 9789791421171
T3 - Proceedings of the 26th Pacific Asia Conference on Language, Information and Computation, PACLIC 2012
SP - 308
EP - 317
BT - Proceedings of the 26th Pacific Asia Conference on Language, Information and Computation, PACLIC 2012
T2 - 26th Pacific Asia Conference on Language, Information and Computation, PACLIC 2012
Y2 - 7 November 2012 through 7 November 2012
ER -