Statistical Bistratal Dependency Parsing

We present an inexact search algorithm for the problem of predicting a two-layered dependency graph. The algorithm is based on a k-best version of the standard cubictime search algorithm for projective dependency parsing, which is used as the backbone of a beam search procedure. This allows us to handle the complex nonlocal feature dependencies occurring in bistratal parsing if we model the interdependency between the two layers. We apply the algorithm to the syntactic

• Type: Journal
• Year: 2009
• Where: EMNLP
• Authors: Richard Johansson
• Keywords: EMNLP 2009, Inexact Search Algorithm, Natural Language Processing, Search Algorithm, Two-layered Dependency Graph