Triple-word arithmetic consists in representing high-precision numbers as the unevaluated sum of three floating-point numbers. We introduce and analyze various algorithms for manipulating triple-word numbers. Our new algorithms are faster than what one would obtain by just using the usual floating-point expansion algorithms in the special case of expansions of length 3, for a comparable accuracy.