To construct a query, users draw a tree. However, unlike complete grammatical trees in the corpus, FTFs are general and incomplete . FTFs have been kept as simple as possible. Tree nodes form a tree, which means that two nodes at the same level in an FTF must have a common parent node. FTFs employ two broad classes of structural relationship.
Unary relationships are structural properties of a single tree node or text unit element.
These include the statement that a node is, or is not, the root , a leaf , or the first or last child in a sequence of child nodes. For text unit elements, they specify whether they are the first or last word in the sentence. Binary relationships relate the position of one tree node or text unit element to another. The parent of a node in an FTF is either immediately or eventually connected. The next child in a sequence of children may be just after another, just before or just after , following after , or before or after , or the relationship may be unknown.