Computing shortest words via shortest loops on hyperbolic surfaces

► We proposed algorithms to compute shortest words in surface homotopy group. ► We utilized hyperbolic metrics on triangulated surfaces. ► Under such a metric, shortest word is equivalent to shortest loop. ► Our algorithms are efficient by using local (transient) embedding. ► We employed several techniques to relieve numerical errors.