| Abstract | We define a new formalism, based on Sikkel’s parsing schemata for constituency parsers , that can be used to describe, analyze and compare dependency parsing algorithms. |
| Dependency parsing schemata | Therefore, as items for constituency parsers are defined as sets of partial constituency trees, it is tempting to define items for dependency parsers as sets of partial dependency graphs. |
| Dependency parsing schemata | Once we have this definition of an item set for dependency parsing, the remaining definitions are analogous to those in Sikkel’s theory of constituency parsing (Sikkel, 1997), so we will not include them here in full detail. |
| Dependency parsing schemata | However, when executing this schema with a deductive engine, we can recover the parse forest by following back pointers in the same way as is done with constituency parsers (Billot and Lang, 1989). |
| Introduction | This is an alternative to constituency parsing , which tries to find a division of the sentence into segments (constituents) which are then broken up into smaller constituents. |
| Introduction | The formalism of parsing schemata (Sikkel, 1997) is a useful tool for the study of constituency parsers since it provides formal, high-level descriptions of parsing algorithms that can be used to prove their formal properties (such as correctness), establish relations between them, derive new parsers from existing ones and obtain efficient implementations automatically (Gomez-Rodriguez et al., 2007). |