For a node n in the tree, n.t is the term at n, A(n) the ancestors of n, and P (n) the predecessors of n. A TFIT has a root node with the special term ⊥ and the conditional frequency ∞.
the following condition is true for any other node n: each node's term has the highest conditional frequency in the context of the node's ancestors and predecessors.