Abstrakt
In this paper is introduced the notion of full analysis by reduction on A-trees, and some of its constraints. It serves as a formal tool that helps to find adequate (types of) rules for restarting automata describing Czech syntax.
A-trees represents a formalization of trees as they are used in the Prague Dependency Treebank (PDT). The full analysis by reduction of A-trees consists of all minimal correct reductions using two elementary operations, namely the delete and shift.
The main focus is on the development of a formalism allowing for an exact formulation of linguistic properties of individual parameters of analysis by reduction of trees in the PDT format. With the help of linguistic observations we refine complexity properties of A-trees with respect to dependency and coordination relations.
We emphasize those properties in which these relations differ.