Favor Short Dependencies: Parsing with Soft and Hard Constraints on Dependency Length [chapter]

Jason Eisner, Noah A. Smith
2010 Text, Speech and Language Technology  
In lexicalized phrase-structure or dependency parses, a word's modifiers tend to fall near it in the string. This fact can be exploited by parsers. We first show that a crude way to use dependency length as a parsing feature can substantially improve parsing speed and accuracy in English and Chinese, with more mixed results on German. We then show similar improvements by imposing hard bounds on dependency length and (additionally) modeling the resulting sequence of parse fragments. The approach
more » ... with hard bounds, "vine grammar," accepts only a regular language, even though it happily retains a context-free parameterization and defines meaningful parse trees. We show how to parse this language in O(n) time, using a novel chart parsing algorithm with a low grammar constant (rather than an impractically large finite-state recognizer with an exponential grammar constant). For a uniform hard bound of k on dependencies of all types, our algorithm's runtime is O(nk 2 ). We also extend our algorithm to parse weighted-FSA inputs such as lattices.
doi:10.1007/978-90-481-9352-3_8 fatcat:n3otracsgzgozi6dwe7bemzdja