Follow the path of relation through the grid #6

There is a relation between rectilinear-adjacent squares such that there is a unique rectilinear path from the top-left corner of the grid down to the bottom-right corner of the grid. Each square can participate in the path no more than once. What is the relation and the path it induces?

Previous

I think this time the path is as follows

And the rule is as follows

Two numbers are adjacent on the path if they have the same number of letters in their English spelling (which is nine in all cases). Under this condition, the path is unique.