Next: , Up: Solver

7.1 Principles overview

In this section, we give an overview of the principle library. Roughly, we divide the principles into families lumped together under explanatory themes.

7.1.1 Graph

This family defines graphs and further restricts them. It contains the following principles:

The Graph1 principle is more efficient than the Graph principle, but it is not compatible with some of the principles, e.g. the Valency principle (Valency1).

The Graph1Constraints and GraphConstraints omit non-deterministic distribution, which can be added on using resp. Graph1Dist and GraphDist. Omitting distribution can be useful if you do not want to enumerate the models on a particular dimension, e.g. for scope underspecification (cf. the Chorus grammar (Chorus)).

The Dag and Tree principles further restrict the graphs to be directed acyclic graphs (dags) or trees.

7.1.2 Valency

This family constrains the incoming and outgoing edges of nodes. It contains the following principles:

7.1.3 Agreement

This family controls agreement and government. It contains the following principles:

Both the Agreement and the Government principles depend on the Agr principle.

7.1.4 Order

This family defines order on graphs and further restricts it. It contains the following principles:

The Order1 principle is more general than the Order principle: It orders sets of labels instead of just labels. The Order2 principle lexicalized but less efficient.

The Order1Constraints and OrderConstraints omit non-deterministic distribution, which can be added on using resp. Order1Dist and OrderDist.

The Parse principle further restricts the Order and Order1 principles to respect the order of the input. If it is not used, the input is regarded as a bag of words.

The SameOrder principle also further restricts the Order and Order1 principles. For all nodes, it equates the positions of the corresponding words.

7.1.5 Climbing

This family specifies and further restricts the climbing relation between two dimensions. It contains the following principles:

The Barriers, BarriersAttrib and BarriersLabels principles depends on the Climbing principle, and specifies further restrictions on climbing.

7.1.6 Linking

This is the family of linking principles, stipulating, for each edge from v to v' labeled l on D1, the corresponding path (from v) to v' on D2.

It contains the following principles:

Some principles (LinkingNotDaughter, LinkingNotMother, LinkingSisters do not stipulate a path, but we dub them linking principles nonetheless since they follow a similar concept.

7.1.7 TAG encoding

This family includes constraints developed for the encoding of Tree Adjoining Grammar (TAG). It includes the following constraints:

7.1.8 Test

This principle can be used to test out constraints:

7.1.9 Miscellaneous

These are the remaining constraints, defying to be lumped together yet: