This is a proof that Omega Krypton's answer of 38 is optimal, as long as these words are nonexistent (single implication):
EEVEN,EINE,ENINE,FIUR,FIVR,FOVE,NIGE,NINH,OWO,,SEGEN,SEVET,SEVHN,SIVEN,TNO,TWE
First, a calculation of the theoretical best (although no suitable words may exist), by using a Levenshteins distance (word difference by letters) calculator:
TEN -> NINE = 3, Gareth's, Omega's, devyndraen's answers already
optimized
NINE -> EIGHT = 4, Currently answers have 5 steps
EIGHT -> SEVEN = 5, Currently answers have 6+ steps
SEVEN -> SIX = 4, Gareth's, Omega's, devyndraen's answers already
optimized
SIX -> FIVE = 3, Omega's, devyndraen's answers already optimized
FIVE -> FOUR = 3, Currently answers have 4 steps
FOUR -> THREE = 5, Omega's answer optimized (there is some dispute
there?)
THREE -> TWO = 4, Omega's, devyndraen's answers already optimized
TWO -> ONE = 3, Currently answers have 4 steps
Theoretical minimum = 3+4+5+4+3+3+5+4+3 = 34
Now let's analyse the algorithm and already existing answers on each non-optimized point to see if there is room for improvement:
NINE -> EIGHT = 4
This keeps the I intact, substitutes N,N,E, and adds T. One of the following words would have to exist:
ENINE,EINE,NIGE,NINH.
EIGHT -> SEVEN = 5
This obviously is 5 substitutions. One of these would be needed(reverse from seven): EEVEN,SIVEN,SEGEN,SEVHN,SEVET
FIVE -> FOUR = 3
3 substitutions, would need: FOVE,FIUR,FIVR
TWO -> ONE = 3
3 substitutions, would need: OWO,TNO,TWE
Q.E.D.