An all-path parsing algorithm for constraint-based dependency grammars of CF-power

Authors:
Tomasz Obrębski
Affiliations:
Adam Mickiewicz University, Poznan, Poland
Venue:
TSD'07 Proceedings of the 10th international conference on Text, speech and dialogue
Year:
2007

Citing 3
Cited 0

Algorithm schemata and data structures in syntactic processing

Readings in natural language processing
Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems

Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems
Dependency Graphs in Natural Language Processing

AI*IA '95 Proceedings of the 4th Congress of the Italian Association for Artificial Intelligence on Topics in Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.