If your main concern is accurate numerical calculation (rather than finding a closed form expression), then I think the ideal tool for this problem would be to use Chebyshev function approximation.
First, you calculate the coefficients for the Chebyshev series of the integrand. For this particular function, you need a few hundred of them to achieve double precision accuracy. Then there's a simple formula to calculate the Chebyshev coefficients of the integral. With those coefficients, you can quickly calculate the integral to machine precision at any point in the domain $[-1,1]$.
In python, the numpy library can do all this in a single line of code:
f = np.polynomial.Chebyshev.interpolate(lambda x: np.exp(1/(x**2 -1)), 256).integ()
For details on the theory, refer to the work of Nick Trefethen and collaborators (the Chebfun package). But, briefly, the Chebyshev series is a way of representing a function on a finite interval by expanding it as a sum of orthogonal polynomials:
$$
e^{\frac{1}{x^2-1}} = \sum_{n=0}^\infty a_n T_n(x) \quad \forall x \in [-1,1]
$$
$$T_n(\cos(x)) := \cos(n x)$$
$$
a_n := \frac{\int_{-1}^{1} e^{\frac{1}{x^2-1}} T_n(x) \frac{dx}{\sqrt{1-x^2}}}
{\int_{-1}^{1} T_n(x)^2 \frac{dx}{\sqrt{1-x^2}}}
$$
Then with those coefficients you can use the properties of the Chebyshev polynomials to integrate it:
$$
\int_0^x e^{\frac{1}{t^2-1}} dt = \sum_{n=1}^\infty \frac{a_{n-1} - a_{n+1}}{2n} T_n(x) \quad \forall x \in [-1,1]
$$
In practice, we compute enough coefficients to achieve a desired accuracy. There are fast algorithms for evaluating the series at a given point.