The Antisymmetrizer

Enter your tree in qtree bracket notation.

[.DP [.D the ] [.NP [.AP [.A tall ] ] [.N' [.N man ] [.PP [.P in ] [.DP [.D the ] [.NP [.AP [.A yellow ] ] [.N' [.N hat ] ] ] ] ] ] ] ]

Settings:

α c-commands β iff

α and β are categories
every node that dominates α dominates β
every node that completely dominates α completely dominates β (warning: can be slow with long input), and
α does not dominate β
α does not completely dominate β
α excludes β (no segment of α dominates β)

The image d(α) is the set of leaves that are dominated by α or completely dominated by α.

Here is the tree we will actually antisymmetrize:

We first create a list of ordered pairs <α,β> where α asymmetrically c-commands β:

A = {}

We now compute the image d of all pairs: (Show duplicates)

d(A) = {}

Here are any and all final linearizations: