An all-path parsing algorithm for a constraint-based dependency grammar of context-free power is presented. The grammar speci-fies possible dependencies between words together with a number of constraints. The algorithm builds a packed representation of ambiguous syntactic structure in the form of a dependency graph. For certain types of ambiguities the graph grows slower than the chart or parse forest.
展开▼
