Paper: Grammars For Local And Long Dependencies

ACL ID P01-1021
Title Grammars For Local And Long Dependencies
Venue Annual Meeting of the Association of Computational Linguistics
Session Main Conference
Year 2001

Polarized dependency (PD-) grammars are proposed as a means of efficient treatment of discontinuous construc- tions. PD-grammars describe two kinds of dependencies : local, explicitly de- rived by the rules, and long, implicitly specified by negative and positive va- lencies of words. If in a PD-grammar the number of non-saturated valencies in derived structures is bounded by a constant, then it is weakly equivalent to a cf-grammar and has a a0a2a1a4a3a6a5a8a7 - time parsing algorithm. It happens that such bounded PD-grammars are strong enough to express such phenomena as unbounded raising, extraction and ex- traposition.