Thus, as originally presented, Kay's algorithm is correct only for a very restricted set of unification grammars.
we draw from the larger term set T F that includes in addition the collection of path-terms that combine constants with sequences of attributes.