User blog comment:Naruyoko/PEGG detailed log/M/@comment-29915175-20190214164215/@comment-30754445-20190216205534

It's very easy to convert from the "Word Representation" to the FGH:

(1) To convert letters to ordinals:

E = 1

F = 2

G = 3

H = 4

J = ω

K = ω+1

L = ω+2

M = ωx2

And for a "word" with multiple letters, you simply add the ordinals up:

Hf = 4+2 = 6

Le = ω+2+1 = ω+3

(2) If the result is less than ω (i.e. the result is finite) then you add 1 to it.

(3) A subscript after the "word" means repetition. So, for example:

(Le)7100 ~ fω+37(100).

(4) Do the above for every "word" and nest the resulting FGH functions. For example:

(Le)7L4J6(Hf)3G8F6E5(5x1042) ~ fω+37(fω+24(fω6(f73(f48(f36(f25(5x1042))))))).

Keep in mind that this approximation isn't terribly accurate, because g f2(n) is not a very good approximation for En=10n. But it gives you a proper ballpark  estimate, which is what I assume you wanted.