x1 and x2 are path-linked by binary predicate x3 (ka; possibly non-symmetric/non-commutative) via some from-x1-to-x2-directed path of length x4 (li; nonnegative integer or positive infinity) in/through graph x5 (default: maximal) which is generated by relation x3.
Like ".utka'au" but primarily without the constraint that a geodesic path be chosen. The requirement simply is that there exists at least one path from x1 to x2 via steps related by x3 in x5 such that the path has total length x4. Notice that this does not interact well if the directed graph is connected to at least one cycle. Otherwise, as appropriate, this word and all of its notes are equivalent to those of ".utka'au".