Polarized Non-projective Dependency Grammars

Dikovsky, Alexander

doi:10.1007/3-540-48199-0_9

Cited by 5 publications

(11 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…5. As we show in (Dikovsky, 2001), the weak generative capacity of PD-grammars is stronger than that of cf-grammars. For example, the PDgrammar…”

Section: Polarized Dependency Grammarsmentioning

confidence: 58%

“…The mechanism of establishing long dependencies is orthogonal to reduction and is implemented by a universal and simple rule of valencies saturation. A simplified version of PDgrammars adapted for the theoretical analysis is introduced and explored in (Dikovsky, 2001). In this paper, we describe a notion of PD-grammar more adapted for practical tasks.…”

Section: ¡ ¤ £ ¥ §mentioning

confidence: 99%

“…the set of lists of pairwise different valencies, and n is a set of reduction rules. For simplicity, we start with the strict reduction rules (the only rules in (Dikovsky, 2001)…”

Section: Polarized Dependency Grammarsmentioning

confidence: 99%

“…For the space reasons, we don't cite its definition, the more so that the linguistic PD-grammars should certainly be lc-free. In (Dikovsky, 2001) we prove the following theorem. Theorem 1.…”

mentioning

confidence: 93%

“…Even if in a reduction to an axiom all valencies are saturated, this does not guarantee that a D-tree is derived: the graph may have cycles. In (Dikovsky, 2001) we give a sufficient condition for a PD-grammar of never producing cycles while FA-saturation. We call the grammars satisfying this condition lc-(locally cycle-) free.…”

mentioning

confidence: 99%

See 4 more Smart Citations

Grammars for local and long dependencies

Dikovsky

2001

Proceedings of the 39th Annual Meeting on Association for Computational Linguistics - ACL '01

Self Cite

View full text Add to dashboard Cite

Polarized dependency (PD-) grammars are proposed as a means of efficient treatment of discontinuous constructions. PD-grammars describe two kinds of dependencies : local, explicitly derived by the rules, and long, implicitly specified by negative and positive valencies 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 ¢ ¡ ¤ £ ¦ ¥ § time parsing algorithm. It happens that such bounded PD-grammars are strong enough to express such phenomena as unbounded raising, extraction and extraposition.

show abstract

“…5. As we show in (Dikovsky, 2001), the weak generative capacity of PD-grammars is stronger than that of cf-grammars. For example, the PDgrammar…”

Section: Polarized Dependency Grammarsmentioning

confidence: 58%

Section: ¡ ¤ £ ¥ §mentioning

confidence: 99%

“…the set of lists of pairwise different valencies, and n is a set of reduction rules. For simplicity, we start with the strict reduction rules (the only rules in (Dikovsky, 2001)…”

Section: Polarized Dependency Grammarsmentioning

confidence: 99%

mentioning

confidence: 93%

mentioning

confidence: 99%

See 3 more Smart Citations