In an lcfrs in which all functions are lexicalized, there is a one-to-one correspondence between the nodes in an evaluated tree and the positions in the string that the tree evaluates to.
tree and string implicitly form a dependency structure, and we can speak of the dependency language generated by a lexicalized lcfrs.