In the most common variant of Paillier encryption with public modulus $n$, any plaintext in $[0,n)$ can be encrypted and decrypted (though sometime the interval is slightly reduced, or centered on zero). To be secure, Pailler encryption needs $n$ to have unknown factorization. That means like at least 1024-bit $n$ (with 2048-bit or more highly recommendable). That allows encrypting 127 (or 255) bytes. That's more than enough for UTF-8 encoding of any word in an English or French dictionary (I have no idea for others).
If encrypting character by character with Paillier encryption increases size by 10 only, then $n$ is at most 40-bit, and the encryption is thus not secure.
It's unusual to use Paillier encryption on text: it's primarily used when it's homomorphic property is useful. For text, practice is hybrid encryption, which allows arbitrary large plaintext.