A Right-to-Left Chart Parsing with Headable Paths for Korean Dependency Grammar
暂无分享,去创建一个
In this paper, we propose a right-to-left dependency grammar parsing method for languages in which a governor appears after its modiier like Korean and Japanese. Unlike conventional left-to-right parsers, this parsing method can take advantage of the governor post-positioning property of such languages to reduce the size of search space by using the idea of a headable path. A headable path is a path which contains all candidate words which can be the governor of an input word during parsing. The experiments showed very promising results in reducing the number of intermediate dependency structures and actual parsing time.
[1] Makoto Nagao. Varieties of Heuristics in Sentence Parsing , 1994 .
[2] M. G. Wallace,et al. Language as a cognitive process, vol I: Syntax, Terry Winograd, Addison‐Wesley, 1983. No. of pages: 640. ISBN 0 201 08571 2 , 1983 .
[3] Terry Winograd,et al. Language as a Cognitive Process , 1983, CL.
[4] Fumiyo Fukumoto,et al. A Framework for Restricted Dependency Grammar , 1991, Natural Language Understanding and Logic Programming Workshop.