Abstract

This paper demonstrates that machine learning is a suitable approach for rapid parser development. From 1000 newly treebanked Korean sentences we generate a deterministic shift-reduce parser. The quality of the treebank, particularly crucial given its small size, is supported by a consistency checker.

Date

March 18, 2026

Authors

Ulf Hermjakob

Conference

1st Meeting of the North American Chapter of the Association for Computational Linguistics